Submission #1242837

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242837		Double_Slash	Wombats (IOI13_wombats)	C++20	Compilation error	0 ms	0 KiB

wombats

#include <bits/stdc++.h>

using namespace std;

int R, C, H[5000][200], V[5000][200];

struct Node {
    int agg[200][200];
    Node *lc, *rc;

    void pull(int i) {
        int ps[C]{};
        for (int c = 0; ++c < C;) ps[c] = ps[c - 1] + H[i][c - 1];
        for (int c1 = C; c1--;) {
            for (int c2 = C; c2--;) agg[c1][c2] = abs(ps[c1] - ps[c2]) + V[i][c2];
            for (int c2 = C; --c2;) agg[c1][c2 - 1] = min(agg[c1][c2 - 1], agg[c1][c2] + H[i + 1][c2 - 1]);
            for (int c2 = 0; ++c2 < C;) agg[c1][c2] = min(agg[c1][c2], agg[c1][c2 - 1] + H[i + 1][c2 - 1]);
        }
    }

    void pull() {
        int opt[C][C]{};
        for (int i = C; i--;) {
            int *o = &opt[i][i];
            for (int j = 0; ++j < C;) {
                if (lc->agg[i][j] + rc->agg[j][i] < lc->agg[i][*o] + rc->agg[*o][i]) *o = j;
            }
            agg[i][i] = lc->agg[i][*o] + rc->agg[*o][i];
            for (int j = i; ++j < C;) {
                o = &opt[i][j];
                for (int k = *o = opt[i][j - 1]; ++k <= opt[i + 1][j];) {
                    if (lc->agg[i][k] + rc->agg[k][j] < lc->agg[i][*o] + rc->agg[*o][j]) *o = k;
                }
                agg[i][j] = lc->agg[i][*o] + rc->agg[*o][j];
                o = &opt[j][i];
                for (int k = *o = opt[j - 1][i]; ++k <= opt[j][i + 1];) {
                    if (lc->agg[j][k] + rc->agg[k][i] < lc->agg[j][*o] + rc->agg[*o][i]) *o = k;
                }
                agg[j][i] = lc->agg[j][*o] + rc->agg[*o][i];
            }
        }
    }

    Node(int l, int r) {
        if (l < r) {
            int m = (l + r) >> 1;
            lc = new Node{l, m};
            rc = new Node{m + 1, r};
            pull();
        } else pull(l);
    }

    void upd(int i, int l, int r) {
        if (l == r) {
            pull(l);
            return;
        }
        int m = (l + r) >> 1;
        if (i <= m) lc->upd(i, l, m);
        else rc->upd(i, m + 1, r);
        pull();
    }
} *root;

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    ::R = R, ::C = C;
    memcpy(::H, H, sizeof ::H);
    memcpy(::V, V, sizeof ::V);
    root = new Node{0, R - 2};
}

void changeH(int P, int Q, int W) {
    H[P][Q] = W;
    if (P) root->upd(P - 1, 0, R - 2);
    if (P <= R - 2) root->upd(P, 0, R - 2);
}

void changeV(int P, int Q, int W) {
    V[P][Q] = W;
    root->upd(P, 0, R - 2);
}

int escape(int V1, int V2) { return root->agg[V1][V2]; }

Compilation message (stderr)

/usr/bin/ld: /tmp/cct04AJ7.o: in function `main':
grader.c:(.text.startup+0x13f): undefined reference to `init'
/usr/bin/ld: grader.c:(.text.startup+0x1a2): undefined reference to `escape'
/usr/bin/ld: grader.c:(.text.startup+0x210): undefined reference to `changeH'
/usr/bin/ld: grader.c:(.text.startup+0x285): undefined reference to `changeV'
collect2: error: ld returned 1 exit status