oj.uz

Submission #965038

# Submission time Handle Problem Language Result Execution time Memory
965038 2024-04-18T04:01:33 Z Pannda Swapping Cities (APIO20_swap) C++17
17 / 100
 2000 ms 524288 KB 
#include "swap.h"

#include <bits/stdc++.h>
using namespace std;

struct DSU {
    vector<int> f;
    vector<int> siz;
    vector<int> deg;
    vector<bool> ok;

    DSU(int n) : f(n), siz(n, 1), deg(n, 0), ok(n, false) { iota(f.begin(), f.end(), 0); }

    int leader(int u) {
        while (u != f[u]) u = f[u] = f[f[u]];
        return u;
    }

    bool unionize(int u0, int v0) {
        int u = leader(u0);
        int v = leader(v0);
        if (u == v) {
            ok[u] = true;
            return false;
        }
        if (siz[u] > siz[v]) swap(u, v);
        siz[v] += siz[u];
        if (++deg[u0] >= 3 || ++deg[v0] >= 3) ok[v] = true;
        ok[v] = ok[v] | ok[u];
        f[u] = v;
        return true;
    }

    bool same(int u, int v) {
        return leader(u) == leader(v);
    }

    bool isOk(int u) {
        return ok[leader(u)];
    }
};

struct LiteDSU {
    vector<int> f;
    vector<int> siz;
    vector<bool> ok;

    LiteDSU(int n) : f(n), siz(n, 1), ok(n, false) { iota(f.begin(), f.end(), 0); }

    int leader(int u) {
        while (u != f[u]) u = f[u] = f[f[u]];
        return u;
    }

    bool unionize(int u, int v) {
        u = leader(u);
        v = leader(v);
        if (u == v) return false;
        if (siz[u] > siz[v]) swap(u, v);
        siz[v] += siz[u];
        ok[v] = ok[v] | ok[u];
        f[u] = v;
        return true;
    }

    bool same(int u, int v) {
        return leader(u) == leader(v);
    }

    bool isOk(int u) {
        return ok[leader(u)];
    }
};

int n, m;
vector<array<int, 3>> edges;
const int B = 230;
vector<DSU> dsus;
int b;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    m = M;
    edges.resize(m);
    for (int i = 0; i < m; i++) {
        edges[i] = {U[i], V[i], W[i]};
    }
    sort(edges.begin(), edges.end(), [&](array<int, 3> e0, array<int, 3> e1) { return e0[2] < e1[2]; });

    dsus.emplace_back(n);
    for (b = 0; B * b < m; b++) {
        dsus.push_back(dsus.back());
        for (int i = B * b; i < min(m, B * b + B); i++) {
            dsus.back().unionize(edges[i][0], edges[i][1]);
        }
    }
    b++;
}

int getMinimumFuelCapacity(int X, int Y) {
    if (!dsus.back().same(X, Y) || !dsus.back().isOk(X)) return -1;
    int b0 = b - 1;
    while (dsus[b0].same(X, Y) && dsus[b0].isOk(X)) b0--;
    vector<int> dom;
    for (int i = B * b0; i < min(m, B * b0 + B); i++) {
        if (dsus[b0 + 1].same(X, edges[i][0]) || dsus[b0 + 1].same(X, edges[i][1])) {
            dom.push_back(dsus[b0].leader(edges[i][0]));
            if (!dsus[b0].same(edges[i][0], edges[i][1])) dom.push_back(dsus[b0].leader(edges[i][1]));
        }
    }
    sort(dom.begin(), dom.end());
    dom.resize(unique(dom.begin(), dom.end()) - dom.begin());
    int c = dom.size();
    int x = lower_bound(dom.begin(), dom.end(), dsus[b0].leader(X)) - dom.begin();
    int y = lower_bound(dom.begin(), dom.end(), dsus[b0].leader(Y)) - dom.begin();
    LiteDSU dsu(c);
    int res = -2;
    vector<int> defer;
    for (int u = 0; u < c; u++) if (dsus[b0].isOk(dom[u])) dsu.ok[u] = true;
    for (int i = B * b0; i < min(m, B * b0 + B); i++) {
        if (dsus[b0 + 1].same(X, edges[i][0]) || dsus[b0 + 1].same(X, edges[i][1])) {
            int u = lower_bound(dom.begin(), dom.end(), dsus[b0].leader(edges[i][0])) - dom.begin();
            int v = dsus[b0].same(edges[i][0], edges[i][1]) ? u : lower_bound(dom.begin(), dom.end(), dsus[b0].leader(edges[i][1])) - dom.begin();
            if (dsu.same(u, v)) {
                dsu.ok[dsu.leader(u)] = true;
            } else {
                defer.push_back(edges[i][0]);
                defer.push_back(edges[i][1]);
                if (++dsus[b0].deg[edges[i][0]] >= 3) dsu.ok[dsu.leader(u)] = true;
                if (++dsus[b0].deg[edges[i][1]] >= 3) dsu.ok[dsu.leader(v)] = true;
                dsu.unionize(u, v);
            }
            if (dsu.same(x, y) && dsu.isOk(x)) {
                res = edges[i][2];
                break;
            }
        }
    }
    for (int u : defer) {
        dsus[b0].deg[u]--;
    }
    return res;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 141 ms 324100 KB Output is correct
10 Correct 209 ms 482128 KB Output is correct
11 Correct 195 ms 469188 KB Output is correct
12 Correct 230 ms 522904 KB Output is correct
13 Correct 216 ms 523088 KB Output is correct
14 Correct 142 ms 323152 KB Output is correct
15 Correct 239 ms 492512 KB Output is correct
16 Correct 229 ms 463728 KB Output is correct
17 Runtime error 241 ms 524288 KB Execution killed with signal 9
18 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 2064 ms 471896 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 600 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 141 ms 324100 KB Output is correct
11 Correct 209 ms 482128 KB Output is correct
12 Correct 195 ms 469188 KB Output is correct
13 Correct 230 ms 522904 KB Output is correct
14 Correct 216 ms 523088 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 8 ms 10588 KB Output is correct
35 Correct 207 ms 522968 KB Output is correct
36 Correct 221 ms 522924 KB Output is correct
37 Correct 211 ms 523064 KB Output is correct
38 Correct 209 ms 510484 KB Output is correct
39 Correct 198 ms 503104 KB Output is correct
40 Correct 171 ms 422484 KB Output is correct
41 Correct 215 ms 522912 KB Output is correct
42 Correct 208 ms 522880 KB Output is correct
43 Correct 206 ms 522884 KB Output is correct
44 Correct 211 ms 523088 KB Output is correct
45 Runtime error 240 ms 524288 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 141 ms 324100 KB Output is correct
10 Correct 209 ms 482128 KB Output is correct
11 Correct 195 ms 469188 KB Output is correct
12 Correct 230 ms 522904 KB Output is correct
13 Correct 216 ms 523088 KB Output is correct
14 Correct 142 ms 323152 KB Output is correct
15 Correct 239 ms 492512 KB Output is correct
16 Correct 229 ms 463728 KB Output is correct
17 Runtime error 241 ms 524288 KB Execution killed with signal 9
18 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 141 ms 324100 KB Output is correct
11 Correct 209 ms 482128 KB Output is correct
12 Correct 195 ms 469188 KB Output is correct
13 Correct 230 ms 522904 KB Output is correct
14 Correct 216 ms 523088 KB Output is correct
15 Correct 142 ms 323152 KB Output is correct
16 Correct 239 ms 492512 KB Output is correct
17 Correct 229 ms 463728 KB Output is correct
18 Runtime error 241 ms 524288 KB Execution killed with signal 9
19 Halted 0 ms 0 KB -