Submission #1114082

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1114082	2024-11-18T07:33:19 Z	Dan4Life	The Kingdom of JOIOI (JOI17_joioi)	C++17	100 / 100	2763 ms	83592 KB

joioi

#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, dp[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 : {1,2}){
		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 = 0; j < lst; j++) sum+=(!b[i][j] or b[i][j]==k),dp[i][j]=0;
			for(int j = lst; j <= m; j++){
				if(sum!=j){
					for(int k = j; k <= m; k++) dp[i][k]=0;
					break;
				}
				if(!i) dp[i][j]=(j!=m);
				else if(bst!=-1) dp[i][j]=(bst<=j);
				else dp[i][j]=0;
				if(dp[i][j] and bst2==-1) bst2=j;
				sum+=(!b[i][j] or b[i][j]==k);
			}
			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";
}

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	20816 KB	Output is correct
2	Correct	4 ms	20816 KB	Output is correct
3	Correct	13 ms	20816 KB	Output is correct
4	Correct	14 ms	20816 KB	Output is correct
5	Correct	10 ms	20816 KB	Output is correct
6	Correct	13 ms	20828 KB	Output is correct
7	Correct	13 ms	20816 KB	Output is correct
8	Correct	10 ms	20816 KB	Output is correct
9	Correct	11 ms	20816 KB	Output is correct
10	Correct	10 ms	21068 KB	Output is correct
11	Correct	11 ms	20816 KB	Output is correct
12	Correct	10 ms	20816 KB	Output is correct
13	Correct	13 ms	20816 KB	Output is correct
14	Correct	11 ms	21188 KB	Output is correct
15	Correct	4 ms	23120 KB	Output is correct
16	Correct	7 ms	25168 KB	Output is correct
17	Correct	26 ms	25336 KB	Output is correct
18	Correct	16 ms	25472 KB	Output is correct
19	Correct	24 ms	25168 KB	Output is correct
20	Correct	22 ms	23288 KB	Output is correct
21	Correct	41 ms	25424 KB	Output is correct
22	Correct	20 ms	25168 KB	Output is correct
23	Correct	32 ms	25384 KB	Output is correct
24	Correct	19 ms	23544 KB	Output is correct
25	Correct	35 ms	25348 KB	Output is correct
26	Correct	35 ms	25424 KB	Output is correct
27	Correct	37 ms	25424 KB	Output is correct
28	Correct	43 ms	25576 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	20816 KB	Output is correct
2	Correct	4 ms	20816 KB	Output is correct
3	Correct	13 ms	20816 KB	Output is correct
4	Correct	14 ms	20816 KB	Output is correct
5	Correct	10 ms	20816 KB	Output is correct
6	Correct	13 ms	20828 KB	Output is correct
7	Correct	13 ms	20816 KB	Output is correct
8	Correct	10 ms	20816 KB	Output is correct
9	Correct	11 ms	20816 KB	Output is correct
10	Correct	10 ms	21068 KB	Output is correct
11	Correct	11 ms	20816 KB	Output is correct
12	Correct	10 ms	20816 KB	Output is correct
13	Correct	13 ms	20816 KB	Output is correct
14	Correct	11 ms	21188 KB	Output is correct
15	Correct	4 ms	23120 KB	Output is correct
16	Correct	7 ms	25168 KB	Output is correct
17	Correct	26 ms	25336 KB	Output is correct
18	Correct	16 ms	25472 KB	Output is correct
19	Correct	24 ms	25168 KB	Output is correct
20	Correct	22 ms	23288 KB	Output is correct
21	Correct	41 ms	25424 KB	Output is correct
22	Correct	20 ms	25168 KB	Output is correct
23	Correct	32 ms	25384 KB	Output is correct
24	Correct	19 ms	23544 KB	Output is correct
25	Correct	35 ms	25348 KB	Output is correct
26	Correct	35 ms	25424 KB	Output is correct
27	Correct	37 ms	25424 KB	Output is correct
28	Correct	43 ms	25576 KB	Output is correct
29	Correct	1528 ms	66124 KB	Output is correct
30	Correct	1493 ms	75576 KB	Output is correct
31	Correct	1833 ms	73336 KB	Output is correct
32	Correct	1549 ms	73860 KB	Output is correct
33	Correct	595 ms	75980 KB	Output is correct
34	Correct	1590 ms	63620 KB	Output is correct
35	Correct	2316 ms	83592 KB	Output is correct
36	Correct	1313 ms	76580 KB	Output is correct
37	Correct	2763 ms	69612 KB	Output is correct

Submission #1114082

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 45.0 / 45.0

Subtask #3 40.0 / 40.0

Subtask #1
15.0 / 15.0

Subtask #2
45.0 / 45.0

Subtask #3
40.0 / 40.0