oj.uz

Submission #965071

# Submission time Handle Problem Language Result Execution time Memory
965071 2024-04-18T05:01:00 Z Pannda Swapping Cities (APIO20_swap) C++17
37 / 100
 2000 ms 453424 KB 
#include "swap.h"

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

const int B = 360;

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

    DSU() {}
    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;
DSU dsu;
struct Block {
    int c;
    vector<int> dom;
    vector<int> f;
    vector<int> deg;
    vector<bool> ok;

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

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

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

    Block(int n, int b, DSU &dsu0, DSU &dsu1, vector<array<int, 3>> &edges) {
        f = dsu0.f;
        deg = dsu0.deg;
        ok = dsu0.ok;
        vector<int> mp(n, -1);
        for (int i = B * b; i < min(m, B * b + B); i++) {
            int u = dsu0.leader(edges[i][0]);
            int v = dsu0.leader(edges[i][1]);
            if (mp[u] == -1) mp[u] = 0, dom.push_back(u);
            if (mp[v] == -1) mp[v] = 0, dom.push_back(v);
        }
        c = dom.size();
    }
};
vector<Block> blocks;
vector<int> mp;

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]; });

    dsu = DSU(n);
    for (int b = 0; B * b < m; b++) {
        DSU next_dsu = dsu;
        for (int i = B * b; i < min(m, B * b + B); i++) {
            next_dsu.unionize(edges[i][0], edges[i][1]);
        }
        blocks.push_back(Block(n, b, dsu, next_dsu, edges));
        dsu = next_dsu;
    }
    mp.resize(n, -1);
}

int getMinimumFuelCapacity(int X, int Y) {
    if (!dsu.same(X, Y) || !dsu.isOk(X)) return -1;
    int b = [&]() -> int {
        int l = 0, r = (int)blocks.size() - 1;
        while (l < r) {
            int m = (l + r + 1) >> 1;
            if (!blocks[m].same(X, Y) || !blocks[m].isOk(X)) {
                l = m;
            } else {
                r = m - 1;
            }
        }
        return l;
    }();
    int label = 0;
    for (int u : blocks[b].dom) mp[u] = label++;
    int x = mp[blocks[b].leader(X)];
    int y = mp[blocks[b].leader(Y)];
    LiteDSU dsu(blocks[b].c);
    int res = -2;
    vector<int> defer;
    for (int u : blocks[b].dom) if (blocks[b].isOk(u)) dsu.ok[mp[u]] = true;
    for (int i = B * b; i < min(m, B * b + B); i++) {
        int u = mp[blocks[b].leader(edges[i][0])];
        int v = mp[blocks[b].leader(edges[i][1])];
        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 (++blocks[b].deg[edges[i][0]] >= 3) dsu.ok[dsu.leader(u)] = true;
            if (++blocks[b].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) blocks[b].deg[u]--;
    for (int u : blocks[b].dom) mp[u] = -1;
    return res;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 97 ms 144512 KB Output is correct
10 Correct 136 ms 213684 KB Output is correct
11 Correct 127 ms 207132 KB Output is correct
12 Correct 149 ms 230864 KB Output is correct
13 Correct 144 ms 230560 KB Output is correct
14 Correct 101 ms 143912 KB Output is correct
15 Correct 185 ms 220880 KB Output is correct
16 Correct 189 ms 209476 KB Output is correct
17 Correct 204 ms 235012 KB Output is correct
18 Correct 187 ms 234488 KB Output is correct
19 Correct 1537 ms 12528 KB Output is correct
20 Correct 908 ms 224460 KB Output is correct
21 Correct 1862 ms 206604 KB Output is correct
22 Execution timed out 2058 ms 234804 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 2062 ms 210228 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 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 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 420 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 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 452 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 604 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 97 ms 144512 KB Output is correct
11 Correct 136 ms 213684 KB Output is correct
12 Correct 127 ms 207132 KB Output is correct
13 Correct 149 ms 230864 KB Output is correct
14 Correct 144 ms 230560 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 420 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 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 452 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 604 KB Output is correct
34 Correct 7 ms 5724 KB Output is correct
35 Correct 141 ms 230528 KB Output is correct
36 Correct 135 ms 230452 KB Output is correct
37 Correct 145 ms 230192 KB Output is correct
38 Correct 135 ms 224324 KB Output is correct
39 Correct 140 ms 222184 KB Output is correct
40 Correct 116 ms 187168 KB Output is correct
41 Correct 142 ms 230916 KB Output is correct
42 Correct 141 ms 230708 KB Output is correct
43 Correct 139 ms 230240 KB Output is correct
44 Correct 139 ms 230836 KB Output is correct
45 Correct 168 ms 266000 KB Output is correct
46 Correct 137 ms 230728 KB Output is correct
47 Correct 137 ms 230004 KB Output is correct
48 Correct 155 ms 248680 KB Output is correct
49 Correct 54 ms 12080 KB Output is correct
50 Correct 46 ms 26944 KB Output is correct
51 Correct 128 ms 190304 KB Output is correct
52 Correct 233 ms 368892 KB Output is correct
53 Correct 266 ms 407996 KB Output is correct
54 Correct 286 ms 453424 KB Output is correct
55 Correct 149 ms 229516 KB Output is correct
56 Correct 248 ms 391480 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 97 ms 144512 KB Output is correct
10 Correct 136 ms 213684 KB Output is correct
11 Correct 127 ms 207132 KB Output is correct
12 Correct 149 ms 230864 KB Output is correct
13 Correct 144 ms 230560 KB Output is correct
14 Correct 101 ms 143912 KB Output is correct
15 Correct 185 ms 220880 KB Output is correct
16 Correct 189 ms 209476 KB Output is correct
17 Correct 204 ms 235012 KB Output is correct
18 Correct 187 ms 234488 KB Output is correct
19 Execution timed out 2062 ms 210228 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 97 ms 144512 KB Output is correct
11 Correct 136 ms 213684 KB Output is correct
12 Correct 127 ms 207132 KB Output is correct
13 Correct 149 ms 230864 KB Output is correct
14 Correct 144 ms 230560 KB Output is correct
15 Correct 101 ms 143912 KB Output is correct
16 Correct 185 ms 220880 KB Output is correct
17 Correct 189 ms 209476 KB Output is correct
18 Correct 204 ms 235012 KB Output is correct
19 Correct 187 ms 234488 KB Output is correct
20 Execution timed out 2062 ms 210228 KB Time limit exceeded
21 Halted 0 ms 0 KB -