oj.uz

답안 #995082

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995082 2024-06-08T12:22:29 Z _callmelucian The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 944 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 + 6;
int lo[2002][2002], hi[2002][2002], loCol[2002][2002], hiCol[2002][2002], hiRow[2002][2002];
int calcLo[mn], calcHi[mn];
vector<pii> contain[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 (auto [row, col] : contain[pos]) {
                curLo = min(curLo, lo[row][col]);
                curHi = max(curHi, hi[row][col]);
            }
        }
        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 j = 1; j <= m; j++) {
        int curLo = INT_MAX, curHi = INT_MIN;
        for (int i = n; i >= 1; i--) {
            loCol[i][j] = curLo = min(curLo, vec[i][j]);
            hiCol[i][j] = curHi = max(curHi, vec[i][j]);
        }
    }

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

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            contain[getID(vec[i][j])].push_back(make_pair(i, j));

    int curLo = INT_MAX, curHi = INT_MIN;
    for (int k = cmp.size() - 1; k >= 0; k--) {
        calcLo[k] = curLo, calcHi[k] = curHi;
        for (auto [row, col] : contain[k]) {
            curLo = min(curLo, lo[row][col]);
            curHi = max(curHi, hi[row][col]);
        }
    }

    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++)
        contain[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:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |             for (auto [row, col] : contain[pos]) {
      |                       ^
joioi.cpp: In function 'int solve(std::vector<std::vector<int> >&, int, int)':
joioi.cpp:68:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   68 |         for (auto [row, col] : contain[k]) {
      |                   ^
joioi.cpp:83:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for (int k = 0; k < cmp.size(); k++)
      |                     ~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 107100 KB Output is correct
2 Correct 18 ms 107100 KB Output is correct
3 Correct 15 ms 107100 KB Output is correct
4 Correct 17 ms 107192 KB Output is correct
5 Correct 19 ms 107100 KB Output is correct
6 Correct 16 ms 107100 KB Output is correct
7 Correct 21 ms 107100 KB Output is correct
8 Correct 16 ms 107348 KB Output is correct
9 Correct 16 ms 107096 KB Output is correct
10 Correct 16 ms 107348 KB Output is correct
11 Correct 16 ms 107096 KB Output is correct
12 Correct 17 ms 107180 KB Output is correct
13 Correct 18 ms 107096 KB Output is correct
14 Correct 16 ms 107100 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 107100 KB Output is correct
2 Correct 18 ms 107100 KB Output is correct
3 Correct 15 ms 107100 KB Output is correct
4 Correct 17 ms 107192 KB Output is correct
5 Correct 19 ms 107100 KB Output is correct
6 Correct 16 ms 107100 KB Output is correct
7 Correct 21 ms 107100 KB Output is correct
8 Correct 16 ms 107348 KB Output is correct
9 Correct 16 ms 107096 KB Output is correct
10 Correct 16 ms 107348 KB Output is correct
11 Correct 16 ms 107096 KB Output is correct
12 Correct 17 ms 107180 KB Output is correct
13 Correct 18 ms 107096 KB Output is correct
14 Correct 16 ms 107100 KB Output is correct
15 Correct 19 ms 117596 KB Output is correct
16 Correct 25 ms 118336 KB Output is correct
17 Correct 38 ms 119252 KB Output is correct
18 Correct 37 ms 119252 KB Output is correct
19 Correct 40 ms 119256 KB Output is correct
20 Correct 46 ms 119096 KB Output is correct
21 Correct 40 ms 119256 KB Output is correct
22 Correct 43 ms 119208 KB Output is correct
23 Correct 53 ms 119248 KB Output is correct
24 Correct 40 ms 119000 KB Output is correct
25 Correct 45 ms 119244 KB Output is correct
26 Correct 40 ms 119256 KB Output is correct
27 Correct 39 ms 119248 KB Output is correct
28 Correct 55 ms 119136 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 107100 KB Output is correct
2 Correct 18 ms 107100 KB Output is correct
3 Correct 15 ms 107100 KB Output is correct
4 Correct 17 ms 107192 KB Output is correct
5 Correct 19 ms 107100 KB Output is correct
6 Correct 16 ms 107100 KB Output is correct
7 Correct 21 ms 107100 KB Output is correct
8 Correct 16 ms 107348 KB Output is correct
9 Correct 16 ms 107096 KB Output is correct
10 Correct 16 ms 107348 KB Output is correct
11 Correct 16 ms 107096 KB Output is correct
12 Correct 17 ms 107180 KB Output is correct
13 Correct 18 ms 107096 KB Output is correct
14 Correct 16 ms 107100 KB Output is correct
15 Correct 19 ms 117596 KB Output is correct
16 Correct 25 ms 118336 KB Output is correct
17 Correct 38 ms 119252 KB Output is correct
18 Correct 37 ms 119252 KB Output is correct
19 Correct 40 ms 119256 KB Output is correct
20 Correct 46 ms 119096 KB Output is correct
21 Correct 40 ms 119256 KB Output is correct
22 Correct 43 ms 119208 KB Output is correct
23 Correct 53 ms 119248 KB Output is correct
24 Correct 40 ms 119000 KB Output is correct
25 Correct 45 ms 119244 KB Output is correct
26 Correct 40 ms 119256 KB Output is correct
27 Correct 39 ms 119248 KB Output is correct
28 Correct 55 ms 119136 KB Output is correct
29 Runtime error 944 ms 262144 KB Execution killed with signal 9
30 Halted 0 ms 0 KB -