oj.uz

Submission #339171

# Submission time Handle Problem Language Result Execution time Memory
339171 2020-12-24T18:28:39 Z Atill83 The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 54120 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 2e3+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll h, w;
int mx = 0, mn = mod;
int g[MAXN][MAXN], ot[MAXN][MAXN];
void turn(){
    for(int i = 0; i < h; i++)
        for(int j = 0; j < w; j++)
            ot[j][h - 1 - i] = g[i][j];

    swap(h, w);
    for(int i = 0; i < h; i++)
        for(int j = 0; j < w; j++)
            g[i][j] = ot[i][j];
}

bool check(int del){
    int sn = 0;
    for(int i = 0; i < h; i++){

        for(int j = 0; j < w; j++){
            if(g[i][j] < mx - del)
                sn = max(sn, j + 1);
        }
    
        for(int j = 0; j < sn; j++){
            if(g[i][j] > mn + del)
                return 0;
        }
        
    }
    return 1;
}




int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>h>>w;

    for(int i = 0; i < h; i++)
        for(int j = 0; j < w; j++){
            cin>>g[i][j];
            mx = max(mx, g[i][j]);
            mn = min(mn, g[i][j]);
        }



    int l = 0, r = (int) 1e9;


    while(l < r){
        int m = (l + r) / 2;

        bool truth = 0;

        truth |= check(m);
        turn();
        truth |= check(m);
        turn();
        truth |= check(m);
        turn();
        truth |= check(m);

        if(truth)
            r = m;
        else
            l = m + 1;
    }

    cout<<l<<endl;

    

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

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 364 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 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 2028 KB Output is correct
16 Correct 14 ms 2284 KB Output is correct
17 Correct 15 ms 2540 KB Output is correct
18 Correct 13 ms 2668 KB Output is correct
19 Correct 14 ms 2540 KB Output is correct
20 Correct 12 ms 2540 KB Output is correct
21 Correct 15 ms 2668 KB Output is correct
22 Correct 12 ms 2668 KB Output is correct
23 Correct 14 ms 2668 KB Output is correct
24 Correct 11 ms 2668 KB Output is correct
25 Correct 15 ms 2668 KB Output is correct
26 Correct 13 ms 2668 KB Output is correct
27 Correct 14 ms 2668 KB Output is correct
28 Correct 15 ms 2668 KB Output is correct

Subtask #3
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 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 2028 KB Output is correct
16 Correct 14 ms 2284 KB Output is correct
17 Correct 15 ms 2540 KB Output is correct
18 Correct 13 ms 2668 KB Output is correct
19 Correct 14 ms 2540 KB Output is correct
20 Correct 12 ms 2540 KB Output is correct
21 Correct 15 ms 2668 KB Output is correct
22 Correct 12 ms 2668 KB Output is correct
23 Correct 14 ms 2668 KB Output is correct
24 Correct 11 ms 2668 KB Output is correct
25 Correct 15 ms 2668 KB Output is correct
26 Correct 13 ms 2668 KB Output is correct
27 Correct 14 ms 2668 KB Output is correct
28 Correct 15 ms 2668 KB Output is correct
29 Execution timed out 4064 ms 54120 KB Time limit exceeded
30 Halted 0 ms 0 KB -