Thin Ice

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

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<set>
#include<numeric>

using namespace std;

#define vi vector<int>
#define pi pair<int, int>
#define vp vector<pi>
#define vvi vector<vi>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define rall(x) rbegin(x), rend(x)
#define ss set<int>

int n, m;

int ind(int x, int y) {
    return y*n+x;
}

struct point {
    int d, x, y, idx;
};

struct UF {
    vi P, Sz, Con;
    vvi C;
    ss up;
    UF (int a) {
        P.resize(a);
        iota(all(P), 0);
        Sz.resize(a, 1);
        Con.resize(a, 0);
        C.resize(a);
    }
    int find(int a) {
        return P[a] == a ? a : P[a] = find(P[a]);
    }
    void uunion(int a, int b) {
        a = find(a); b = find(b);
        //cerr << "union : find(a) : " << a << " ; find(b) : " << b << endl;
        if (a == b) return;
        if (Sz[a] < Sz[b]) swap(a, b);
        if (C[a].size() < C[b].size()) swap(a, b);
        Sz[a] += Sz[b];
        for (auto i : C[b]) C[a].push_back(i);
        up.insert(a);
        P[b] = a;
        Con[a] |= Con[b];
    }
};

bool comp(point a, point b) {
    return a.d > b.d;
}

vi dx = {0, 1, 0, -1};
vi dy = {1, 0, -1, 0};
vi V, Co, S;
vvi Ch;

int oinkoink(int p, int t) {
    //cerr << p << " " << t << endl;
    int a = min(V[p], t + S[p]);
    //cerr << a << endl;
    for (int i = 0; i < Ch[p].size(); i++) {
        //cerr << i << endl;
        a = max(a, oinkoink(Ch[p][i], t + S[p] - S[Ch[p][i]]));
    }
    return a;
}

int oink() {
    vvi D(n, vi(m));
    vector<point> L(n*m);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int d; cin >> d; 
            L[ind(i, j)] = {d, i, j, ind(i, j)};
            //cerr << ind(i, j) << endl;
            D[i][j] = d;
        }
    }
    //cerr << "oink" << endl;
    sort(all(L), comp);
    int i = 0;
    int p = 0;
    UF uf(n*m*2);
    V.resize(n*m*2);
    Co.resize(n*m*2);
    S.resize(n*m*2);
    Ch.resize(n*m*2, {});
    for (int d = 2e5; d > 0; d--) {
        //cerr << "d : " <<  d << endl;
        int j = i;
        while (j < n*m && L[j].d == d) {
            for (int k = 0; k < 4; k++) {
                int x = L[j].x + dx[k];
                int y = L[j].y + dy[k];
                if (x < 0 || x >= n || y < 0 || y >= n || D[x][y] < d) continue;
                //cerr << "x,y : " << x << "," << y << endl;
                uf.uunion(ind(x, y), L[j].idx);
            }
            j++;
            //cerr << j << endl;
        }
        //cerr << "oink" << endl;
        i = j;
        for (auto u : uf.up) {
            if (uf.find(u) != u) continue;
            //cerr << p << endl;
            //cerr << d << " " << uf.Con[u] << " " << uf.Sz[u] << " " << endl;
            /*
            for (auto print : uf.C[u]) {
                cerr << print << endl;
            }
            //*/
            //cerr << p << endl;
            V[p] = d;
            Co[p] = uf.Con[u];
            S[p] = uf.Sz[u];
            Ch[p] = uf.C[u];
            uf.C[u] = {p};
            p++;
        }
    }
    //cerr << "oink" << endl;
    return oinkoink(p-1, 0);
}

int main() {
    ios::sync_with_stdio(); cin.tie();
    cin >> n >> m;
    cout << oink()-1 << "\n";
}

Test 1

Group: 1, 5, 6

Verdict: WRONG ANSWER

Test 2

Group: 1, 5, 6

Verdict: WRONG ANSWER

Test 3

Group: 1, 5, 6

Verdict: WRONG ANSWER

Test 4

Group: 1, 5, 6

Verdict: WRONG ANSWER

Test 5

Group: 1, 5, 6

Verdict: ACCEPTED

Test 6

Group: 1, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 1, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 1, 5, 6

Verdict: ACCEPTED

Test 9

Group: 1, 2, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 2, 6

Verdict: WRONG ANSWER

Test 11

Group: 2, 6

Verdict: WRONG ANSWER

Test 12

Group: 2, 6

Verdict: WRONG ANSWER

Test 13

Group: 2, 6

Verdict: ACCEPTED

Test 14

Group: 2, 6

Verdict: WRONG ANSWER

Test 15

Group: 2, 6

Verdict: WRONG ANSWER

Test 16

Group: 2, 6

Verdict: WRONG ANSWER

Test 17

Group: 2, 6

Verdict: WRONG ANSWER

Test 18

Group: 2, 6

Verdict: WRONG ANSWER

Test 19

Group: 2, 6

Verdict: WRONG ANSWER

Test 20

Group: 2, 6

Verdict: WRONG ANSWER

Test 21

Group: 2, 6

Verdict: WRONG ANSWER

Test 22

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 23

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 24

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 25

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 26

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 27

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 28

Group: 4, 6

Verdict: WRONG ANSWER

Test 29

Group: 4, 6

Verdict: WRONG ANSWER

Test 30

Group: 4, 6

Verdict: RUNTIME ERROR

Test 31

Group: 4, 6

Verdict: WRONG ANSWER

Test 32

Group: 4, 6

Verdict: WRONG ANSWER

Test 33

Group: 4, 6

Verdict: WRONG ANSWER

Test 34

Group: 4, 6

Verdict: RUNTIME ERROR

Test 35

Group: 5, 6

Verdict: RUNTIME ERROR

Test 36

Group: 5, 6

Verdict: RUNTIME ERROR

Test 37

Group: 5, 6

Verdict: WRONG ANSWER

Test 38

Group: 5, 6

Verdict: RUNTIME ERROR

Test 39

Group: 5, 6

Verdict: WRONG ANSWER

Test 40

Group: 5, 6

Verdict: WRONG ANSWER

Test 41

Group: 5, 6

Verdict: RUNTIME ERROR

Test 42

Group: 6

Verdict: RUNTIME ERROR

Test 43

Group: 6

Verdict: RUNTIME ERROR

Test 44

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 45

Group: 6

Verdict: WRONG ANSWER

Test 46

Group: 6

Verdict: WRONG ANSWER

Test 47

Group: 6

Verdict: WRONG ANSWER

Test 48

Group: 6

Verdict: RUNTIME ERROR