oj.uz

Submission #152641

# Submission time Handle Problem Language Result Execution time Memory
152641 2019-09-08T18:51:37 Z karma The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 16196 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define pb      emplace_back
#define mp      make_pair
#define fi      first
#define se      second
#define ll      long long

using namespace std;

const int N = int(2e3) + 3;
const int inf = int(1e9) + 3;

int n, m, a[N][N], low, mid, high, lim, mn, mx, res, Mx, Mn, h;
bool divided;

bool Check() {
     lim = mn + mid;
     if(a[0][0] > lim && a[0][m - 1] > lim) return 0;
     Mx = 0, Mn = inf, h = n;
     for(int j = 0; j < m; ++j) {
         divided = 0;
         if(a[0][j] > lim) h = 0, divided = 1;
         for(int i = 0; i < n; ++i) {
            if(a[i][j] <= lim && i < h && !divided) continue;
            if(!divided) divided = 1, h = min(h, i);
            Mx = max(Mx, a[i][j]), Mn = min(Mn, a[i][j]);
         }
     }
     if(Mx - Mn <= mid) return 1;
     h = n, Mx = 0, Mn = inf;
     for(int j = m - 1; j >= 0; --j) {
         divided = 0;
         if(a[0][j] > lim) h = 0, divided = 1;
         for(int i = 0; i < n; ++i) {
            if(a[i][j] <= lim && i < h && !divided) continue;
            if(!divided) divided = 1, h = min(h, i);
            Mx = max(Mx, a[i][j]), Mn = min(Mn, a[i][j]);
         }
     }
     return Mx - Mn <= mid;
}

void Solve() {
     low = 0, high = mx - mn;
     while(low <= high) {
         mid = (low + high) >> 1;
         if(Check()) high = mid - 1;
         else low = mid + 1;
     }
     res = min(res, low);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    if(fopen("test.inp", "r")) {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    cin >> n >> m; mn = inf, mx = 0;
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
           cin >> a[i][j];
           mn = min(mn, a[i][j]);
           mx = max(mx, a[i][j]);
        }
    }
    res = mx - mn;
    Solve();
    for(int j = 0; j < m; ++j) {
        for(int i = 0; n - 1 - i > i; ++i) {
            swap(a[i][j], a[n - 1 - i][j]);
        }
    }
    Solve();
    cout << res;
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("test.inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joioi.cpp:59:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("test.out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 8 ms 1272 KB Output is correct
17 Correct 14 ms 1272 KB Output is correct
18 Correct 14 ms 1272 KB Output is correct
19 Correct 17 ms 1272 KB Output is correct
20 Correct 17 ms 1144 KB Output is correct
21 Correct 19 ms 1272 KB Output is correct
22 Correct 20 ms 1276 KB Output is correct
23 Correct 21 ms 1272 KB Output is correct
24 Correct 16 ms 1144 KB Output is correct
25 Correct 27 ms 1272 KB Output is correct
26 Correct 20 ms 1368 KB Output is correct
27 Correct 19 ms 1272 KB Output is correct
28 Correct 20 ms 1272 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 8 ms 1272 KB Output is correct
17 Correct 14 ms 1272 KB Output is correct
18 Correct 14 ms 1272 KB Output is correct
19 Correct 17 ms 1272 KB Output is correct
20 Correct 17 ms 1144 KB Output is correct
21 Correct 19 ms 1272 KB Output is correct
22 Correct 20 ms 1276 KB Output is correct
23 Correct 21 ms 1272 KB Output is correct
24 Correct 16 ms 1144 KB Output is correct
25 Correct 27 ms 1272 KB Output is correct
26 Correct 20 ms 1368 KB Output is correct
27 Correct 19 ms 1272 KB Output is correct
28 Correct 20 ms 1272 KB Output is correct
29 Correct 2386 ms 15300 KB Output is correct
30 Correct 2530 ms 16096 KB Output is correct
31 Correct 2648 ms 16120 KB Output is correct
32 Correct 2653 ms 16196 KB Output is correct
33 Correct 1979 ms 14160 KB Output is correct
34 Correct 3029 ms 16076 KB Output is correct
35 Correct 3923 ms 16068 KB Output is correct
36 Correct 3838 ms 15980 KB Output is correct
37 Execution timed out 4067 ms 15992 KB Time limit exceeded