oj.uz

답안 #965042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
965042 2024-04-18T04:07:18 Z Pannda 자매 도시 (APIO20_swap) C++17
37 / 100
 2000 ms 484944 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 = 500;
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--;
    set<int> dom_set;
    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_set.insert(dsus[b0].leader(edges[i][0]));
            if (!dsus[b0].same(edges[i][0], edges[i][1])) dom_set.insert(dsus[b0].leader(edges[i][1]));
        }
    }
//    sort(dom.begin(), dom.end());
//    dom.resize(unique(dom.begin(), dom.end()) - dom.begin());
    vector<int> dom(dom_set.begin(), dom_set.end());
    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 0 ms 344 KB Output is correct
2 Correct 1 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 348 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 348 KB Output is correct
9 Correct 78 ms 150868 KB Output is correct
10 Correct 112 ms 225380 KB Output is correct
11 Correct 113 ms 218384 KB Output is correct
12 Correct 132 ms 243280 KB Output is correct
13 Correct 121 ms 243276 KB Output is correct
14 Correct 90 ms 151120 KB Output is correct
15 Correct 159 ms 230624 KB Output is correct
16 Correct 150 ms 217788 KB Output is correct
17 Correct 171 ms 244908 KB Output is correct
18 Correct 166 ms 244916 KB Output is correct
19 Execution timed out 2095 ms 9036 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 348 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 344 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 1 ms 348 KB Output is correct
15 Correct 2 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 348 KB Output is correct
21 Correct 2 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 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 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 1 ms 348 KB Output is correct
10 Correct 78 ms 150868 KB Output is correct
11 Correct 112 ms 225380 KB Output is correct
12 Correct 113 ms 218384 KB Output is correct
13 Correct 132 ms 243280 KB Output is correct
14 Correct 121 ms 243276 KB Output is correct
15 Correct 2 ms 344 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 1 ms 348 KB Output is correct
20 Correct 2 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 348 KB Output is correct
26 Correct 2 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 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 7 ms 5468 KB Output is correct
35 Correct 123 ms 243280 KB Output is correct
36 Correct 124 ms 243068 KB Output is correct
37 Correct 117 ms 243284 KB Output is correct
38 Correct 114 ms 238404 KB Output is correct
39 Correct 112 ms 234804 KB Output is correct
40 Correct 98 ms 197072 KB Output is correct
41 Correct 124 ms 243280 KB Output is correct
42 Correct 123 ms 243280 KB Output is correct
43 Correct 140 ms 243276 KB Output is correct
44 Correct 117 ms 243224 KB Output is correct
45 Correct 155 ms 281428 KB Output is correct
46 Correct 124 ms 243284 KB Output is correct
47 Correct 118 ms 244228 KB Output is correct
48 Correct 136 ms 261716 KB Output is correct
49 Correct 50 ms 10072 KB Output is correct
50 Correct 47 ms 25912 KB Output is correct
51 Correct 121 ms 202288 KB Output is correct
52 Correct 197 ms 391832 KB Output is correct
53 Correct 227 ms 434172 KB Output is correct
54 Correct 239 ms 484944 KB Output is correct
55 Correct 125 ms 244268 KB Output is correct
56 Correct 206 ms 417212 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 348 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 348 KB Output is correct
9 Correct 78 ms 150868 KB Output is correct
10 Correct 112 ms 225380 KB Output is correct
11 Correct 113 ms 218384 KB Output is correct
12 Correct 132 ms 243280 KB Output is correct
13 Correct 121 ms 243276 KB Output is correct
14 Correct 90 ms 151120 KB Output is correct
15 Correct 159 ms 230624 KB Output is correct
16 Correct 150 ms 217788 KB Output is correct
17 Correct 171 ms 244908 KB Output is correct
18 Correct 166 ms 244916 KB Output is correct
19 Execution timed out 2052 ms 221008 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 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 1 ms 348 KB Output is correct
10 Correct 78 ms 150868 KB Output is correct
11 Correct 112 ms 225380 KB Output is correct
12 Correct 113 ms 218384 KB Output is correct
13 Correct 132 ms 243280 KB Output is correct
14 Correct 121 ms 243276 KB Output is correct
15 Correct 90 ms 151120 KB Output is correct
16 Correct 159 ms 230624 KB Output is correct
17 Correct 150 ms 217788 KB Output is correct
18 Correct 171 ms 244908 KB Output is correct
19 Correct 166 ms 244916 KB Output is correct
20 Execution timed out 2052 ms 221008 KB Time limit exceeded
21 Halted 0 ms 0 KB -