oj.uz

Submission #685110

# Submission time Handle Problem Language Result Execution time Memory
685110 2023-01-23T13:10:35 Z coffee5427 The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 1654 ms 65908 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define ALL(x) x.begin(), x.end()

using namespace std;
using PQ = priority_queue<int, vector<int>, greater<int>>;
 
const int INF = 2e18;
const int maxn = 2e3 + 5;
const int M = 1e9 + 7;

int n, m, mx, mn;
int a[maxn][maxn];
int g[maxn][maxn];

void rotate () {
    // (3, 2) -> (2, 3)
    // (X, Y) -> (n - Y + 1, X)
    // (Y, X) -> (X, n - Y + 1)
    // (1, 4) -> (2, 3)
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            g[j][n - i + 1] = a[i][j];
        }
    }
    swap (n, m);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            a[i][j] = g[i][j];
        }
    }
}

int check (int x) {
    int lim = m + 1;

    for (int i = 1; i <= n; i++) {
        int r = 0;
        for (int j = 1; j <= min (lim, m); j++) {
            if (mx - x <= a[i][j]) r = max (r, j);
            else break;
        }
        lim = r;
        for (int j = r + 1; j <= m; j++) {
            if (a[i][j] - x > mn) return 0; 
        }
    }
    return 1;
} 

int search () {
    int l = 0, r = 2e9 + 5;

    while (l < r) {
        int mid = (l + r) >> 1;

        if (check (mid)) r = mid;
        else l = mid + 1;
    }

    return r;
}

void init () {
    cin >> n >> m;

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

void solve () {
    int ans = INF;
    
    ans = min (ans, search ());
    rotate ();
    ans = min (ans, search ());
    rotate ();
    ans = min (ans, search ());
    rotate ();
    ans = min (ans, search ());

    cout << ans << "\n";
} 
 
signed main() {
    // ios::sync_with_stdio(0);
    // cin.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        init();
        solve();
    }
}

/*
4 4
1 12 6 11
11 10 2 14
10 1 9 20
4 17 19 10

*/

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 1976 KB Output is correct
16 Correct 11 ms 2568 KB Output is correct
17 Correct 16 ms 2752 KB Output is correct
18 Correct 16 ms 2796 KB Output is correct
19 Correct 17 ms 2772 KB Output is correct
20 Correct 15 ms 2688 KB Output is correct
21 Correct 18 ms 2880 KB Output is correct
22 Correct 18 ms 2892 KB Output is correct
23 Correct 18 ms 2880 KB Output is correct
24 Correct 16 ms 2816 KB Output is correct
25 Correct 18 ms 2820 KB Output is correct
26 Correct 18 ms 2900 KB Output is correct
27 Correct 18 ms 2892 KB Output is correct
28 Correct 18 ms 2920 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 1976 KB Output is correct
16 Correct 11 ms 2568 KB Output is correct
17 Correct 16 ms 2752 KB Output is correct
18 Correct 16 ms 2796 KB Output is correct
19 Correct 17 ms 2772 KB Output is correct
20 Correct 15 ms 2688 KB Output is correct
21 Correct 18 ms 2880 KB Output is correct
22 Correct 18 ms 2892 KB Output is correct
23 Correct 18 ms 2880 KB Output is correct
24 Correct 16 ms 2816 KB Output is correct
25 Correct 18 ms 2820 KB Output is correct
26 Correct 18 ms 2900 KB Output is correct
27 Correct 18 ms 2892 KB Output is correct
28 Correct 18 ms 2920 KB Output is correct
29 Correct 1506 ms 63568 KB Output is correct
30 Correct 1325 ms 63600 KB Output is correct
31 Correct 1389 ms 63480 KB Output is correct
32 Correct 1382 ms 63512 KB Output is correct
33 Correct 1242 ms 63116 KB Output is correct
34 Correct 1428 ms 63600 KB Output is correct
35 Correct 1642 ms 64068 KB Output is correct
36 Correct 1442 ms 64332 KB Output is correct
37 Correct 1654 ms 65908 KB Output is correct