oj.uz

답안 #912559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912559 2024-01-19T15:36:53 Z penguin133 The Kingdom of JOIOI (JOI17_joioi) C++17
15 / 100
 11 ms 34396 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m, A[2005][2005], P[2005][2005], S[2005][2005], P2[2005][2005], S2[2005][2005], P3[2005][2005], S3[2005][2005], P4[2005][2005], S4[2005][2005];

void solve(){
	cin >> n >> m;
	int mn = 1e18, mx = 0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)cin >> A[i][j], mn = min(mn, A[i][j]), mx = max(mx, A[i][j]);
	}
	for(int i=1;i<=m;i++){
		P2[0][i] = S2[n + 1][i] = 1e18;
		for(int j=1;j<=n;j++){
			P[j][i] = max(P[j-1][i], A[j][i]);
			P2[j][i] = min(P2[j-1][i], A[j][i]);
		}
		for(int j=n;j>=1;j--){
			S[j][i] = max(S[j+1][i], A[j][i]);
			S2[j][i] = min(S2[j+1][i], A[j][i]);
		}
	}
	for(int i=1;i<=n;i++){
		P4[i][0] = S4[i][m+1] = 1e18;
		for(int j=1;j<=m;j++){
			P3[i][j] = max(P3[i][j-1], A[i][j]);
			P4[i][j] = min(P4[i][j-1], A[i][j]);
		}
		for(int j=m;j>=1;j--){
			S3[i][j] = max(S3[i][j+1], A[i][j]);
			S4[i][j] = min(S4[i][j+1], A[i][j]);
		}
	}
	int lo = 0, hi = (int)1e9, ans = hi;
	while(lo <= hi){
		int mid = (lo + hi) >> 1;
		int ptr = n;
		for(int i=1;i<=m;i++){
			while(ptr >= 1 && (P[ptr][i] > mn + mid || S2[ptr + 1][i] < mx - mid))ptr--;
		}
		bool f = (ptr >= 1);
		ptr = n;
		for(int i=m;i>=1;i--){
			while(ptr >= 1 && (P[ptr][i] > mn + mid || S2[ptr + 1][i] < mx - mid))ptr--;
		}
		f |= (ptr >= 1);
		ptr = n;
		for(int i=1;i<=m;i++){
			while(ptr >= 1 && (P2[ptr][i] < mx - mid || S[ptr + 1][i] > mn + mid))ptr--;
		}
		f |= (ptr >= 1);
		ptr = n;
		for(int i=m;i>=1;i--){
			while(ptr >= 1 && (P2[ptr][i] < mx - mid || S[ptr + 1][i] > mn + mid))ptr--;
		}
		f |= (ptr >= 1);
		ptr = m;
		for(int i=1;i<=n;i++){
			while(ptr >= 1 && (P3[i][ptr] > mn + mid || S4[i][ptr + 1] < mx - mid))ptr--;
		}
		f |= (ptr >= 1);
		ptr = m;
		for(int i=n;i>=1;i--){
			while(ptr >= 1 && (P3[i][ptr] > mn + mid || S4[i][ptr + 1] < mx - mid))ptr--;
		}
		f |= (ptr >= 1);
		ptr = m;
		for(int i=1;i<=n;i++){
			while(ptr >= 1 && (P4[i][ptr] < mx - mid || S3[i][ptr + 1] > mn + mid))ptr--;
		}
		f |= (ptr >= 1);
		ptr = m;
		for(int i=n;i>=1;i--){
			while(ptr >= 1 && (P4[i][ptr] < mx - mid || S3[i][ptr + 1] > mn + mid))ptr--;
		}
		f |= (ptr >= 1);
		
		ptr = 1;
		for(int i=1;i<=m;i++){
			while(ptr <= n && (P[ptr][i] > mn + mid || S2[ptr + 1][i] < mx - mid))ptr++;
		}
		f |= (ptr <= n);
		ptr = 1;
		for(int i=m;i>=1;i--){
			while(ptr <= n && (P[ptr][i] > mn + mid || S2[ptr + 1][i] < mx - mid))ptr++;
		}
		f |= (ptr <= n);
		ptr = 1;
		for(int i=1;i<=m;i++){
			while(ptr <= n && (P2[ptr][i] < mx - mid || S[ptr + 1][i] > mn + mid))ptr++;
		}
		f |= (ptr <= n);
		ptr = 1;
		for(int i=m;i>=1;i--){
			while(ptr <= n && (P2[ptr][i] < mx - mid || S[ptr + 1][i] > mn + mid))ptr++;
		}
		f |= (ptr <= n);
		ptr = 1;
		for(int i=1;i<=n;i++){
			while(ptr <= m && (P3[i][ptr] > mn + mid || S4[i][ptr + 1] < mx - mid))ptr++;
		}
		f |= (ptr <= m);
		ptr = 1;
		for(int i=n;i>=1;i--){
			while(ptr <= m && (P3[i][ptr] > mn + mid || S4[i][ptr + 1] < mx - mid))ptr++;
		}
		f |= (ptr <= m);
		ptr = 1;
		for(int i=1;i<=n;i++){
			while(ptr <= m && (P4[i][ptr] < mx - mid || S3[i][ptr + 1] > mn + mid))ptr++;
		}
		f |= (ptr <= m);
		ptr = 1;
		for(int i=n;i>=1;i--){
			while(ptr <= m && (P4[i][ptr] < mx - mid || S3[i][ptr + 1] > mn + mid))ptr++;
		}
		f |= (ptr <= m);
		if(f)ans = mid, hi = mid - 1;
		else lo = mid + 1;
	}
	cout << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

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

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8660 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 10840 KB Output is correct
6 Correct 3 ms 10840 KB Output is correct
7 Correct 3 ms 10852 KB Output is correct
8 Correct 2 ms 10840 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Correct 3 ms 10844 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10708 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8660 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 10840 KB Output is correct
6 Correct 3 ms 10840 KB Output is correct
7 Correct 3 ms 10852 KB Output is correct
8 Correct 2 ms 10840 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Correct 3 ms 10844 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10708 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 3 ms 12888 KB Output is correct
16 Correct 9 ms 34140 KB Output is correct
17 Correct 10 ms 34396 KB Output is correct
18 Correct 11 ms 34272 KB Output is correct
19 Correct 10 ms 34392 KB Output is correct
20 Correct 9 ms 30188 KB Output is correct
21 Correct 11 ms 34392 KB Output is correct
22 Incorrect 11 ms 34396 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8660 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 10840 KB Output is correct
6 Correct 3 ms 10840 KB Output is correct
7 Correct 3 ms 10852 KB Output is correct
8 Correct 2 ms 10840 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Correct 3 ms 10844 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10708 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 3 ms 12888 KB Output is correct
16 Correct 9 ms 34140 KB Output is correct
17 Correct 10 ms 34396 KB Output is correct
18 Correct 11 ms 34272 KB Output is correct
19 Correct 10 ms 34392 KB Output is correct
20 Correct 9 ms 30188 KB Output is correct
21 Correct 11 ms 34392 KB Output is correct
22 Incorrect 11 ms 34396 KB Output isn't correct
23 Halted 0 ms 0 KB -