oj.uz

Submission #965065

# Submission time Handle Problem Language Result Execution time Memory
965065 2024-04-18T04:55:44 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() {}
    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 = 450;
DSU dsu;
struct Block {
    int c;
    vector<int> dom;
    DSU dsu;

    Block(int n, int b, DSU &dsu0, DSU &dsu1, vector<array<int, 3>> &edges) {
        dsu = dsu0;
        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].dsu.same(X, Y) || !blocks[m].dsu.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].dsu.leader(X)];
    int y = mp[blocks[b].dsu.leader(Y)];
    LiteDSU dsu(blocks[b].c);
    int res = -2;
    vector<int> defer;
    for (int u : blocks[b].dom) if (blocks[b].dsu.isOk(u)) dsu.ok[mp[u]] = true;
    for (int i = B * b; i < min(m, B * b + B); i++) {
        int u = mp[blocks[b].dsu.leader(edges[i][0])];
        int v = mp[blocks[b].dsu.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].dsu.deg[edges[i][0]] >= 3) dsu.ok[dsu.leader(u)] = true;
            if (++blocks[b].dsu.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].dsu.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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 356 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 99 ms 170104 KB Output is correct
10 Correct 156 ms 252288 KB Output is correct
11 Correct 145 ms 243692 KB Output is correct
12 Correct 153 ms 273392 KB Output is correct
13 Correct 150 ms 273024 KB Output is correct
14 Correct 105 ms 168880 KB Output is correct
15 Correct 182 ms 259592 KB Output is correct
16 Correct 184 ms 244528 KB Output is correct
17 Correct 191 ms 276632 KB Output is correct
18 Correct 189 ms 276076 KB Output is correct
19 Correct 193 ms 12884 KB Output is correct
20 Correct 856 ms 263268 KB Output is correct
21 Execution timed out 2100 ms 239864 KB Time limit exceeded
22 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 348 KB Output is correct
3 Execution timed out 2045 ms 247300 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 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 356 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 448 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 344 KB Output is correct
15 Correct 1 ms 344 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 456 KB Output is correct
19 Correct 1 ms 344 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 344 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 404 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 356 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 99 ms 170104 KB Output is correct
11 Correct 156 ms 252288 KB Output is correct
12 Correct 145 ms 243692 KB Output is correct
13 Correct 153 ms 273392 KB Output is correct
14 Correct 150 ms 273024 KB Output is correct
15 Correct 1 ms 448 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 344 KB Output is correct
20 Correct 1 ms 344 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 456 KB Output is correct
24 Correct 1 ms 344 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 344 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 404 KB Output is correct
34 Correct 7 ms 6492 KB Output is correct
35 Correct 147 ms 273380 KB Output is correct
36 Correct 150 ms 273356 KB Output is correct
37 Correct 142 ms 271696 KB Output is correct
38 Correct 139 ms 264648 KB Output is correct
39 Correct 145 ms 261928 KB Output is correct
40 Correct 126 ms 221008 KB Output is correct
41 Correct 153 ms 273288 KB Output is correct
42 Correct 148 ms 273376 KB Output is correct
43 Correct 149 ms 272988 KB Output is correct
44 Correct 152 ms 273432 KB Output is correct
45 Correct 183 ms 315208 KB Output is correct
46 Correct 143 ms 273344 KB Output is correct
47 Correct 157 ms 271952 KB Output is correct
48 Correct 164 ms 294088 KB Output is correct
49 Correct 51 ms 12152 KB Output is correct
50 Correct 51 ms 30036 KB Output is correct
51 Correct 139 ms 224852 KB Output is correct
52 Correct 270 ms 437628 KB Output is correct
53 Correct 300 ms 483376 KB Output is correct
54 Runtime error 313 ms 524288 KB Execution killed with signal 9
55 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 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 356 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 99 ms 170104 KB Output is correct
10 Correct 156 ms 252288 KB Output is correct
11 Correct 145 ms 243692 KB Output is correct
12 Correct 153 ms 273392 KB Output is correct
13 Correct 150 ms 273024 KB Output is correct
14 Correct 105 ms 168880 KB Output is correct
15 Correct 182 ms 259592 KB Output is correct
16 Correct 184 ms 244528 KB Output is correct
17 Correct 191 ms 276632 KB Output is correct
18 Correct 189 ms 276076 KB Output is correct
19 Execution timed out 2045 ms 247300 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 356 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 99 ms 170104 KB Output is correct
11 Correct 156 ms 252288 KB Output is correct
12 Correct 145 ms 243692 KB Output is correct
13 Correct 153 ms 273392 KB Output is correct
14 Correct 150 ms 273024 KB Output is correct
15 Correct 105 ms 168880 KB Output is correct
16 Correct 182 ms 259592 KB Output is correct
17 Correct 184 ms 244528 KB Output is correct
18 Correct 191 ms 276632 KB Output is correct
19 Correct 189 ms 276076 KB Output is correct
20 Execution timed out 2045 ms 247300 KB Time limit exceeded
21 Halted 0 ms 0 KB -