oj.uz

답안 #50321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50321 2018-06-10T06:10:38 Z 노영훈(#1281, Diuven) The Kingdom of JOIOI (JOI17_joioi) C++11
60 / 100
 4000 ms 94900 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long lld;
const int MX=2010, inf=2e9;

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

int solve(){
    multiset<int> J;
    vector<pii> V;

    for(int i=1; i<=h; i++)
        for(int j=1; j<=w; j++)
            V.push_back({B[i][j], i});
    sort(V.begin(), V.end());

    for(int i=1; i<=h; i++){
        r_mx[i][w+1]=0; r_mn[i][w+1]=inf;
        for(int j=w; j>=1; j--){
            r_mx[i][j]=max(r_mx[i][j+1], B[i][j]);
            r_mn[i][j]=min(r_mn[i][j+1], B[i][j]);
        }
    }

    multiset<int> X, Y;
    for(int i=1; i<=h; i++)
        X.insert(r_mx[i][1]), Y.insert(r_mn[i][1]);
    
    int pos[MX]={}; pos[0]=w;
    int mn=inf, mx=0, ans=inf, cnt=0;

    for(pii &p:V){
        int val, i; tie(val, i)=p;
        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);
                X.erase(X.find(r_mx[i][pos[i]]));
                Y.erase(Y.find(r_mn[i][pos[i]]));
                X.insert(r_mx[i][pos[i]+1]);
                Y.insert(r_mn[i][pos[i]+1]);
                cnt++;
            }
            if(!uptd) break;
        }
        if(cnt==0 || cnt==w*h) continue;
        ans=min(ans, max(mx-mn, *X.rbegin()-*Y.begin()) );
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 556 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 3 ms 664 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 836 KB Output is correct
14 Correct 2 ms 836 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 556 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 3 ms 664 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 836 KB Output is correct
14 Correct 2 ms 836 KB Output is correct
15 Correct 4 ms 836 KB Output is correct
16 Correct 55 ms 4252 KB Output is correct
17 Correct 50 ms 4304 KB Output is correct
18 Correct 53 ms 4316 KB Output is correct
19 Correct 52 ms 4316 KB Output is correct
20 Correct 55 ms 4316 KB Output is correct
21 Correct 52 ms 4316 KB Output is correct
22 Correct 59 ms 4316 KB Output is correct
23 Correct 53 ms 4316 KB Output is correct
24 Correct 46 ms 4316 KB Output is correct
25 Correct 57 ms 4316 KB Output is correct
26 Correct 52 ms 4424 KB Output is correct
27 Correct 81 ms 4424 KB Output is correct
28 Correct 50 ms 4424 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 556 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 3 ms 664 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 836 KB Output is correct
14 Correct 2 ms 836 KB Output is correct
15 Correct 4 ms 836 KB Output is correct
16 Correct 55 ms 4252 KB Output is correct
17 Correct 50 ms 4304 KB Output is correct
18 Correct 53 ms 4316 KB Output is correct
19 Correct 52 ms 4316 KB Output is correct
20 Correct 55 ms 4316 KB Output is correct
21 Correct 52 ms 4316 KB Output is correct
22 Correct 59 ms 4316 KB Output is correct
23 Correct 53 ms 4316 KB Output is correct
24 Correct 46 ms 4316 KB Output is correct
25 Correct 57 ms 4316 KB Output is correct
26 Correct 52 ms 4424 KB Output is correct
27 Correct 81 ms 4424 KB Output is correct
28 Correct 50 ms 4424 KB Output is correct
29 Execution timed out 4058 ms 94900 KB Time limit exceeded
30 Halted 0 ms 0 KB -