oj.uz

답안 #995092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995092 2024-06-08T12:40:23 Z _callmelucian The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 516 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tt;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

vector<int> cmp;

int getID (int targ) {
    return lower_bound(all(cmp), targ) - cmp.begin();
}

const int mn = 4e6;
int lo[2001][2001], hi[2001][2001];
int calcLo[mn], calcHi[mn];
vector<int> row[mn], col[mn];

bool check (int delta) {
    int pos = -1, curLo = INT_MAX, curHi = INT_MIN;
    for (int k = 0; k < cmp.size(); k++) {
        while (pos + 1 < cmp.size() && cmp[pos + 1] < cmp[k] - delta) {
            pos++;
            for (int i = 0; i < row[pos].size(); i++) {
                int r = row[pos][i], c = col[pos][i];
                curLo = min(curLo, lo[r][c]);
                curHi = max(curHi, hi[r][c]);
            }
        }
        int cHi = max(calcHi[k], curHi);
        int cLo = min(calcLo[k], curLo);
        if (cHi == INT_MIN || cHi - cLo <= delta) return 1;
    }
    return 0;
}

int solve (vector<vector<int>> &vec, int n, int m) {
    for (int i = 1; i <= n; i++)
        lo[i][0] = INT_MAX, hi[i][0] = INT_MIN;
    for (int j = 1; j <= m; j++) {
        int loCol = INT_MAX, hiCol = INT_MIN;
        for (int i = n; i >= 1; i--) {
            lo[i][j] = min(lo[i][j - 1], loCol = min(loCol, vec[i][j]));
            hi[i][j] = max(hi[i][j - 1], hiCol = max(hiCol, vec[i][j]));
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            int cur = getID(vec[i][j]);
            row[cur].push_back(i);
            col[cur].push_back(j);
        }
    }

    int curLo = INT_MAX, curHi = INT_MIN;
    for (int k = cmp.size() - 1; k >= 0; k--) {
        calcLo[k] = curLo, calcHi[k] = curHi;
        for (int i = 0; i < row[k].size(); i++) {
            int r = row[k][i], c = col[k][i];
            curLo = min(curLo, lo[r][c]);
            curHi = max(curHi, hi[r][c]);
        }
    }

    int ans = 0;
    if (!check(0)) {
        for (int i = 29; i >= 0; i--) {
            int mask = ans | (1 << i);
            if (!check(mask)) ans |= (1 << i);
        }
        ans++;
    }

    for (int k = 0; k < cmp.size(); k++) {
        row[k].clear();
        col[k].clear();
    }
    return ans;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, m; cin >> n >> m;
    vector<vector<int>> vec(n + 1, vector<int>(m + 1));
    vector<vector<int>> rot(m + 1, vector<int>(n + 1));

    //cmp.push_back(0);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> vec[i][j];
            rot[j][n - i + 1] = vec[i][j];
            cmp.push_back(vec[i][j]);
        }
    }
    sort(all(cmp)); filter(cmp);

    cout << min(solve(vec, n, m), solve(rot, m, n));

    return 0;
}

Compilation message

joioi.cpp: In function 'bool check(int)':
joioi.cpp:26:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for (int k = 0; k < cmp.size(); k++) {
      |                     ~~^~~~~~~~~~~~
joioi.cpp:27:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         while (pos + 1 < cmp.size() && cmp[pos + 1] < cmp[k] - delta) {
      |                ~~~~~~~~^~~~~~~~~~~~
joioi.cpp:29:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             for (int i = 0; i < row[pos].size(); i++) {
      |                             ~~^~~~~~~~~~~~~~~~~
joioi.cpp: In function 'int solve(std::vector<std::vector<int> >&, int, int)':
joioi.cpp:64:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         for (int i = 0; i < row[k].size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~
joioi.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for (int k = 0; k < cmp.size(); k++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 195412 KB Output is correct
2 Correct 30 ms 195416 KB Output is correct
3 Correct 32 ms 195676 KB Output is correct
4 Correct 34 ms 195476 KB Output is correct
5 Correct 30 ms 195420 KB Output is correct
6 Correct 29 ms 195408 KB Output is correct
7 Correct 32 ms 195416 KB Output is correct
8 Correct 31 ms 195408 KB Output is correct
9 Correct 30 ms 195420 KB Output is correct
10 Correct 32 ms 195420 KB Output is correct
11 Correct 32 ms 195420 KB Output is correct
12 Correct 32 ms 195412 KB Output is correct
13 Correct 35 ms 195412 KB Output is correct
14 Correct 30 ms 195408 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 195412 KB Output is correct
2 Correct 30 ms 195416 KB Output is correct
3 Correct 32 ms 195676 KB Output is correct
4 Correct 34 ms 195476 KB Output is correct
5 Correct 30 ms 195420 KB Output is correct
6 Correct 29 ms 195408 KB Output is correct
7 Correct 32 ms 195416 KB Output is correct
8 Correct 31 ms 195408 KB Output is correct
9 Correct 30 ms 195420 KB Output is correct
10 Correct 32 ms 195420 KB Output is correct
11 Correct 32 ms 195420 KB Output is correct
12 Correct 32 ms 195412 KB Output is correct
13 Correct 35 ms 195412 KB Output is correct
14 Correct 30 ms 195408 KB Output is correct
15 Correct 32 ms 199512 KB Output is correct
16 Correct 36 ms 200396 KB Output is correct
17 Correct 61 ms 202444 KB Output is correct
18 Correct 55 ms 202544 KB Output is correct
19 Correct 61 ms 202436 KB Output is correct
20 Correct 59 ms 202200 KB Output is correct
21 Correct 62 ms 202428 KB Output is correct
22 Correct 61 ms 202476 KB Output is correct
23 Correct 65 ms 202508 KB Output is correct
24 Correct 64 ms 202204 KB Output is correct
25 Correct 60 ms 202444 KB Output is correct
26 Correct 65 ms 202448 KB Output is correct
27 Correct 58 ms 202448 KB Output is correct
28 Correct 58 ms 202448 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 195412 KB Output is correct
2 Correct 30 ms 195416 KB Output is correct
3 Correct 32 ms 195676 KB Output is correct
4 Correct 34 ms 195476 KB Output is correct
5 Correct 30 ms 195420 KB Output is correct
6 Correct 29 ms 195408 KB Output is correct
7 Correct 32 ms 195416 KB Output is correct
8 Correct 31 ms 195408 KB Output is correct
9 Correct 30 ms 195420 KB Output is correct
10 Correct 32 ms 195420 KB Output is correct
11 Correct 32 ms 195420 KB Output is correct
12 Correct 32 ms 195412 KB Output is correct
13 Correct 35 ms 195412 KB Output is correct
14 Correct 30 ms 195408 KB Output is correct
15 Correct 32 ms 199512 KB Output is correct
16 Correct 36 ms 200396 KB Output is correct
17 Correct 61 ms 202444 KB Output is correct
18 Correct 55 ms 202544 KB Output is correct
19 Correct 61 ms 202436 KB Output is correct
20 Correct 59 ms 202200 KB Output is correct
21 Correct 62 ms 202428 KB Output is correct
22 Correct 61 ms 202476 KB Output is correct
23 Correct 65 ms 202508 KB Output is correct
24 Correct 64 ms 202204 KB Output is correct
25 Correct 60 ms 202444 KB Output is correct
26 Correct 65 ms 202448 KB Output is correct
27 Correct 58 ms 202448 KB Output is correct
28 Correct 58 ms 202448 KB Output is correct
29 Runtime error 516 ms 262144 KB Execution killed with signal 9
30 Halted 0 ms 0 KB -