CSES - NOI 2024 - Results
Submission details
Task:Thin Ice
Sender:Gustav Bille Gørtz
Submission time:2024-03-06 18:05:41 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
#50
#60
Test results
testverdicttimegroup
#10.00 s1, 5, 6details
#20.00 s1, 5, 6details
#3ACCEPTED0.00 s1, 5, 6details
#4ACCEPTED0.00 s1, 5, 6details
#50.00 s1, 5, 6details
#6ACCEPTED0.00 s1, 5, 6details
#7ACCEPTED0.00 s1, 5, 6details
#80.00 s1, 5, 6details
#9ACCEPTED0.00 s1, 2, 5, 6details
#10ACCEPTED0.04 s2, 6details
#110.04 s2, 6details
#12ACCEPTED0.04 s2, 6details
#130.04 s2, 6details
#14ACCEPTED0.04 s2, 6details
#150.04 s2, 6details
#160.04 s2, 6details
#170.04 s2, 6details
#18ACCEPTED0.04 s2, 6details
#19ACCEPTED0.04 s2, 6details
#20ACCEPTED0.05 s2, 6details
#21ACCEPTED0.04 s2, 6details
#220.00 s3, 4, 5, 6details
#230.00 s3, 4, 5, 6details
#240.00 s3, 4, 5, 6details
#25ACCEPTED0.00 s3, 4, 5, 6details
#26ACCEPTED0.00 s3, 4, 5, 6details
#270.00 s3, 4, 5, 6details
#280.34 s4, 6details
#290.24 s4, 6details
#300.25 s4, 6details
#310.32 s4, 6details
#32ACCEPTED0.19 s4, 6details
#33ACCEPTED0.23 s4, 6details
#340.34 s4, 6details
#350.00 s5, 6details
#360.01 s5, 6details
#370.00 s5, 6details
#380.01 s5, 6details
#39ACCEPTED0.00 s5, 6details
#400.00 s5, 6details
#410.01 s5, 6details
#420.34 s6details
#430.35 s6details
#440.23 s6details
#450.29 s6details
#46ACCEPTED0.18 s6details
#47ACCEPTED0.23 s6details
#480.35 s6details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:90:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for (int i = 0; i < L.size(); i++) {
      |                     ~~^~~~~~~~~~

Code

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>

using namespace std;

#define vi vector<int>
#define vvi vector<vi>
#define vn vector<node>
#define vvn vector<vn>
#define vvvn vector<vvn>
#define pi pair<int, int>
#define sn unordered_set<node>
#define pq priority_queue<node, vector<node>, comp>

struct node {
    int x, y;
};

vvi B, V;
int n, m;

class comp {
    public:
    bool operator()(node a, node b) {
        if (a.x < 0 || a.y < 0 || a.x >= n || a.y >= m) return 1;
        if (b.x < 0 || b.y < 0 || b.x >= n || b.y >= m) return 0;
        return B[a.x][a.y] < B[b.x][b.y];
    }
};

bool comp2(node a, node b) {
    return B[a.x][a.y] > B[b.x][b.y];
}

vn L;
pq Q;


int oink(int x, int y) {
    V.clear();
    V.resize(n, vi(m, 0));
    Q.push({x,y});
    int t = 0, k = B[x][y], a = B[x][y], t2 = 0;
    while(!Q.empty()) {
        auto b = Q.top();
        Q.pop();
        //cerr << b.x << " " << b.y << " " << t << " " << k << " " << a << " " << t2 << endl;
        if (b.x < 0 || b.y < 0 || b.x >= n || b.y >= m) continue;
        if (V[b.x][b.y]) continue;
        t++;
        t2++;
        if (k > B[b.x][b.y]) {
            t -= k - B[b.x][b.y];
            k = B[b.x][b.y];
            if (t < 0) {
                a -= t;
                t = 0;
            }
        }
        V[b.x][b.y] = 1;
        if (t2 == a) return t2;
        Q.push({b.x-1, b.y});
        Q.push({b.x+1, b.y});
        Q.push({b.x, b.y-1});
        Q.push({b.x, b.y+1});
    }
    return t2;
}

int main() {
    cin >> n >> m;
    B.resize(n, vi(m));
    for (int i = 0; i < n; i++) {
        for (auto &j : B[i]) cin >> j;
    }
    for (int i = 0; i < n; i++) {
        L.push_back({i, 0});
        L.push_back({i, m-1});
    }
    for (int i = 1; i < m-1; i++) {
        L.push_back({0, i});
        L.push_back({n-1, i});
    }
    sort(L.begin(), L.end(), comp2);
    int m = 0;
    bool q = 1;
    for (int i = 0; i < L.size(); i++) {
        int x = L[i].x, y = L[i].y;
        if (m >= B[x][y]) {
            cout << m << endl;
            q = 0;
            break;
        }
        m = max(oink(x, y), m);
    }
    if (q) cout << m << endl;
}

Test details

Test 1

Group: 1, 5, 6

Verdict:

input
4 4
9 11 5 7
7 9 14 3
1 3 2 3
11 4 14 8

correct output
10

user output
16

Test 2

Group: 1, 5, 6

Verdict:

input
5 3
10 7 11
8 5 5
12 9 10
3 13 9
...

correct output
10

user output
13

Test 3

Group: 1, 5, 6

Verdict: ACCEPTED

input
4 4
3 2 2 2
5 1 1 1
8 4 1 1
7 6 2 1

correct output
8

user output
8

Test 4

Group: 1, 5, 6

Verdict: ACCEPTED

input
3 5
1 11 1 3 5
4 12 7 8 7
13 14 14 9 4

correct output
14

user output
14

Test 5

Group: 1, 5, 6

Verdict:

input
5 3
11 8 12
11 11 12
6 2 3
11 8 13
...

correct output
12

user output
15

Test 6

Group: 1, 5, 6

Verdict: ACCEPTED

input
3 5
14 14 14 14 14
14 14 14 14 14
14 14 14 14 14

correct output
14

user output
14

Test 7

Group: 1, 5, 6

Verdict: ACCEPTED

input
4 4
12 8 6 5
12 9 6 1
10 1 3 2
8 1 1 1

correct output
12

user output
12

Test 8

Group: 1, 5, 6

Verdict:

input
4 4
8 3 15 14
10 12 2 4
5 16 9 6
7 13 1 11

correct output
13

user output
16

Test 9

Group: 1, 2, 5, 6

Verdict: ACCEPTED

input
4 4
4 1 1 2
3 5 4 2
2 2 1 2
1 4 3 4

correct output
4

user output
4

Test 10

Group: 2, 6

Verdict: ACCEPTED

input
10 20000
5 3 2 1 3 2 3 3 4 5 1 1 2 3 5 ...

correct output
5

user output
5

Test 11

Group: 2, 6

Verdict:

input
10 20000
1 2 1 2 1 2 1 2 1 1 1 1 2 1 1 ...

correct output
3

user output
5

Test 12

Group: 2, 6

Verdict: ACCEPTED

input
10 20000
3 2 2 3 1 2 1 4 4 3 1 4 3 2 4 ...

correct output
5

user output
5

Test 13

Group: 2, 6

Verdict:

input
20000 10
1 1 3 1 2 1 1 1 1 1
1 2 2 1 1 1 1 2 1 1
2 1 1 1 2 2 1 1 1 2
1 1 1 1 1 1 1 1 1 1
...

correct output
4

user output
6

Test 14

Group: 2, 6

Verdict: ACCEPTED

input
10 20000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
3

user output
3

Test 15

Group: 2, 6

Verdict:

input
10 20000
3 1 3 1 2 1 2 3 2 2 1 2 1 1 2 ...

correct output
3

user output
7

Test 16

Group: 2, 6

Verdict:

input
10 20000
1 2 2 2 1 2 3 1 2 2 2 1 2 2 2 ...

correct output
4

user output
6

Test 17

Group: 2, 6

Verdict:

input
10 20000
3 3 2 3 2 3 2 2 2 2 2 1 3 2 1 ...

correct output
4

user output
6

Test 18

Group: 2, 6

Verdict: ACCEPTED

input
10 20000
1 3 3 1 1 4 3 3 3 1 2 2 1 3 1 ...

correct output
5

user output
5

Test 19

Group: 2, 6

Verdict: ACCEPTED

input
7 28571
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

correct output
3

user output
3

Test 20

Group: 2, 6

Verdict: ACCEPTED

input
28571 7
4 4 4 4 4 4 4
4 4 4 4 4 4 4
4 4 4 4 4 4 4
4 4 4 4 4 4 4
...

correct output
5

user output
5

Test 21

Group: 2, 6

Verdict: ACCEPTED

input
447 447
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...

correct output
3

user output
3

Test 22

Group: 3, 4, 5, 6

Verdict:

input
1 100
46 23 23 55 37 17 30 32 25 71 ...

correct output
30

user output
100

Test 23

Group: 3, 4, 5, 6

Verdict:

input
1 100
8 13 12 11 15 15 15 19 18 21 2...

correct output
76

user output
81

Test 24

Group: 3, 4, 5, 6

Verdict:

input
1 100
94 94 94 95 95 91 97 100 92 98...

correct output
95

user output
100

Test 25

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
1 100
83 83 83 83 83 83 83 83 83 83 ...

correct output
83

user output
83

Test 26

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
1 100
33 34 35 38 38 40 41 42 42 45 ...

correct output
95

user output
95

Test 27

Group: 3, 4, 5, 6

Verdict:

input
1 100
57 1 80 39 18 63 30 86 85 55 8...

correct output
29

user output
100

Test 28

Group: 4, 6

Verdict:

input
1 200000
138736 14949 12344 104147 1333...

correct output
1806

user output
200000

Test 29

Group: 4, 6

Verdict:

input
1 200000
141245 141090 141163 141286 14...

correct output
155109

user output
155880

Test 30

Group: 4, 6

Verdict:

input
1 200000
102358 102469 102440 102402 10...

correct output
152388

user output
153083

Test 31

Group: 4, 6

Verdict:

input
1 200000
180410 160820 160820 180614 18...

correct output
160832

user output
200000

Test 32

Group: 4, 6

Verdict: ACCEPTED

input
1 200000
198270 198270 198270 198270 19...

correct output
198270

user output
198270

Test 33

Group: 4, 6

Verdict: ACCEPTED

input
1 200000
1 1 3 2 1 1 2 3 6 6 6 7 8 9 10...

correct output
199995

user output
199995

Test 34

Group: 4, 6

Verdict:

input
1 200000
14737 162555 44228 170991 1340...

correct output
1902

user output
200000

Test 35

Group: 5, 6

Verdict:

input
31 32
669 792 226 189 860 737 291 83...

correct output
565

user output
992

Test 36

Group: 5, 6

Verdict:

input
10 100
730 698 339 743 536 702 94 556...

correct output
529

user output
1000

Test 37

Group: 5, 6

Verdict:

input
32 31
633 613 618 605 635 638 668 67...

correct output
678

user output
689

Test 38

Group: 5, 6

Verdict:

input
142 7
983 930 963 926 979 962 962
966 930 963 924 928 928 926
926 929 929 922 931 931 978
929 929 929 922 959 928 964
...

correct output
934

user output
994

Test 39

Group: 5, 6

Verdict: ACCEPTED

input
31 32
977 977 977 977 977 977 977 97...

correct output
977

user output
977

Test 40

Group: 5, 6

Verdict:

input
50 20
1 27 14 23 38 48 56 3 12 9 6 2...

correct output
997

user output
998

Test 41

Group: 5, 6

Verdict:

input
20 50
481 532 624 290 965 58 448 872...

correct output
504

user output
1000

Test 42

Group: 6

Verdict:

input
447 447
6474 27185 108482 124481 16058...

correct output
88202

user output
199809

Test 43

Group: 6

Verdict:

input
1000 200
27722 57131 197677 184858 9285...

correct output
89324

user output
200000

Test 44

Group: 6

Verdict:

input
447 447
70928 73154 72640 74764 75237 ...

correct output
181096

user output
181346

Test 45

Group: 6

Verdict:

input
7 28571
193031 185883 171670 185794 17...

correct output
171680

user output
199997

Test 46

Group: 6

Verdict: ACCEPTED

input
10 20000
191628 191628 191628 191628 19...

correct output
191628

user output
191628

Test 47

Group: 6

Verdict: ACCEPTED

input
200 1000
3550 2640 3791 4248 4257 4504 ...

correct output
199997

user output
199997

Test 48

Group: 6

Verdict:

input
1000 200
198379 62425 88013 50967 49098...

correct output
89131

user output
200000