oj.uz

답안 #1088776

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1088776 2024-09-15T03:26:47 Z TrinhKhanhDung The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 2082 ms 118092 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 2e3 + 10;

int N, M;
int a[MAX][MAX], b[MAX][MAX], c[MAX][MAX], d[MAX][MAX], ma, mi = INF;

bool OK(int k, int a[MAX][MAX]){
    vector<vector<int>> val(N + 3, vector<int>(M + 3, 0));
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= M; j++){
            if(a[i][j] - mi <= k) val[i][j] += 1;
            if(ma - a[i][j] <= k) val[i][j] += 2;
            if(val[i][j] == 0) return false;
        }
    }
    int cur = M, t = 0;
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= cur; j++){
            if(val[i][j] == 3 || val[i][j] == t) continue;
            if(t == 0) t = val[i][j];
            else{
                cur = j - 1;
                break;
            }
        }
        for(int j = cur + 1; j <= M; j++){
            if(val[i][j] != 3 && val[i][j] == t) return false;
        }
    }
    return true;
}

void solve(){
    cin >> N >> M;
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= M; j++){
            cin >> a[i][j];
            maximize(ma, a[i][j]);
            minimize(mi, a[i][j]);
        }
    }
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= M; j++){
            b[i][j] = a[i][M + 1 - j];
            c[i][j] = a[N + 1 - i][j];
            d[i][j] = a[N + 1 - i][M + 1 - j];
        }
    }
    int l = 0, r = ma - mi;
    while(l < r){
        int m = (l + r) >> 1;
        if(OK(m, a) || OK(m, b) || OK(m, c) || OK(m, d)){
            r = m;
        }
        else{
            l = m + 1;
        }
    }
    cout << r << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    // freopen("order.inp","r",stdin);
    // freopen("order.out","w",stdout);

    solve();

    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6608 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6608 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 5 ms 8396 KB Output is correct
17 Correct 11 ms 8664 KB Output is correct
18 Correct 6 ms 9840 KB Output is correct
19 Correct 13 ms 8664 KB Output is correct
20 Correct 13 ms 8276 KB Output is correct
21 Correct 14 ms 8764 KB Output is correct
22 Correct 8 ms 9940 KB Output is correct
23 Correct 18 ms 8760 KB Output is correct
24 Correct 7 ms 8364 KB Output is correct
25 Correct 28 ms 8776 KB Output is correct
26 Correct 14 ms 8764 KB Output is correct
27 Correct 14 ms 8760 KB Output is correct
28 Correct 15 ms 8776 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6608 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 5 ms 8396 KB Output is correct
17 Correct 11 ms 8664 KB Output is correct
18 Correct 6 ms 9840 KB Output is correct
19 Correct 13 ms 8664 KB Output is correct
20 Correct 13 ms 8276 KB Output is correct
21 Correct 14 ms 8764 KB Output is correct
22 Correct 8 ms 9940 KB Output is correct
23 Correct 18 ms 8760 KB Output is correct
24 Correct 7 ms 8364 KB Output is correct
25 Correct 28 ms 8776 KB Output is correct
26 Correct 14 ms 8764 KB Output is correct
27 Correct 14 ms 8760 KB Output is correct
28 Correct 15 ms 8776 KB Output is correct
29 Correct 903 ms 97416 KB Output is correct
30 Correct 1022 ms 99828 KB Output is correct
31 Correct 1555 ms 102268 KB Output is correct
32 Correct 933 ms 102416 KB Output is correct
33 Correct 436 ms 89708 KB Output is correct
34 Correct 1156 ms 102492 KB Output is correct
35 Correct 1449 ms 118016 KB Output is correct
36 Correct 831 ms 110716 KB Output is correct
37 Correct 2082 ms 118092 KB Output is correct