oj.uz

Submission #396788

# Submission time Handle Problem Language Result Execution time Memory
396788 2021-04-30T18:35:41 Z keta_tsimakuridze The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 48904 KB 
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N=2e3+5,mod=1e9+7;
int t,a[N][N],r[N],l[N],mn[N],mx[N],n,m,ans,mid;
map<int,int> fix;
vector<int> val;
string s;

bool check(int mx1){
	int diff=mx1-val[0];
	for(int i=1;i<=n;i++) {
		l[i]=m+1;  r[i]=0;
	}
	for(int i=1;i<=n;i++) {
		for(int j=m;j>=1;j--){
			if(a[i][j]>mx1) l[i] = j - 1;
		}
		for(int j=1;j<=m;j++){
			if(a[i][j]+diff<val.back()) r[i] = j ;
		}
		 // [r[i] , l[i]) 
		 if(l[i]<r[i]) return 0;
	}
	int F=0;
	int cur=m;
	for(int i=1;i<=n;i++) {
		if(r[i]>cur) {
			F=1;
			break;
		} 
		cur = min(l[i],cur);
	}
	if(!F) return 1; 
	F=0;
	cur=0;
	for(int i=1;i<=n;i++) {
		if(l[i]<cur) {
			F=1;
			break;
		}
		cur = max(r[i],cur);
	}
	if(!F) return 1;
	return 0;
}
void search(){	
	int l = 0,r =(int)val.size()-1;
	while(l<=r){
		 mid=(l+r)/2; 
		if(check(val[mid])) { 
			ans =min(ans, (val[mid]-val[0])); 
			r=mid-1;
		}
		else l=mid+1;
	}
}
 main(){
 	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	// t=1;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin >> a[i][j]; 
			if(!fix[a[i][j]]) val.push_back(a[i][j]);
			fix[a[i][j]]=1;
		}
		
	} 
	sort(val.begin(),val.end()); ans=val.back()-val[0];
	search();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m/2;j++){
			swap(a[i][j],a[i][m-j+1]);
		}
	}
	search();
	val.clear();
	for(int i=1;i<=n;i++) {
		for(int j=1;j<=m;j++){
			a[i][j]=-a[i][j];
			if(!fix[a[i][j]]) val.push_back(a[i][j]);
			fix[a[i][j]]=1;
		}
	}
	sort(val.begin(),val.end());
	search();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m/2;j++){
			swap(a[i][j],a[i][m-j+1]);
		}
	}
	search();
	cout<<ans;
}

Compilation message

joioi.cpp:59:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   59 |  main(){
      |       ^

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 1208 KB Output is correct
17 Correct 46 ms 5120 KB Output is correct
18 Correct 53 ms 5056 KB Output is correct
19 Correct 47 ms 5008 KB Output is correct
20 Correct 45 ms 4552 KB Output is correct
21 Correct 46 ms 5128 KB Output is correct
22 Correct 46 ms 5112 KB Output is correct
23 Correct 47 ms 5192 KB Output is correct
24 Correct 39 ms 4652 KB Output is correct
25 Correct 49 ms 5144 KB Output is correct
26 Correct 57 ms 5108 KB Output is correct
27 Correct 47 ms 5108 KB Output is correct
28 Correct 54 ms 5152 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 1208 KB Output is correct
17 Correct 46 ms 5120 KB Output is correct
18 Correct 53 ms 5056 KB Output is correct
19 Correct 47 ms 5008 KB Output is correct
20 Correct 45 ms 4552 KB Output is correct
21 Correct 46 ms 5128 KB Output is correct
22 Correct 46 ms 5112 KB Output is correct
23 Correct 47 ms 5192 KB Output is correct
24 Correct 39 ms 4652 KB Output is correct
25 Correct 49 ms 5144 KB Output is correct
26 Correct 57 ms 5108 KB Output is correct
27 Correct 47 ms 5108 KB Output is correct
28 Correct 54 ms 5152 KB Output is correct
29 Correct 3298 ms 25068 KB Output is correct
30 Correct 3426 ms 47460 KB Output is correct
31 Execution timed out 4005 ms 48904 KB Time limit exceeded
32 Halted 0 ms 0 KB -