oj.uz

Submission #1012742

# Submission time Handle Problem Language Result Execution time Memory
1012742 2024-07-02T14:33:58 Z NintsiChkhaidze The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 4000 ms 229900 KB 
#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define ll long long
using namespace std;

const int N = 2e3 + 3;
int a[N][N],n,m,mn,mx,cnt[3][N];
bool vis[N][N],cur[3][N][N];

void clear(){
	for (int i=1;i<=n;i++)
		for(int j = 1; j <= m;j++)
			vis[i][j]=0;
}
void go(int x,int y,int d){
	if (x < 1 || y < 1 || x > n || y > m || vis[x][y]) return;
	if (a[x][y] - mn > d) return;
	vis[x][y] = 1;
	go(x+1,y,d);
	go(x-1,y,d);
	go(x,y+1,d);
	go(x,y-1,d);
}

int get(bool k){
	int mn1=-1,mx1=-1,mn2=-1,mx2=-1;
	for (int i= 1; i <= n; i++){
		for (int j= 1;j<=m;j++){
			if(cur[k][i][j]){
				if (mn1 == -1) {
					mn1 = mx1 = a[i][j];
				}else{
					mn1 = min(mn1,a[i][j]);
					mx1 = max(mx1,a[i][j]);
				}
			}else{	
				if (mn2 == -1) {
					mn2 = mx2 = a[i][j];
				}else{
					mn2 = min(mn2,a[i][j]);
					mx2 = max(mx2,a[i][j]);
				}
			}
		}
	}

	return max(mx2-mn2,mx1-mn1);
}

bool go1(int d){
	int mn0 = 2e9,mn1 = 2e9;
	for (int i = 1; i <= n; i++){
		mn0 = min(mn0,cnt[0][i]);
		int l0 = m - mn0 + 1,r0 = m;
		mn1 = min(mn1,cnt[1][i]);
		int l1 = 1,r1 = mn1;
		
		for (int j = 1; j <= m; j++){
			cur[1][i][j] = (j >= l1 && j <= r1);
			cur[0][i][j] = (j >= l0 && j <= r0);
		}
	}
	
	return (get(0) <= d) || (get(1) <= d);
}

bool go2(int d){
	int mn0 = 2e9,mn1 = 2e9;
	for (int i = n; i >= 1; i--){
		mn0 = min(mn0,cnt[0][i]);
		int l0 = m - mn0 + 1,r0 = m;

		mn1 = min(mn1,cnt[1][i]);
		int l1 = 1,r1 = mn1;
		for (int j = 1; j <= m; j++){
			cur[1][i][j] = (j >= l1 && j <= r1);
			cur[0][i][j] = (j >= l0 && j <= r0);
		}
	}
	
	return (get(0) <= d) || (get(1) <= d);
}

signed main() {
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);

	cin>>n>>m;

	mn = 2e9;
	int X = 0,Y=0;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			cin >> a[i][j];
			if (a[i][j] < mn){
				X=i,Y=j;
				mn=a[i][j];
			}
			mx=max(mx,a[i][j]);
		}
	}

	int l = 0,r = mx - mn,ans=mx-mn;
	while (l <= r){
		clear();
		int mid=(l+r)/2;
		go(X,Y,mid);

		for (int i = 1; i <= n; i++){
			cnt[0][i] = m;
			for (int j = m; j >= 1; j--){
				if (!vis[i][j]){
					cnt[0][i] = m - j;
					break;
				}
			}

			cnt[1][i] = m;
			for (int j = 1; j <= m; j++){
				if (!vis[i][j]){
					cnt[1][i] = j - 1;
					break;
				}
			}
		}

		if (go1(mid) || go2(mid)){
			ans = mid;
			r = mid-1;
		}else{
			l = mid + 1;
		}
	}
	
	cout<<ans<<endl;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 7 ms 5468 KB Output is correct
17 Correct 24 ms 4472 KB Output is correct
18 Correct 17 ms 3964 KB Output is correct
19 Correct 15 ms 3932 KB Output is correct
20 Correct 19 ms 3932 KB Output is correct
21 Correct 32 ms 5200 KB Output is correct
22 Correct 21 ms 3416 KB Output is correct
23 Correct 20 ms 3928 KB Output is correct
24 Correct 20 ms 3676 KB Output is correct
25 Correct 21 ms 3160 KB Output is correct
26 Correct 34 ms 4444 KB Output is correct
27 Correct 35 ms 4956 KB Output is correct
28 Correct 36 ms 5424 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 7 ms 5468 KB Output is correct
17 Correct 24 ms 4472 KB Output is correct
18 Correct 17 ms 3964 KB Output is correct
19 Correct 15 ms 3932 KB Output is correct
20 Correct 19 ms 3932 KB Output is correct
21 Correct 32 ms 5200 KB Output is correct
22 Correct 21 ms 3416 KB Output is correct
23 Correct 20 ms 3928 KB Output is correct
24 Correct 20 ms 3676 KB Output is correct
25 Correct 21 ms 3160 KB Output is correct
26 Correct 34 ms 4444 KB Output is correct
27 Correct 35 ms 4956 KB Output is correct
28 Correct 36 ms 5424 KB Output is correct
29 Correct 2179 ms 184656 KB Output is correct
30 Correct 1998 ms 186368 KB Output is correct
31 Correct 1792 ms 144244 KB Output is correct
32 Correct 2763 ms 229900 KB Output is correct
33 Correct 1422 ms 107712 KB Output is correct
34 Correct 2503 ms 206484 KB Output is correct
35 Execution timed out 4057 ms 225372 KB Time limit exceeded
36 Halted 0 ms 0 KB -