oj.uz

답안 #369386

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
369386 2021-02-21T14:00:53 Z wiwiho The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 949 ms 54952 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) (((a) + (b) - 1) / (b))
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

int mx = 0, mn = MAX;

bool check(int n, int m, vector<vector<int>>& a, int d){
//    cerr << "check " << d << "\n";
//    for(int i = 0; i < n; i++){
//        for(int j = 0; j < m; j++){
//            if(mx - a[i][j] > d && a[i][j] - mn > d) cerr << "-1 ";
//            else if(mx - a[i][j] <= d && a[i][j] - mn <= d) cerr << "0 ";
//            else if(mx - a[i][j] <= d) cerr << "1 ";
//            else cerr << "2 ";
//        }
//        cerr << "\n";
//    }
    int pos = -1;
    for(int i = 0; i < n; i++){
        bool right = false;
        for(int j = 0; j < m; j++){
            if(mx - a[i][j] > d && a[i][j] - mn > d) return false;
            if(mx - a[i][j] <= d && a[i][j] - mn <= d) continue;
            if(mx - a[i][j] <= d){
                if(right) return false;
                pos = max(pos, j);
            }
            else{
                if(j <= pos) return false;
                right = true;
            }
        }
    }
//    cerr << "ok\n";
    return true;
}

int calc(int n, int m, vector<vector<int>>& a){
    int l = 0, r = 1000000000;
    while(l < r){
//        cerr << l << " " << r << "\n";
        int mid = (l + r) / 2;
        if(check(n, m, a, mid)) r = mid;
        else l = mid + 1;
    }
    return l;
}

int main(){
    StarBurstStream

    int n, m;
    cin >> n >> m;

    vector<vector<int>> a(n, vector<int>(m));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cin >> a[i][j];
            mx = max(mx, a[i][j]);
            mn = min(mn, a[i][j]);
        }
    }

    int ans = calc(n, m, a);
    for(int i = 0; i < n; i++) reverse(iter(a[i]));

//    cerr << "OwO\n";
//    for(int i = 0; i < n; i++) printv(a[i], cerr);
    ans = min(ans, calc(n, m, a));

    reverse(iter(a));
//    cerr << "OwO\n";
//    for(int i = 0; i < n; i++) printv(a[i], cerr);
    ans = min(ans, calc(n, m, a));

    for(int i = 0; i < n; i++) reverse(iter(a[i]));
//    cerr << "OwO\n";
//    for(int i = 0; i < n; i++) printv(a[i], cerr);
    ans = min(ans, calc(n, m, a));

    cout << ans << "\n";

    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 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 384 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 384 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

# 결과 실행 시간 메모리 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 384 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 384 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 1 ms 364 KB Output is correct
16 Correct 8 ms 620 KB Output is correct
17 Correct 9 ms 748 KB Output is correct
18 Correct 9 ms 748 KB Output is correct
19 Correct 11 ms 748 KB Output is correct
20 Correct 9 ms 748 KB Output is correct
21 Correct 8 ms 876 KB Output is correct
22 Correct 9 ms 876 KB Output is correct
23 Correct 11 ms 1004 KB Output is correct
24 Correct 10 ms 876 KB Output is correct
25 Correct 14 ms 876 KB Output is correct
26 Correct 11 ms 1024 KB Output is correct
27 Correct 8 ms 876 KB Output is correct
28 Correct 10 ms 876 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 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 384 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 384 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 1 ms 364 KB Output is correct
16 Correct 8 ms 620 KB Output is correct
17 Correct 9 ms 748 KB Output is correct
18 Correct 9 ms 748 KB Output is correct
19 Correct 11 ms 748 KB Output is correct
20 Correct 9 ms 748 KB Output is correct
21 Correct 8 ms 876 KB Output is correct
22 Correct 9 ms 876 KB Output is correct
23 Correct 11 ms 1004 KB Output is correct
24 Correct 10 ms 876 KB Output is correct
25 Correct 14 ms 876 KB Output is correct
26 Correct 11 ms 1024 KB Output is correct
27 Correct 8 ms 876 KB Output is correct
28 Correct 10 ms 876 KB Output is correct
29 Correct 779 ms 37484 KB Output is correct
30 Correct 809 ms 36588 KB Output is correct
31 Correct 949 ms 39404 KB Output is correct
32 Correct 791 ms 39532 KB Output is correct
33 Correct 703 ms 34284 KB Output is correct
34 Correct 860 ms 39404 KB Output is correct
35 Correct 726 ms 54924 KB Output is correct
36 Correct 624 ms 47924 KB Output is correct
37 Correct 928 ms 54952 KB Output is correct