oj.uz

Submission #376546

# Submission time Handle Problem Language Result Execution time Memory
376546 2021-03-11T16:43:25 Z smjleo The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 1415 ms 42092 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int long long
#define nl '\n'
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
const int mod = 1000000007, mod2 = 998244353;

// change this
const int N = 2005;

int n, m, arr[N][N], k, mini = INT_MAX, maxi = INT_MIN;

bool can() {
    int last = 0;

    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            if (arr[i][j] < maxi-k) last = max(last, j+1);
        }
        for (int j=0; j<m; j++) {
            if (arr[i][j] > mini+k && j < last) return false;
        }
    }
    return true;
}

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

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

int verify(int kk) {
    k = kk;

    bool res = false;

    for (bool _ : {0, 0}) {
        res |= can();
        flipx();
        res |= can();
        flipy();
    }
    
    return res;
}

signed main() {
    io;
    cin >> n >> m;
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            cin >> arr[i][j];
            mini = min(mini, arr[i][j]);
            maxi = max(maxi, arr[i][j]);
        }
    }

    int l = 0, r = 1e9+5;
    while (l<r) {
        int mid = (l+r)/2;
        if (verify(mid)) r = mid;
        else l = mid+1;
    }
    cout << l << nl;
}

Compilation message

joioi.cpp: In function 'long long int verify(long long int)':
joioi.cpp:45:15: warning: unused variable '_' [-Wunused-variable]
   45 |     for (bool _ : {0, 0}) {
      |               ^

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory 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 492 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

# Verdict Execution time Memory 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 492 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 364 KB Output is correct
16 Correct 14 ms 1516 KB Output is correct
17 Correct 15 ms 1772 KB Output is correct
18 Correct 12 ms 1772 KB Output is correct
19 Correct 16 ms 1772 KB Output is correct
20 Correct 11 ms 1516 KB Output is correct
21 Correct 11 ms 1900 KB Output is correct
22 Correct 11 ms 1900 KB Output is correct
23 Correct 13 ms 1900 KB Output is correct
24 Correct 10 ms 1644 KB Output is correct
25 Correct 15 ms 1900 KB Output is correct
26 Correct 10 ms 1900 KB Output is correct
27 Correct 12 ms 1900 KB Output is correct
28 Correct 11 ms 1900 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory 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 492 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 364 KB Output is correct
16 Correct 14 ms 1516 KB Output is correct
17 Correct 15 ms 1772 KB Output is correct
18 Correct 12 ms 1772 KB Output is correct
19 Correct 16 ms 1772 KB Output is correct
20 Correct 11 ms 1516 KB Output is correct
21 Correct 11 ms 1900 KB Output is correct
22 Correct 11 ms 1900 KB Output is correct
23 Correct 13 ms 1900 KB Output is correct
24 Correct 10 ms 1644 KB Output is correct
25 Correct 15 ms 1900 KB Output is correct
26 Correct 10 ms 1900 KB Output is correct
27 Correct 12 ms 1900 KB Output is correct
28 Correct 11 ms 1900 KB Output is correct
29 Correct 1224 ms 34232 KB Output is correct
30 Correct 1295 ms 35840 KB Output is correct
31 Correct 1415 ms 35824 KB Output is correct
32 Correct 1313 ms 35692 KB Output is correct
33 Correct 1215 ms 42092 KB Output is correct
34 Correct 1358 ms 35820 KB Output is correct
35 Correct 1039 ms 38764 KB Output is correct
36 Correct 1088 ms 36716 KB Output is correct
37 Correct 1250 ms 38636 KB Output is correct