oj.uz

Submission #1014056

# Submission time Handle Problem Language Result Execution time Memory
1014056 2024-07-04T10:14:53 Z snpmrnhlol The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 1429 ms 67324 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 2e3;
const int inf = 1e9;
int n,m,mx = -1;
int v[N][N];
int v2[N][N];
int pref[N][N];
int ans = inf;
bool chk(int x){
    int l = mx - x,r = mx;
    int mx1,mn1,mx2,mn2;
    bool ok = 0;
    int pt = m - 1;
    mx1 = mx2 = -inf;
    mn1 = mn2 = inf;
    for(int i = 0;i < n;i++){
        while(pt >= 0 && pref[i][pt] < l){
            pt--;
        }
        for(int j = 0;j < m;j++){
            if(j <= pt){
                mx1 = max(mx1,v[i][j]);
                mn1 = min(mn1,v[i][j]);
            }else{
                mx2 = max(mx2,v[i][j]);
                mn2 = min(mn2,v[i][j]);
            }
        }
    }
    if(mx1 - mn1 <= x && mx2 - mn2 <= x){
        ok = 1;
    }
    return ok;
}
int main(){
    cin>>n>>m;
    for(int i = 0;i < n;i++){
        for(int j = 0;j < m;j++){
            cin>>v[i][j];
            mx = max(mx,v[i][j]);
        }
    }
    ans = mx;
    for(int k = 0;k < 4;k++){
        for(int i = 0;i < n;i++){
            for(int j = 0;j < m;j++){
                pref[i][j] = min((j == 0?inf:pref[i][j - 1]),v[i][j]);
            }
        }
        int l = 0,r = ans;
        while(l != r){
            int mij = (l + r)/2;
            if(chk(mij)){
                r = mij;
            }else l = mij + 1;
        }
        ans = min(ans,l);
        for(int i = 0;i < n;i++){
            for(int j = 0;j < m;j++){
                v2[j][n - i - 1] = v[i][j];
            }
        }
        swap(n,m);
        for(int i = 0;i < n;i++){
            for(int j = 0;j < m;j++){
                v[i][j] = v2[i][j];
            }
        }
    }
    cout<<ans<<'\n';
    return 0;
}

Compilation message

joioi.cpp: In function 'bool chk(int)':
joioi.cpp:11:20: warning: unused variable 'r' [-Wunused-variable]
   11 |     int l = mx - x,r = mx;
      |                    ^

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 7 ms 3248 KB Output is correct
17 Correct 11 ms 3420 KB Output is correct
18 Correct 11 ms 3540 KB Output is correct
19 Correct 13 ms 3460 KB Output is correct
20 Correct 10 ms 3420 KB Output is correct
21 Correct 15 ms 3592 KB Output is correct
22 Correct 14 ms 3676 KB Output is correct
23 Correct 15 ms 3536 KB Output is correct
24 Correct 13 ms 3420 KB Output is correct
25 Correct 19 ms 3556 KB Output is correct
26 Correct 15 ms 3612 KB Output is correct
27 Correct 15 ms 3676 KB Output is correct
28 Correct 15 ms 3676 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 7 ms 3248 KB Output is correct
17 Correct 11 ms 3420 KB Output is correct
18 Correct 11 ms 3540 KB Output is correct
19 Correct 13 ms 3460 KB Output is correct
20 Correct 10 ms 3420 KB Output is correct
21 Correct 15 ms 3592 KB Output is correct
22 Correct 14 ms 3676 KB Output is correct
23 Correct 15 ms 3536 KB Output is correct
24 Correct 13 ms 3420 KB Output is correct
25 Correct 19 ms 3556 KB Output is correct
26 Correct 15 ms 3612 KB Output is correct
27 Correct 15 ms 3676 KB Output is correct
28 Correct 15 ms 3676 KB Output is correct
29 Correct 864 ms 64232 KB Output is correct
30 Correct 798 ms 63760 KB Output is correct
31 Correct 767 ms 64792 KB Output is correct
32 Correct 879 ms 65004 KB Output is correct
33 Correct 759 ms 57168 KB Output is correct
34 Correct 895 ms 58960 KB Output is correct
35 Correct 1429 ms 67324 KB Output is correct
36 Correct 1154 ms 64256 KB Output is correct
37 Correct 1297 ms 66940 KB Output is correct