oj.uz

답안 #322431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
322431 2020-11-14T17:41:02 Z Seanliu The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 2791 ms 262148 KB 
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#define ericxiao ios_base::sync_with_stdio(0);cin.tie(0);
#define pii pair<int,int>
#define F first
#define S second
using namespace std;

const int maxN = 2e3 + 326, INF = 2e9 + 326;

int N, M, arr[maxN][maxN], cnt[maxN * maxN], sz;
vector<int> lisan;
vector<pii> pos[maxN * maxN];
bool vis[maxN][maxN];

void take(int y, int x, int &mx, int &mn, int d){
	if(d == 0){
		for(int i = y; i >= 0 && !vis[i][x]; i--){
			for(int j = x; j >= 0 && !vis[i][j]; j--){
				vis[i][j] = true;
				cnt[arr[i][j]]--;
				mx = max(mx, arr[i][j]);
				mn = min(mn, arr[i][j]);
			}
		}
	} else if(d == 1){
		for(int i = y; i < N && !vis[i][x]; i++){
			for(int j = x; j >= 0 && !vis[i][j]; j--){
				vis[i][j] = true;
				cnt[arr[i][j]]--;
				mx = max(mx, arr[i][j]);
				mn = min(mn, arr[i][j]);
			}
		}
	} else if(d == 2){
		for(int i = y; i < N && !vis[i][x]; i++){
			for(int j = x; j < M && !vis[i][j]; j++){
				vis[i][j] = true;
				cnt[arr[i][j]]--;
				mx = max(mx, arr[i][j]);
				mn = min(mn, arr[i][j]);
			}
		}
	} else if(d == 3){
		for(int i = y; i >= 0 && !vis[i][x]; i--){
			for(int j = x; j < M && !vis[i][j]; j++){
				vis[i][j] = true;
				cnt[arr[i][j]]--;
				mx = max(mx, arr[i][j]);
				mn = min(mn, arr[i][j]);
			}
		}

	}
}

inline void rot(){
	for(int i = 0; i < sz; i++){
		cnt[i] = 0;
	}
	for(int i = 0; i < N; i++) for(int j = 0; j < M; j++) {
		vis[i][j] = false;
		cnt[arr[i][j]]++;
	}
}

int main(){
	ericxiao;
	cin >> N >> M;
	for(int i = 0; i < N; i++){
		for(int j = 0; j < M; j++){
			cin >> arr[i][j];
			lisan.push_back(arr[i][j]);
		}
	}
	sort(lisan.begin(), lisan.end());
	sz = unique(lisan.begin(), lisan.end()) - lisan.begin();
	for(int i = 0; i < N; i++) for(int j = 0; j < M; j++){
		arr[i][j] = lower_bound(lisan.begin(), lisan.begin() + sz, arr[i][j]) - lisan.begin();
		cnt[arr[i][j]]++;
		pos[arr[i][j]].emplace_back(i, j);
	}
	int ans = lisan[sz - 1] - lisan[0];
	for(int jizz = 0; jizz < 4; jizz++){
		//cout << "in jizz = " << jizz << endl;
		int mx = -INF, mn = INF, f = 0, e = sz - 1;
		for(int i = 0; i < sz; i++){
			//take all of them
			//
			//cout << "i = " << i << ", = " << lisan[i] << endl;
			for(auto [y, x] : pos[i]){
				take(y, x, mx, mn, jizz);
			}
			/*
			for(int y = 0; y < N; y++) for(int x = 0; x < M; x++){
				cout << vis[y][x] << " \n"[x == M - 1];
			}
			*/
			while(f < sz - 1 && !cnt[f]) f++;
			while(e && !cnt[e]) e--;
			if(f == sz || !e) break;
			ans = min(ans, max(lisan[e] - lisan[f], lisan[mx] - lisan[mn]));
			//cout << "ans = " << ans << endl;
		}
		rot();
	}
	cout << ans << endl;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 127596 KB Output is correct
2 Correct 75 ms 127468 KB Output is correct
3 Correct 76 ms 127468 KB Output is correct
4 Correct 75 ms 127468 KB Output is correct
5 Correct 75 ms 127468 KB Output is correct
6 Correct 77 ms 127468 KB Output is correct
7 Correct 78 ms 127468 KB Output is correct
8 Correct 75 ms 127488 KB Output is correct
9 Correct 75 ms 127468 KB Output is correct
10 Correct 75 ms 127468 KB Output is correct
11 Correct 76 ms 127468 KB Output is correct
12 Correct 76 ms 127468 KB Output is correct
13 Correct 76 ms 127480 KB Output is correct
14 Correct 76 ms 127596 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 127596 KB Output is correct
2 Correct 75 ms 127468 KB Output is correct
3 Correct 76 ms 127468 KB Output is correct
4 Correct 75 ms 127468 KB Output is correct
5 Correct 75 ms 127468 KB Output is correct
6 Correct 77 ms 127468 KB Output is correct
7 Correct 78 ms 127468 KB Output is correct
8 Correct 75 ms 127488 KB Output is correct
9 Correct 75 ms 127468 KB Output is correct
10 Correct 75 ms 127468 KB Output is correct
11 Correct 76 ms 127468 KB Output is correct
12 Correct 76 ms 127468 KB Output is correct
13 Correct 76 ms 127480 KB Output is correct
14 Correct 76 ms 127596 KB Output is correct
15 Correct 81 ms 127596 KB Output is correct
16 Correct 84 ms 129392 KB Output is correct
17 Correct 98 ms 130416 KB Output is correct
18 Correct 97 ms 130288 KB Output is correct
19 Correct 94 ms 130416 KB Output is correct
20 Correct 91 ms 130052 KB Output is correct
21 Correct 99 ms 130416 KB Output is correct
22 Correct 97 ms 130416 KB Output is correct
23 Correct 98 ms 130416 KB Output is correct
24 Correct 95 ms 130032 KB Output is correct
25 Correct 97 ms 130416 KB Output is correct
26 Correct 99 ms 130380 KB Output is correct
27 Correct 97 ms 130416 KB Output is correct
28 Correct 98 ms 130416 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 127596 KB Output is correct
2 Correct 75 ms 127468 KB Output is correct
3 Correct 76 ms 127468 KB Output is correct
4 Correct 75 ms 127468 KB Output is correct
5 Correct 75 ms 127468 KB Output is correct
6 Correct 77 ms 127468 KB Output is correct
7 Correct 78 ms 127468 KB Output is correct
8 Correct 75 ms 127488 KB Output is correct
9 Correct 75 ms 127468 KB Output is correct
10 Correct 75 ms 127468 KB Output is correct
11 Correct 76 ms 127468 KB Output is correct
12 Correct 76 ms 127468 KB Output is correct
13 Correct 76 ms 127480 KB Output is correct
14 Correct 76 ms 127596 KB Output is correct
15 Correct 81 ms 127596 KB Output is correct
16 Correct 84 ms 129392 KB Output is correct
17 Correct 98 ms 130416 KB Output is correct
18 Correct 97 ms 130288 KB Output is correct
19 Correct 94 ms 130416 KB Output is correct
20 Correct 91 ms 130052 KB Output is correct
21 Correct 99 ms 130416 KB Output is correct
22 Correct 97 ms 130416 KB Output is correct
23 Correct 98 ms 130416 KB Output is correct
24 Correct 95 ms 130032 KB Output is correct
25 Correct 97 ms 130416 KB Output is correct
26 Correct 99 ms 130380 KB Output is correct
27 Correct 97 ms 130416 KB Output is correct
28 Correct 98 ms 130416 KB Output is correct
29 Correct 1959 ms 215332 KB Output is correct
30 Correct 1961 ms 211416 KB Output is correct
31 Correct 1932 ms 212360 KB Output is correct
32 Correct 2168 ms 220424 KB Output is correct
33 Correct 1698 ms 207292 KB Output is correct
34 Correct 2047 ms 212284 KB Output is correct
35 Runtime error 2791 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
36 Halted 0 ms 0 KB -