oj.uz

답안 #1114043

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114043 2024-11-18T06:52:04 Z Dan4Life The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 4000 ms 75848 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;
bitset<N> dp[N];
int n, m, lst[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}){
		for(int i = 0; i < n; i++) dp[i].reset();
		memset(lst,0,sizeof(lst));
		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);
				if(b[i][j]==k) lst[i]=j+1;
			}
		}
		int bst=-1,bst2;
		for(int i = 0; i < n; i++){
			bst2=-1;
			for(int j = lst[i]; 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";
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 18768 KB Output is correct
2 Correct 5 ms 18768 KB Output is correct
3 Correct 14 ms 18768 KB Output is correct
4 Correct 14 ms 18768 KB Output is correct
5 Correct 14 ms 19024 KB Output is correct
6 Correct 14 ms 19024 KB Output is correct
7 Correct 12 ms 19024 KB Output is correct
8 Correct 16 ms 19196 KB Output is correct
9 Correct 13 ms 19024 KB Output is correct
10 Correct 16 ms 19020 KB Output is correct
11 Correct 13 ms 19024 KB Output is correct
12 Correct 13 ms 18768 KB Output is correct
13 Correct 13 ms 19024 KB Output is correct
14 Correct 13 ms 19028 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 18768 KB Output is correct
2 Correct 5 ms 18768 KB Output is correct
3 Correct 14 ms 18768 KB Output is correct
4 Correct 14 ms 18768 KB Output is correct
5 Correct 14 ms 19024 KB Output is correct
6 Correct 14 ms 19024 KB Output is correct
7 Correct 12 ms 19024 KB Output is correct
8 Correct 16 ms 19196 KB Output is correct
9 Correct 13 ms 19024 KB Output is correct
10 Correct 16 ms 19020 KB Output is correct
11 Correct 13 ms 19024 KB Output is correct
12 Correct 13 ms 18768 KB Output is correct
13 Correct 13 ms 19024 KB Output is correct
14 Correct 13 ms 19028 KB Output is correct
15 Correct 5 ms 20572 KB Output is correct
16 Correct 12 ms 22948 KB Output is correct
17 Correct 33 ms 23156 KB Output is correct
18 Correct 21 ms 22864 KB Output is correct
19 Correct 39 ms 22864 KB Output is correct
20 Correct 43 ms 20816 KB Output is correct
21 Correct 53 ms 22864 KB Output is correct
22 Correct 30 ms 22748 KB Output is correct
23 Correct 60 ms 22864 KB Output is correct
24 Correct 25 ms 20896 KB Output is correct
25 Correct 81 ms 22948 KB Output is correct
26 Correct 57 ms 22864 KB Output is correct
27 Correct 50 ms 22864 KB Output is correct
28 Correct 51 ms 22864 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 18768 KB Output is correct
2 Correct 5 ms 18768 KB Output is correct
3 Correct 14 ms 18768 KB Output is correct
4 Correct 14 ms 18768 KB Output is correct
5 Correct 14 ms 19024 KB Output is correct
6 Correct 14 ms 19024 KB Output is correct
7 Correct 12 ms 19024 KB Output is correct
8 Correct 16 ms 19196 KB Output is correct
9 Correct 13 ms 19024 KB Output is correct
10 Correct 16 ms 19020 KB Output is correct
11 Correct 13 ms 19024 KB Output is correct
12 Correct 13 ms 18768 KB Output is correct
13 Correct 13 ms 19024 KB Output is correct
14 Correct 13 ms 19028 KB Output is correct
15 Correct 5 ms 20572 KB Output is correct
16 Correct 12 ms 22948 KB Output is correct
17 Correct 33 ms 23156 KB Output is correct
18 Correct 21 ms 22864 KB Output is correct
19 Correct 39 ms 22864 KB Output is correct
20 Correct 43 ms 20816 KB Output is correct
21 Correct 53 ms 22864 KB Output is correct
22 Correct 30 ms 22748 KB Output is correct
23 Correct 60 ms 22864 KB Output is correct
24 Correct 25 ms 20896 KB Output is correct
25 Correct 81 ms 22948 KB Output is correct
26 Correct 57 ms 22864 KB Output is correct
27 Correct 50 ms 22864 KB Output is correct
28 Correct 51 ms 22864 KB Output is correct
29 Correct 1813 ms 63964 KB Output is correct
30 Correct 2145 ms 75076 KB Output is correct
31 Correct 3124 ms 64068 KB Output is correct
32 Correct 1574 ms 75848 KB Output is correct
33 Correct 536 ms 74080 KB Output is correct
34 Correct 2439 ms 64072 KB Output is correct
35 Correct 2538 ms 64072 KB Output is correct
36 Correct 1207 ms 63984 KB Output is correct
37 Execution timed out 4064 ms 63816 KB Time limit exceeded
38 Halted 0 ms 0 KB -