oj.uz

답안 #113655

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113655 2019-05-27T11:55:02 Z popovicirobert The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 1805 ms 31868 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

using namespace std;

const int INF = 1e9;
const int MAXN = 2000;

int mat[MAXN + 1][MAXN + 1], aux[MAXN + 1][MAXN + 1];
int n, m, mn, mx;

inline void rot() {

    int i, j;

    for(i = 1; i <= m; i++) {
        for(j = 1; j <= n; j++) {
            aux[i][j] = mat[n - j + 1][i];
        }
    }

    swap(n, m);
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= m; j++) {
            mat[i][j] = aux[i][j];
        }
    }
}


inline bool solve(int dif) {

    int l = INF, r = -INF;
    int last = 1;

    for(int j = 1; j <= m; j++) {
        int i = n;
        while(i >= max(1, last) && mat[i][j] <= mn + dif) {
            i--;
        }

        last = max(last, i + 1);

        while(i >= 1) {
            l = min(l, mat[i][j]);
            r = max(r, mat[i][j]);

            if(r - l > dif) {
                return 0;
            }

            i--;
        }
    }

    return r - l <= dif;

}


int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, j;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m;

    mx = -INF, mn = INF;

    for(i = 1; i <= n; i++) {
        for(j = 1; j <= m; j++) {
            cin >> mat[i][j];
            mn = min(mn, mat[i][j]);
            mx = max(mx, mat[i][j]);
        }
    }

    int ans = INF;

    for(i = 0; i < 4; i++) {

        int res = -1;
        for(int step = 1 << 29; step; step >>= 1) {
            if(res + step <= mx - mn && solve(res + step) == 0) {
                res += step;
            }
        }

        ans = min(ans, res + 1);

        if(i < 3) {
            rot();
        }

    }

    cout << ans;

    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 1920 KB Output is correct
16 Correct 6 ms 2252 KB Output is correct
17 Correct 8 ms 2304 KB Output is correct
18 Correct 9 ms 2304 KB Output is correct
19 Correct 9 ms 2304 KB Output is correct
20 Correct 8 ms 2304 KB Output is correct
21 Correct 11 ms 2352 KB Output is correct
22 Correct 12 ms 2304 KB Output is correct
23 Correct 11 ms 2304 KB Output is correct
24 Correct 10 ms 2304 KB Output is correct
25 Correct 11 ms 2304 KB Output is correct
26 Correct 10 ms 2304 KB Output is correct
27 Correct 10 ms 2304 KB Output is correct
28 Correct 11 ms 2304 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 1920 KB Output is correct
16 Correct 6 ms 2252 KB Output is correct
17 Correct 8 ms 2304 KB Output is correct
18 Correct 9 ms 2304 KB Output is correct
19 Correct 9 ms 2304 KB Output is correct
20 Correct 8 ms 2304 KB Output is correct
21 Correct 11 ms 2352 KB Output is correct
22 Correct 12 ms 2304 KB Output is correct
23 Correct 11 ms 2304 KB Output is correct
24 Correct 10 ms 2304 KB Output is correct
25 Correct 11 ms 2304 KB Output is correct
26 Correct 10 ms 2304 KB Output is correct
27 Correct 10 ms 2304 KB Output is correct
28 Correct 11 ms 2304 KB Output is correct
29 Correct 794 ms 31852 KB Output is correct
30 Correct 845 ms 31736 KB Output is correct
31 Correct 885 ms 31736 KB Output is correct
32 Correct 694 ms 31736 KB Output is correct
33 Correct 702 ms 31544 KB Output is correct
34 Correct 786 ms 31676 KB Output is correct
35 Correct 1805 ms 31868 KB Output is correct
36 Correct 1722 ms 31612 KB Output is correct
37 Correct 1794 ms 31748 KB Output is correct