oj.uz

답안 #669584

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
669584 2022-12-06T19:25:01 Z Dec0Dedd The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 262144 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define sh short

const int N = 2e3+110;
const int INF = 1e9;

int a[N][N], cnt[N], h, w;
vector<int> v;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

gp_hash_table<int, int, custom_hash> hs;

void fs(int &number) {
    register int c;
    number = 0;
    c = getchar();
    for (; (c>47 && c<58); c=getchar()) number = number *10 + c - 48;
}

bool cmp(sh x, sh y) {
    return a[cnt[x]+1][x] > a[cnt[y]+1][y];
}

deque<int> tmp;

int solve() {
    memset(cnt, 0, sizeof(cnt));
    hs.clear();

    int res=INF, lis=INF, uis=-1;
    deque<int> q=tmp;

    priority_queue<sh, vector<sh>, function<bool(sh, sh)>> pq(cmp);
    pq.push(w);

    for (int k=0; k<(int)v.size(); ++k) {
        while (!pq.empty()) {
            if (a[cnt[pq.top()]+1][pq.top()] <= v[k]) {
                sh x=pq.top(); pq.pop();
                int val=a[cnt[x]+1][x]; ++hs[val];
                lis=min(lis, val), uis=max(uis, val);

                ++cnt[x];
                if (cnt[x] == h) continue;
                if (x == w || cnt[x+1] >= cnt[x]+1) pq.push(x);

                if (x == 1) continue;
                if (cnt[x] == cnt[x-1]+1) pq.push(x-1);
            } else break;
        }

        while (!q.empty()) {
            if (hs[q.front()] > 0) --hs[q.front()], q.pop_front();
            else break;
        }

        while (!q.empty()) {
            if (hs[q.back()] > 0) --hs[q.back()], q.pop_back();
            else break;
        }

        int lf;
        if (q.empty()) lf=INF;
        else lf=q.back()-q.front();

        res=min(res, max(lf, uis-lis));
    }

    return res;
}

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

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

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    fs(h), fs(w);
    for (int i=1; i<=h; ++i) {
        for (int j=1; j<=w; ++j) {
            fs(a[i][j]);
            v.push_back(a[i][j]);
        }
    } sort(v.begin(), v.end());

    for (auto u : v) tmp.push_back(u);
    v.erase(unique(v.begin(), v.end()), v.end());

    int ans=solve();
    hor(); ans=min(ans, solve()); hor();

    ver();
    ans=min(ans, solve());
    hor(); ans=min(ans, solve()); hor();
    printf("%d\n", ans);
}

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 23 ms 1752 KB Output is correct
17 Correct 33 ms 4436 KB Output is correct
18 Correct 35 ms 4460 KB Output is correct
19 Correct 35 ms 4436 KB Output is correct
20 Correct 30 ms 4316 KB Output is correct
21 Correct 33 ms 4436 KB Output is correct
22 Correct 35 ms 4472 KB Output is correct
23 Correct 39 ms 4436 KB Output is correct
24 Correct 32 ms 4296 KB Output is correct
25 Correct 34 ms 4436 KB Output is correct
26 Correct 33 ms 4424 KB Output is correct
27 Correct 35 ms 4520 KB Output is correct
28 Correct 35 ms 4436 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 23 ms 1752 KB Output is correct
17 Correct 33 ms 4436 KB Output is correct
18 Correct 35 ms 4460 KB Output is correct
19 Correct 35 ms 4436 KB Output is correct
20 Correct 30 ms 4316 KB Output is correct
21 Correct 33 ms 4436 KB Output is correct
22 Correct 35 ms 4472 KB Output is correct
23 Correct 39 ms 4436 KB Output is correct
24 Correct 32 ms 4296 KB Output is correct
25 Correct 34 ms 4436 KB Output is correct
26 Correct 33 ms 4424 KB Output is correct
27 Correct 35 ms 4520 KB Output is correct
28 Correct 35 ms 4436 KB Output is correct
29 Correct 2335 ms 68208 KB Output is correct
30 Correct 2245 ms 68068 KB Output is correct
31 Correct 2464 ms 71440 KB Output is correct
32 Correct 2342 ms 71608 KB Output is correct
33 Correct 2181 ms 63420 KB Output is correct
34 Correct 2516 ms 71700 KB Output is correct
35 Execution timed out 4090 ms 262144 KB Time limit exceeded
36 Halted 0 ms 0 KB -