oj.uz

답안 #332875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332875 2020-12-03T22:47:43 Z limabeans The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 3793 ms 102764 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;

const ll inf = 1e18;
const int maxn = 2020;


int n,m;
ll g[maxn][maxn];
ll tmp[maxn][maxn];

ll mn = inf;
ll mx = -inf;

bool test(ll diff) {
    {
	int sep = 0;
	bool ok = true;
	for (int i=0; i<n; i++) {
	    for (int j=0; j<m; j++) {
		if (g[i][j]<mx-diff) {
		    sep = max(sep,j+1);
		}
	    }
	    for (int j=0; j<m; j++) {
		if (g[i][j]>mn+diff) {
		    if (j<sep) ok = false;
		}
	    }
	}
	if (ok) return true;
    }

    {
	int sep = 0;
	bool ok = true;
	for (int i=0; i<n; i++) {
	    for (int j=0; j<m; j++) {
		if (g[i][j]>mn+diff) {
		    sep = max(sep,j+1);
		}
	    }
	    for (int j=0; j<m; j++) {
		if (g[i][j]<mx-diff) {
		    if (j<sep) ok = false;
		}
	    }
	}
	if (ok) return true;
    }

    return false;
}

ll solve() {

    ll diff = mx-mn;
    ll hi = diff;
    ll lo = -1;
    while (hi-lo>1) {
	ll mid = (lo+hi)/2;
	if (test(mid)) {
	    hi = mid;
	} else {
	    lo = mid;
	}
    }
    

    return hi;
}


void flipY() {
    for (int i=0; i<n; i++) {
	for (int j=0; j<m/2; j++) {
	    swap(g[i][j],g[i][m-j-1]);
	}
    }
}

void transpose() {
    for (int i=0; i<n; i++) {
	for (int j=0; j<m; j++) {
	    tmp[j][i]=g[i][j];
	}
    }
    swap(n,m);
    for (int i=0; i<n; i++) {
	for (int j=0; j<m; j++) {
	    g[i][j]=tmp[i][j];
	}
    }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);


    cin>>n>>m;
    for (int i=0; i<n; i++) {
	for (int j=0; j<m; j++) {
	    cin>>g[i][j];
	}
    }

    for (int i=0; i<n; i++) {
	for (int j=0; j<m; j++) {
	    mn = min(mn, g[i][j]);
	    mx = max(mx, g[i][j]);
	}
    }

    ll res = inf;
    res = min(res, solve());
    flipY();
    res = min(res, solve());
    flipY(); transpose();
    res = min(res, solve());
    flipY();
    res = min(res, solve());

    cout<<res<<endl;
    
    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 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 1 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 2 ms 2028 KB Output is correct
16 Correct 14 ms 2540 KB Output is correct
17 Correct 27 ms 2792 KB Output is correct
18 Correct 24 ms 2924 KB Output is correct
19 Correct 27 ms 2796 KB Output is correct
20 Correct 27 ms 2796 KB Output is correct
21 Correct 34 ms 2924 KB Output is correct
22 Correct 30 ms 2924 KB Output is correct
23 Correct 39 ms 2924 KB Output is correct
24 Correct 28 ms 2924 KB Output is correct
25 Correct 48 ms 2924 KB Output is correct
26 Correct 34 ms 2924 KB Output is correct
27 Correct 35 ms 3052 KB Output is correct
28 Correct 33 ms 2924 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 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 2 ms 2028 KB Output is correct
16 Correct 14 ms 2540 KB Output is correct
17 Correct 27 ms 2792 KB Output is correct
18 Correct 24 ms 2924 KB Output is correct
19 Correct 27 ms 2796 KB Output is correct
20 Correct 27 ms 2796 KB Output is correct
21 Correct 34 ms 2924 KB Output is correct
22 Correct 30 ms 2924 KB Output is correct
23 Correct 39 ms 2924 KB Output is correct
24 Correct 28 ms 2924 KB Output is correct
25 Correct 48 ms 2924 KB Output is correct
26 Correct 34 ms 2924 KB Output is correct
27 Correct 35 ms 3052 KB Output is correct
28 Correct 33 ms 2924 KB Output is correct
29 Correct 2340 ms 63724 KB Output is correct
30 Correct 2270 ms 61676 KB Output is correct
31 Correct 2982 ms 63852 KB Output is correct
32 Correct 2160 ms 63724 KB Output is correct
33 Correct 1746 ms 63368 KB Output is correct
34 Correct 2579 ms 63724 KB Output is correct
35 Correct 3303 ms 63724 KB Output is correct
36 Correct 2492 ms 93400 KB Output is correct
37 Correct 3793 ms 102764 KB Output is correct