oj.uz

답안 #322436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
322436 2020-11-14T17:48:36 Z Seanliu The Kingdom of JOIOI (JOI17_joioi) C++17
60 / 100
 3616 ms 262148 KB 
#pragma gcc optimize ("Ofast")
#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], sz, ii, jj;
vector<int> lisan, cnt;
vector<vector<pii>> pos;
bool vis[maxN][maxN];

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

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

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();
	pos.resize(sz + 5);
	cnt.resize(sz + 5);
	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;
}

Compilation message

joioi.cpp:1: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
    1 | #pragma gcc optimize ("Ofast")
      |

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 9 ms 2288 KB Output is correct
17 Correct 23 ms 4208 KB Output is correct
18 Correct 21 ms 4208 KB Output is correct
19 Correct 23 ms 4208 KB Output is correct
20 Correct 20 ms 3824 KB Output is correct
21 Correct 26 ms 4336 KB Output is correct
22 Correct 24 ms 4228 KB Output is correct
23 Correct 24 ms 4336 KB Output is correct
24 Correct 21 ms 3892 KB Output is correct
25 Correct 23 ms 4336 KB Output is correct
26 Correct 24 ms 4336 KB Output is correct
27 Correct 24 ms 4336 KB Output is correct
28 Correct 23 ms 4336 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 9 ms 2288 KB Output is correct
17 Correct 23 ms 4208 KB Output is correct
18 Correct 21 ms 4208 KB Output is correct
19 Correct 23 ms 4208 KB Output is correct
20 Correct 20 ms 3824 KB Output is correct
21 Correct 26 ms 4336 KB Output is correct
22 Correct 24 ms 4228 KB Output is correct
23 Correct 24 ms 4336 KB Output is correct
24 Correct 21 ms 3892 KB Output is correct
25 Correct 23 ms 4336 KB Output is correct
26 Correct 24 ms 4336 KB Output is correct
27 Correct 24 ms 4336 KB Output is correct
28 Correct 23 ms 4336 KB Output is correct
29 Correct 2085 ms 90572 KB Output is correct
30 Correct 2041 ms 86428 KB Output is correct
31 Correct 2067 ms 87824 KB Output is correct
32 Correct 2402 ms 95736 KB Output is correct
33 Correct 1746 ms 82232 KB Output is correct
34 Correct 2152 ms 87560 KB Output is correct
35 Runtime error 3616 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
36 Halted 0 ms 0 KB -