oj.uz

답안 #207800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207800 2020-03-09T05:03:56 Z tri The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 144372 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

const int MAXN = 2000 + 10;

int H, W;

int grid[MAXN][MAXN];
int taken[MAXN][MAXN];

int lin(int i, int j) {
    return i * W + j;
}

pi dLin(int x) {
    return {x / W, x % W};
}

bool check(int i, int j) {
    if (i - 1 >= 0 && !taken[i - 1][j]) {
        return false;
    }
    if (j - 1 >= 0 && !taken[i][j - 1]) {
        return false;
    }
    return true;
}


// compute min cost assuming TL-BR groups and that TL group is smaller
int compute() {
    memset(taken, 0, sizeof(taken));
    vi nums;

    int cur = grid[0][0];

    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            if (grid[i][j] >= cur) {
                nums.pb(grid[i][j]);
            }
        }
    }

    sort(nums.begin(), nums.end());
    nums.erase(unique(nums.begin(), nums.end()), nums.end());

    priority_queue<pi, vector<pi>, greater<pi>> q;

    q.push({cur, lin(0, 0)});

    set<pi> oth;

    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            oth.insert({grid[i][j], lin(i, j)});
        }
    }

    int cMin = cur;
    int cMax = cur;

    int ans = 1e9;

    for (int uBI = 0; uBI < nums.size(); uBI++) {
        int uB = nums[uBI];

        while (q.size()) {
            pi nxt = q.top();
            if (nxt.f > uB) {
                break;
            }
            q.pop();

            int x = nxt.s;
            pi coor = dLin(x);

            int cV = grid[coor.f][coor.s];

            oth.erase({cV, lin(coor.f, coor.s)});

            cMin = min(cMin, cV);
            cMax = max(cMax, cV);

            taken[coor.f][coor.s] = true;

            if (coor.f + 1 < H && check(coor.f + 1, coor.s)) {
                q.push({grid[coor.f + 1][coor.s], lin(coor.f + 1, coor.s)});
            }
            if (coor.s + 1 < W && check(coor.f, coor.s + 1)) {
                q.push({grid[coor.f][coor.s + 1], lin(coor.f, coor.s + 1)});
            }
        }

        if (oth.size()) {
            int cost = cMax - cMin;
            cost = max(cost, (--oth.end())->f - oth.begin()->f);

            ans = min(ans, cost);
        }
    }
    return ans;
}

void flipMag() {
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            grid[i][j] = 1000000001 - grid[i][j];
        }
    }
}

void flip() {
    for (int j = 0; j < W; j++) {
        for (int i = 0; i < H / 2; i++) {
            int tmp = grid[i][j];
            grid[i][j] = grid[H - 1 - i][j];
            grid[H - 1 - i][j] = tmp;
        }
    }
}


int main() {
    cin >> H >> W;

    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            cin >> grid[i][j];
        }
    }

    int ans = compute();

    flipMag();
    int ans2 = compute();

    flip();
    int ans3 = compute();

    flipMag();
    int ans4 = compute();

    int fAns = min(min(ans, ans2), min(ans3, ans4));
    cout << fAns << endl;
}

Compilation message

joioi.cpp: In function 'int compute()':
joioi.cpp:79:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int uBI = 0; uBI < nums.size(); uBI++) {
                       ~~~~^~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 16120 KB Output is correct
2 Correct 19 ms 16120 KB Output is correct
3 Correct 19 ms 16124 KB Output is correct
4 Correct 20 ms 16120 KB Output is correct
5 Correct 19 ms 16120 KB Output is correct
6 Correct 20 ms 16120 KB Output is correct
7 Correct 20 ms 16120 KB Output is correct
8 Correct 19 ms 16120 KB Output is correct
9 Correct 20 ms 16120 KB Output is correct
10 Correct 20 ms 16120 KB Output is correct
11 Correct 20 ms 16248 KB Output is correct
12 Correct 20 ms 16120 KB Output is correct
13 Correct 20 ms 16120 KB Output is correct
14 Correct 20 ms 16376 KB Output is correct
15 Correct 23 ms 16376 KB Output is correct
16 Correct 95 ms 19060 KB Output is correct
17 Correct 137 ms 19468 KB Output is correct
18 Correct 130 ms 19316 KB Output is correct
19 Correct 136 ms 19472 KB Output is correct
20 Correct 119 ms 19032 KB Output is correct
21 Correct 143 ms 19580 KB Output is correct
22 Correct 137 ms 19448 KB Output is correct
23 Correct 140 ms 19480 KB Output is correct
24 Correct 120 ms 19148 KB Output is correct
25 Correct 137 ms 19484 KB Output is correct
26 Correct 143 ms 19600 KB Output is correct
27 Correct 145 ms 19444 KB Output is correct
28 Correct 146 ms 19456 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 16120 KB Output is correct
2 Correct 19 ms 16120 KB Output is correct
3 Correct 19 ms 16124 KB Output is correct
4 Correct 20 ms 16120 KB Output is correct
5 Correct 19 ms 16120 KB Output is correct
6 Correct 20 ms 16120 KB Output is correct
7 Correct 20 ms 16120 KB Output is correct
8 Correct 19 ms 16120 KB Output is correct
9 Correct 20 ms 16120 KB Output is correct
10 Correct 20 ms 16120 KB Output is correct
11 Correct 20 ms 16248 KB Output is correct
12 Correct 20 ms 16120 KB Output is correct
13 Correct 20 ms 16120 KB Output is correct
14 Correct 20 ms 16376 KB Output is correct
15 Correct 23 ms 16376 KB Output is correct
16 Correct 95 ms 19060 KB Output is correct
17 Correct 137 ms 19468 KB Output is correct
18 Correct 130 ms 19316 KB Output is correct
19 Correct 136 ms 19472 KB Output is correct
20 Correct 119 ms 19032 KB Output is correct
21 Correct 143 ms 19580 KB Output is correct
22 Correct 137 ms 19448 KB Output is correct
23 Correct 140 ms 19480 KB Output is correct
24 Correct 120 ms 19148 KB Output is correct
25 Correct 137 ms 19484 KB Output is correct
26 Correct 143 ms 19600 KB Output is correct
27 Correct 145 ms 19444 KB Output is correct
28 Correct 146 ms 19456 KB Output is correct
29 Execution timed out 4009 ms 144372 KB Time limit exceeded
30 Halted 0 ms 0 KB -