Thin Ice

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

#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, int ma) {
    V.clear();
    while(!Q.empty()) Q.pop();
    V.resize(n, vi(m, 0));
    Q.push({x,y});
    int t = 0, k = B[x][y]+1, a = B[x][y], t2 = 0;
    //cerr << "\n";
    while(!Q.empty()) {
        auto b = Q.top();
        Q.pop();
        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;
            }
        }
        //cerr << b.x << " " << b.y << " " << t << " " << k << " " << a << " " << t2 << endl;
        V[b.x][b.y] = 1;
        if (t2 >= a) return a;
        if (ma >= a) return 0;
        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 ma = 0;
    bool q = 1;
    //V.resize(n, vi(m, 0));
    for (int i = 0; i < L.size(); i++) {
        int x = L[i].x, y = L[i].y;
        if (m >= B[x][y]) {
            cout << ma << endl;
            q = 0;
            break;
        }
        ma = max(oink(x, y, ma), ma);
    }
    if (q) cout << ma << endl;
}

Test 1

Subtask: 1, 5, 6

Verdict: ACCEPTED

Test 2

Subtask: 1, 5, 6

Verdict: ACCEPTED

Test 3

Subtask: 1, 5, 6

Verdict: ACCEPTED

Test 4

Subtask: 1, 5, 6

Verdict: ACCEPTED

Test 5

Subtask: 1, 5, 6

Verdict: ACCEPTED

Test 6

Subtask: 1, 5, 6

Verdict: ACCEPTED

Test 7

Subtask: 1, 5, 6

Verdict: ACCEPTED

Test 8

Subtask: 1, 5, 6

Verdict: ACCEPTED

Test 9

Subtask: 1, 2, 5, 6

Verdict: WRONG ANSWER

Test 10

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 11

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 12

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 13

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 14

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 15

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 16

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 17

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 18

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 19

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 20

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 21

Subtask: 2, 6

Verdict: WRONG ANSWER

Test 22

Subtask: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 23

Subtask: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 24

Subtask: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 25

Subtask: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 26

Subtask: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 27

Subtask: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 28

Subtask: 4, 6

Verdict: WRONG ANSWER

Test 29

Subtask: 4, 6

Verdict: WRONG ANSWER

Test 30

Subtask: 4, 6

Verdict: WRONG ANSWER

Test 31

Subtask: 4, 6

Verdict: WRONG ANSWER

Test 32

Subtask: 4, 6

Verdict: WRONG ANSWER

Test 33

Subtask: 4, 6

Verdict: WRONG ANSWER

Test 34

Subtask: 4, 6

Verdict: WRONG ANSWER

Test 35

Subtask: 5, 6

Verdict: ACCEPTED

Test 36

Subtask: 5, 6

Verdict: ACCEPTED

Test 37

Subtask: 5, 6

Verdict: ACCEPTED

Test 38

Subtask: 5, 6

Verdict: ACCEPTED

Test 39

Subtask: 5, 6

Verdict: ACCEPTED

Test 40

Subtask: 5, 6

Verdict: ACCEPTED

Test 41

Subtask: 5, 6

Verdict: ACCEPTED

Test 42

Subtask: 6

Verdict: ACCEPTED

Test 43

Subtask: 6

Verdict: ACCEPTED

Test 44

Subtask: 6

Verdict: ACCEPTED

Test 45

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

Test 46

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

Test 47

Subtask: 6

Verdict: ACCEPTED

Test 48

Subtask: 6

Verdict: TIME LIMIT EXCEEDED