UOJ Logo

NOI.AC

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#213775#2406. Thief Mastersjsxheng1003018ms24688kbC++111.2kb2024-11-13 19:21:282024-11-13 23:01:32

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
namespace IO{
	template<typename T> inline void read(T &x){
		bool f=1;x=0;char ch=getchar();
		while(ch<'0'||ch>'9'){if(ch=='-')f=0;ch=getchar();}
		while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch&15),ch=getchar();
		x=f?x:-x;
	}
	template<typename T> inline void write(T x){
		if(x<0) putchar('-'),x=-x;
	   	if(x>9) write(x/10);
	   	putchar(('0'+x%10));
	}
	template <typename T,typename ...Args> inline void read(T &x,Args &...args){read(x);read(args...);}
	template<typename T> inline void write(T x,char c){write(x),putchar(c);}
}
using namespace IO;
int a,b,n,m[1005][1005],ans=INT_MAX;
int maxn[1005][1005],minn[1005][1005];
signed main(){
	read(a,b,n);
	for(int i=0;i<a;++i)
		for(int j=0;j<b;++j){
			read(m[i][j]);
			maxn[i][j]=minn[i][j]=m[i][j];
		}
	
	for(int k=2;k<=n;++k)
		for(int i=0;i+1<a;++i)
			for(int j=0;j+1<b;++j){
				maxn[i][j]=max(m[i][j],max(maxn[i+1][j+1],max(maxn[i+1][j],maxn[i][j+1])));
				minn[i][j]=min(m[i][j],min(minn[i+1][j+1],min(minn[i+1][j],minn[i][j+1])));
			}
	for(int i=0;i<=a-n;++i)
		for(int j=0;j<=b-n;++j)ans=min(ans,maxn[i][j]-minn[i][j]);
	write(ans);
	return 0;
}

Details

小提示:点击横条可展开更详细的信息

Test #1:

score: 10
Accepted
time: 532ms
memory: 24684kb

input:

1000 1000 100
804544523 340648618 718292412 235345736 704741136 942776831 741228920 463473302 677289...

output:

998893495

result:

ok single line: '998893495'

Test #2:

score: 10
Accepted
time: 0ms
memory: 1180kb

input:

5 4 2
1 2 5 6
0 17 16 0
16 17 0 1
2 10 2 1
1 2 3 2

output:

2

result:

ok single line: '2'

Test #3:

score: 10
Accepted
time: 2ms
memory: 2552kb

input:

100 100 10
2 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 1200001 ...

output:

908999

result:

ok single line: '908999'

Test #4:

score: 10
Accepted
time: 207ms
memory: 24684kb

input:

1000 1000 20
1 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 120000...

output:

1901899

result:

ok single line: '1901899'

Test #5:

score: 10
Accepted
time: 137ms
memory: 12900kb

input:

500 500 50
79289095 232165705 955620938 481434262 465576217 112035388 50089892 459799006 181906335 3...

output:

995944328

result:

ok single line: '995944328'

Test #6:

score: 10
Accepted
time: 284ms
memory: 12912kb

input:

500 1000 80
499163842 331022295 940054497 684192083 248823911 842132608 629298697 398526298 98438040...

output:

998299092

result:

ok single line: '998299092'

Test #7:

score: 10
Accepted
time: 673ms
memory: 24684kb

input:

1000 1000 80
102 134 429 251 299 109 264 669 727 296 112 550 270 270 544 660 131 546 968 219 113 678...

output:

998

result:

ok single line: '998'

Test #8:

score: 10
Accepted
time: 135ms
memory: 12900kb

input:

500 500 100
65532583 920409544 753795976 989349545 818384831 778207112 425141881 853270293 542112588...

output:

999172505

result:

ok single line: '999172505'

Test #9:

score: 10
Accepted
time: 453ms
memory: 12912kb

input:

500 1000 100
456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...

output:

998801667

result:

ok single line: '998801667'

Test #10:

score: 10
Accepted
time: 595ms
memory: 24688kb

input:

1000 1000 100
629053044 957239666 456746076 940194386 201529807 592062148 244394389 825620014 223976...

output:

998862873

result:

ok single line: '998862873'

Extra Test:

score: 0
Extra Test Passed