oj.uz

Submission #50327

# Submission time Handle Problem Language Result Execution time Memory
50327 2018-06-10T06:57:20 Z 노영훈(#1281, Diuven) The Kingdom of JOIOI (JOI17_joioi) C++11
60 / 100
 4000 ms 96652 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long lld;
const int MX=2010, inf=2e9;

inline int _max(int x, int y){ return x>y ? x : y; }
inline int _min(int x, int y){ return x<y ? x : y; }

int B[MX][MX];
int w, h;

struct node {
    int val, x, y;
    bool used;
};

int D[MX][MX];

int solve(){
    vector<node> V;

    int hi=0;
    for(int i=1; i<=h; i++)
        for(int j=1; j<=w; j++){
            V.push_back({B[i][j], i, j, false});
            hi=_max(hi, B[i][j]);
        }

    sort(V.begin(), V.end(), [](node &a, node &b){
        if(a.val==b.val)
            return pii(a.x,a.y) < pii(b.x,b.y);
        return a.val<b.val;
    });
    for(int i=0; i<h*w; i++){
        node &nd=V[i];
        D[nd.x][nd.y]=i;
    }

    int pos[MX]={}; pos[0]=w;
    int mn=inf, mx=0, ans=inf, cnt=0;

    for(int idx=0, nah=0; idx<h*w; idx++){
        int val=V[idx].val, i=V[idx].x;
        for(; i<=h; i++){
            bool uptd=false;
            while(pos[i]<pos[i-1] && B[i][pos[i]+1]<=val){
                uptd=true; pos[i]++;
                int now=B[i][pos[i]];
                mn=_min(mn, now), mx=_max(mx, now);
                V[D[i][pos[i]]].used=true;
                cnt++;
            }
            if(!uptd) break;
        }

        if(cnt==0 || cnt==w*h) continue;
        while(nah<=w*h-1 && V[nah].used) nah++;
        ans=_min(ans, _max(mx-mn, hi-V[nah].val) );
    }
    return ans;
}

void flip_v(){
    for(int i=1; i<=h/2; i++)
        for(int j=1; j<=w; j++)
            swap(B[i][j], B[h-i+1][j]);
}

void flip_h(){
    for(int i=1; i<=h; i++)
        for(int j=1; j<=w/2; j++)
            swap(B[i][j], B[i][w-j+1]);
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>h>>w;
    for(int i=1; i<=h; i++)
        for(int j=1; j<=w; j++)
            cin>>B[i][j];
    int ans=solve();
    flip_v();
    ans=min(ans, solve());
    flip_h();
    ans=min(ans, solve());
    flip_v();
    ans=min(ans, solve());
    cout<<ans;
    return 0;
}

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 484 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 3 ms 692 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 2 ms 692 KB Output is correct
12 Correct 2 ms 692 KB Output is correct
13 Correct 3 ms 692 KB Output is correct
14 Correct 2 ms 692 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 484 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 3 ms 692 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 2 ms 692 KB Output is correct
12 Correct 2 ms 692 KB Output is correct
13 Correct 3 ms 692 KB Output is correct
14 Correct 2 ms 692 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 30 ms 4112 KB Output is correct
17 Correct 39 ms 4208 KB Output is correct
18 Correct 30 ms 4228 KB Output is correct
19 Correct 30 ms 4340 KB Output is correct
20 Correct 27 ms 4340 KB Output is correct
21 Correct 41 ms 4340 KB Output is correct
22 Correct 39 ms 4340 KB Output is correct
23 Correct 31 ms 4340 KB Output is correct
24 Correct 38 ms 4340 KB Output is correct
25 Correct 30 ms 4348 KB Output is correct
26 Correct 31 ms 4348 KB Output is correct
27 Correct 31 ms 4348 KB Output is correct
28 Correct 42 ms 4348 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 484 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 3 ms 692 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 2 ms 692 KB Output is correct
12 Correct 2 ms 692 KB Output is correct
13 Correct 3 ms 692 KB Output is correct
14 Correct 2 ms 692 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 30 ms 4112 KB Output is correct
17 Correct 39 ms 4208 KB Output is correct
18 Correct 30 ms 4228 KB Output is correct
19 Correct 30 ms 4340 KB Output is correct
20 Correct 27 ms 4340 KB Output is correct
21 Correct 41 ms 4340 KB Output is correct
22 Correct 39 ms 4340 KB Output is correct
23 Correct 31 ms 4340 KB Output is correct
24 Correct 38 ms 4340 KB Output is correct
25 Correct 30 ms 4348 KB Output is correct
26 Correct 31 ms 4348 KB Output is correct
27 Correct 31 ms 4348 KB Output is correct
28 Correct 42 ms 4348 KB Output is correct
29 Execution timed out 4054 ms 96652 KB Time limit exceeded
30 Halted 0 ms 0 KB -