oj.uz

Submission #1114072

# Submission time Handle Problem Language Result Execution time Memory
1114072 2024-11-18T07:28:12 Z Dan4Life The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 3374 ms 108636 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int N = (int)2e3+10;
int n, m;
int dp[N][N], pref[N][N];
int a[N][N], b[N][N], c[N][N];
 
void Rotate(){
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			c[i][j] = b[i][j];
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			b[j][i] = c[i][m-j-1];
	swap(n,m);
}
 
bool calc(){
	for(int k : {0,1}){
		memset(dp,0,sizeof(dp));
		for(int i = 0; i < n; i++){
			for(int j = 0; j < m; j++){
				pref[i][j+1] = pref[i][j]+(!b[i][j] or b[i][j]==k);
			}
		}
		int bst=-1,bst2;
		for(int i = 0; i < n; i++){
			bst2=-1; int sum = 0, lst = 0;
			for(int j = 0; j < m; j++) if(b[i][j]==k) lst=j+1;
			for(int j = lst; j <= m; j++){
				if(pref[i][j]!=j) break;
				if(!i) dp[i][j]=(j!=m);
				else if(bst!=-1) dp[i][j]=(bst<=j);
				if(dp[i][j] and bst2==-1) bst2=j;
			}
			bst=bst2;
		}
		bool ok = 0;
		for(int i = 1; i <= m; i++) ok|=dp[n-1][i];
		if(ok) return 1;
	}
	return 0;
}
 
int mn = (int)1e9, mx = 0;
bool chk(int R){
	memset(b,0,sizeof(b));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(a[i][j]>mn+R) b[i][j]=2;
			if(a[i][j]<mx-R){
				if(b[i][j]==2) return 0;
				b[i][j] = 1;
			}
		}
	}
	bool ok = 0;
	for(int i = 0; i < 4; i++) 
		ok|=calc(), Rotate();
	return ok;
}
 
int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			cin >> a[i][j],mn=min(mn,a[i][j]),mx=max(mx,a[i][j]);
	int l = 0, r = mx-mn;
	while(l<r){
		int mid = (l+r)/2;
		if(chk(mid)) r=mid;
		else l=mid+1;
	}
	cout << l << "\n";
}

Compilation message

joioi.cpp: In function 'bool calc()':
joioi.cpp:31:17: warning: unused variable 'sum' [-Wunused-variable]
   31 |    bst2=-1; int sum = 0, lst = 0;
      |                 ^~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36176 KB Output is correct
2 Correct 16 ms 36176 KB Output is correct
3 Correct 92 ms 36176 KB Output is correct
4 Correct 57 ms 36176 KB Output is correct
5 Correct 87 ms 36176 KB Output is correct
6 Correct 73 ms 36176 KB Output is correct
7 Correct 108 ms 36176 KB Output is correct
8 Correct 113 ms 36176 KB Output is correct
9 Correct 110 ms 36176 KB Output is correct
10 Correct 115 ms 36192 KB Output is correct
11 Correct 104 ms 36176 KB Output is correct
12 Correct 118 ms 36176 KB Output is correct
13 Correct 117 ms 36176 KB Output is correct
14 Correct 129 ms 36176 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36176 KB Output is correct
2 Correct 16 ms 36176 KB Output is correct
3 Correct 92 ms 36176 KB Output is correct
4 Correct 57 ms 36176 KB Output is correct
5 Correct 87 ms 36176 KB Output is correct
6 Correct 73 ms 36176 KB Output is correct
7 Correct 108 ms 36176 KB Output is correct
8 Correct 113 ms 36176 KB Output is correct
9 Correct 110 ms 36176 KB Output is correct
10 Correct 115 ms 36192 KB Output is correct
11 Correct 104 ms 36176 KB Output is correct
12 Correct 118 ms 36176 KB Output is correct
13 Correct 117 ms 36176 KB Output is correct
14 Correct 129 ms 36176 KB Output is correct
15 Correct 21 ms 37712 KB Output is correct
16 Correct 29 ms 40184 KB Output is correct
17 Correct 111 ms 40272 KB Output is correct
18 Correct 45 ms 40272 KB Output is correct
19 Correct 92 ms 41552 KB Output is correct
20 Correct 95 ms 39248 KB Output is correct
21 Correct 151 ms 41552 KB Output is correct
22 Correct 66 ms 41552 KB Output is correct
23 Correct 143 ms 41552 KB Output is correct
24 Correct 64 ms 39504 KB Output is correct
25 Correct 140 ms 41684 KB Output is correct
26 Correct 127 ms 40448 KB Output is correct
27 Correct 144 ms 40284 KB Output is correct
28 Correct 164 ms 40432 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36176 KB Output is correct
2 Correct 16 ms 36176 KB Output is correct
3 Correct 92 ms 36176 KB Output is correct
4 Correct 57 ms 36176 KB Output is correct
5 Correct 87 ms 36176 KB Output is correct
6 Correct 73 ms 36176 KB Output is correct
7 Correct 108 ms 36176 KB Output is correct
8 Correct 113 ms 36176 KB Output is correct
9 Correct 110 ms 36176 KB Output is correct
10 Correct 115 ms 36192 KB Output is correct
11 Correct 104 ms 36176 KB Output is correct
12 Correct 118 ms 36176 KB Output is correct
13 Correct 117 ms 36176 KB Output is correct
14 Correct 129 ms 36176 KB Output is correct
15 Correct 21 ms 37712 KB Output is correct
16 Correct 29 ms 40184 KB Output is correct
17 Correct 111 ms 40272 KB Output is correct
18 Correct 45 ms 40272 KB Output is correct
19 Correct 92 ms 41552 KB Output is correct
20 Correct 95 ms 39248 KB Output is correct
21 Correct 151 ms 41552 KB Output is correct
22 Correct 66 ms 41552 KB Output is correct
23 Correct 143 ms 41552 KB Output is correct
24 Correct 64 ms 39504 KB Output is correct
25 Correct 140 ms 41684 KB Output is correct
26 Correct 127 ms 40448 KB Output is correct
27 Correct 144 ms 40284 KB Output is correct
28 Correct 164 ms 40432 KB Output is correct
29 Correct 1566 ms 88904 KB Output is correct
30 Correct 1677 ms 90440 KB Output is correct
31 Correct 2077 ms 92080 KB Output is correct
32 Correct 1653 ms 91464 KB Output is correct
33 Correct 683 ms 89700 KB Output is correct
34 Correct 1762 ms 79432 KB Output is correct
35 Correct 2713 ms 108636 KB Output is correct
36 Correct 1700 ms 105056 KB Output is correct
37 Correct 3374 ms 90716 KB Output is correct