oj.uz

Submission #965069

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

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

const int B = 340;

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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 448 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 348 KB Output is correct
9 Correct 96 ms 151928 KB Output is correct
10 Correct 137 ms 225524 KB Output is correct
11 Correct 135 ms 218072 KB Output is correct
12 Correct 149 ms 244516 KB Output is correct
13 Correct 143 ms 244016 KB Output is correct
14 Correct 100 ms 151956 KB Output is correct
15 Correct 194 ms 233076 KB Output is correct
16 Correct 172 ms 220624 KB Output is correct
17 Correct 202 ms 248372 KB Output is correct
18 Correct 221 ms 247944 KB Output is correct
19 Correct 810 ms 12908 KB Output is correct
20 Correct 687 ms 236868 KB Output is correct
21 Execution timed out 2069 ms 216148 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 448 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 348 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 444 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 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 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 2 ms 484 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 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 0 ms 348 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 448 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 348 KB Output is correct
10 Correct 96 ms 151928 KB Output is correct
11 Correct 137 ms 225524 KB Output is correct
12 Correct 135 ms 218072 KB Output is correct
13 Correct 149 ms 244516 KB Output is correct
14 Correct 143 ms 244016 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 444 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 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 344 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 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 484 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 7 ms 5976 KB Output is correct
35 Correct 148 ms 244324 KB Output is correct
36 Correct 149 ms 243376 KB Output is correct
37 Correct 148 ms 242996 KB Output is correct
38 Correct 142 ms 236752 KB Output is correct
39 Correct 139 ms 234852 KB Output is correct
40 Correct 120 ms 198368 KB Output is correct
41 Correct 154 ms 244576 KB Output is correct
42 Correct 176 ms 244268 KB Output is correct
43 Correct 141 ms 243600 KB Output is correct
44 Correct 143 ms 244548 KB Output is correct
45 Correct 174 ms 281312 KB Output is correct
46 Correct 150 ms 244440 KB Output is correct
47 Correct 137 ms 242704 KB Output is correct
48 Correct 159 ms 262868 KB Output is correct
49 Correct 48 ms 12876 KB Output is correct
50 Correct 51 ms 28188 KB Output is correct
51 Correct 140 ms 201356 KB Output is correct
52 Correct 309 ms 391112 KB Output is correct
53 Correct 263 ms 432944 KB Output is correct
54 Correct 298 ms 483580 KB Output is correct
55 Correct 145 ms 243760 KB Output is correct
56 Correct 275 ms 415344 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 448 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 348 KB Output is correct
9 Correct 96 ms 151928 KB Output is correct
10 Correct 137 ms 225524 KB Output is correct
11 Correct 135 ms 218072 KB Output is correct
12 Correct 149 ms 244516 KB Output is correct
13 Correct 143 ms 244016 KB Output is correct
14 Correct 100 ms 151956 KB Output is correct
15 Correct 194 ms 233076 KB Output is correct
16 Correct 172 ms 220624 KB Output is correct
17 Correct 202 ms 248372 KB Output is correct
18 Correct 221 ms 247944 KB Output is correct
19 Execution timed out 2029 ms 222076 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 0 ms 348 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 448 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 348 KB Output is correct
10 Correct 96 ms 151928 KB Output is correct
11 Correct 137 ms 225524 KB Output is correct
12 Correct 135 ms 218072 KB Output is correct
13 Correct 149 ms 244516 KB Output is correct
14 Correct 143 ms 244016 KB Output is correct
15 Correct 100 ms 151956 KB Output is correct
16 Correct 194 ms 233076 KB Output is correct
17 Correct 172 ms 220624 KB Output is correct
18 Correct 202 ms 248372 KB Output is correct
19 Correct 221 ms 247944 KB Output is correct
20 Execution timed out 2029 ms 222076 KB Time limit exceeded
21 Halted 0 ms 0 KB -