oj.uz

답안 #965036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
965036 2024-04-18T04:00:12 Z Pannda 자매 도시 (APIO20_swap) C++17
37 / 100
 2000 ms 250616 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 = 1000;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 53 ms 79552 KB Output is correct
10 Correct 73 ms 117764 KB Output is correct
11 Correct 69 ms 114192 KB Output is correct
12 Correct 78 ms 126228 KB Output is correct
13 Correct 79 ms 126336 KB Output is correct
14 Correct 58 ms 79992 KB Output is correct
15 Correct 126 ms 122920 KB Output is correct
16 Correct 117 ms 117040 KB Output is correct
17 Correct 143 ms 130232 KB Output is correct
18 Correct 130 ms 130240 KB Output is correct
19 Execution timed out 2054 ms 7860 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 2041 ms 117372 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 444 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 444 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 480 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 492 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 348 KB Output is correct
5 Correct 0 ms 348 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 440 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 53 ms 79552 KB Output is correct
11 Correct 73 ms 117764 KB Output is correct
12 Correct 69 ms 114192 KB Output is correct
13 Correct 78 ms 126228 KB Output is correct
14 Correct 79 ms 126336 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 444 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 444 KB Output is correct
26 Correct 2 ms 344 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 480 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 6 ms 3420 KB Output is correct
35 Correct 84 ms 125900 KB Output is correct
36 Correct 74 ms 126000 KB Output is correct
37 Correct 73 ms 126032 KB Output is correct
38 Correct 71 ms 123464 KB Output is correct
39 Correct 83 ms 122144 KB Output is correct
40 Correct 64 ms 102528 KB Output is correct
41 Correct 77 ms 126168 KB Output is correct
42 Correct 76 ms 126036 KB Output is correct
43 Correct 73 ms 125808 KB Output is correct
44 Correct 81 ms 126144 KB Output is correct
45 Correct 108 ms 147128 KB Output is correct
46 Correct 80 ms 125972 KB Output is correct
47 Correct 72 ms 127056 KB Output is correct
48 Correct 81 ms 135408 KB Output is correct
49 Correct 49 ms 10844 KB Output is correct
50 Correct 40 ms 17736 KB Output is correct
51 Correct 82 ms 106984 KB Output is correct
52 Correct 133 ms 203592 KB Output is correct
53 Correct 140 ms 224736 KB Output is correct
54 Correct 156 ms 250616 KB Output is correct
55 Correct 73 ms 127220 KB Output is correct
56 Correct 128 ms 215908 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 53 ms 79552 KB Output is correct
10 Correct 73 ms 117764 KB Output is correct
11 Correct 69 ms 114192 KB Output is correct
12 Correct 78 ms 126228 KB Output is correct
13 Correct 79 ms 126336 KB Output is correct
14 Correct 58 ms 79992 KB Output is correct
15 Correct 126 ms 122920 KB Output is correct
16 Correct 117 ms 117040 KB Output is correct
17 Correct 143 ms 130232 KB Output is correct
18 Correct 130 ms 130240 KB Output is correct
19 Execution timed out 2041 ms 117372 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 348 KB Output is correct
5 Correct 0 ms 348 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 440 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 53 ms 79552 KB Output is correct
11 Correct 73 ms 117764 KB Output is correct
12 Correct 69 ms 114192 KB Output is correct
13 Correct 78 ms 126228 KB Output is correct
14 Correct 79 ms 126336 KB Output is correct
15 Correct 58 ms 79992 KB Output is correct
16 Correct 126 ms 122920 KB Output is correct
17 Correct 117 ms 117040 KB Output is correct
18 Correct 143 ms 130232 KB Output is correct
19 Correct 130 ms 130240 KB Output is correct
20 Execution timed out 2041 ms 117372 KB Time limit exceeded
21 Halted 0 ms 0 KB -