oj.uz

Submission #152640

# Submission time Handle Problem Language Result Execution time Memory
152640 2019-09-08T18:45:45 Z karma The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 54824 KB 
#include<bits/stdc++.h>
#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) + 7;
const int inf = int(1e9) + 7;

int n, m, a[N][N], mn, mx, res;

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

void Solve() {
     int low, high, mid;
     low = 0, high = mx - mn;
     while(low <= high) {
         mid = (low + high) >> 1;
         if(Check(mid)) 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:60: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:61: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 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 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 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 8 ms 1400 KB Output is correct
17 Correct 14 ms 1528 KB Output is correct
18 Correct 14 ms 1656 KB Output is correct
19 Correct 17 ms 1628 KB Output is correct
20 Correct 16 ms 1400 KB Output is correct
21 Correct 18 ms 1656 KB Output is correct
22 Correct 18 ms 1656 KB Output is correct
23 Correct 20 ms 1728 KB Output is correct
24 Correct 15 ms 1528 KB Output is correct
25 Correct 25 ms 1656 KB Output is correct
26 Correct 18 ms 1784 KB Output is correct
27 Correct 18 ms 1784 KB Output is correct
28 Correct 18 ms 1656 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 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 8 ms 1400 KB Output is correct
17 Correct 14 ms 1528 KB Output is correct
18 Correct 14 ms 1656 KB Output is correct
19 Correct 17 ms 1628 KB Output is correct
20 Correct 16 ms 1400 KB Output is correct
21 Correct 18 ms 1656 KB Output is correct
22 Correct 18 ms 1656 KB Output is correct
23 Correct 20 ms 1728 KB Output is correct
24 Correct 15 ms 1528 KB Output is correct
25 Correct 25 ms 1656 KB Output is correct
26 Correct 18 ms 1784 KB Output is correct
27 Correct 18 ms 1784 KB Output is correct
28 Correct 18 ms 1656 KB Output is correct
29 Correct 2265 ms 37356 KB Output is correct
30 Correct 2358 ms 37520 KB Output is correct
31 Correct 2502 ms 39184 KB Output is correct
32 Correct 2679 ms 39160 KB Output is correct
33 Correct 1987 ms 34196 KB Output is correct
34 Correct 2774 ms 39268 KB Output is correct
35 Correct 3773 ms 54816 KB Output is correct
36 Correct 3634 ms 49656 KB Output is correct
37 Execution timed out 4022 ms 54824 KB Time limit exceeded