oj.uz

답안 #965032

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
965032 2024-04-18T03:37:53 Z Pannda 자매 도시 (APIO20_swap) C++17
37 / 100
 2000 ms 297308 KB 
#include "swap.h"

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

struct DSU {
    vector<int> f;
    vector<int> siz;
    vector<int> deg;
    vector<int> ok;
    vector<vector<pair<int*, int>>> stk;

    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];
        return u;
    }

    bool unionize(int u0, int v0) {
        stk.emplace_back();
        int u = leader(u0);
        int v = leader(v0);
        if (u == v) {
            stk.back().push_back({&ok[u], ok[u]}); ok[u] = true;
            return false;
        }
        if (siz[u] > siz[v]) swap(u, v);
        stk.back().push_back({&siz[v], siz[v]}); siz[v] += siz[u];
        stk.back().push_back({&deg[u0], deg[u0]}); deg[u0]++;
        stk.back().push_back({&deg[v0], deg[v0]}); deg[v0]++;
        stk.back().push_back({&ok[v], ok[v]}); if (deg[u0] >= 3 || deg[v0] >= 3) ok[v] = true; ok[v] = ok[v] | ok[u];
        stk.back().push_back({&f[u], f[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)];
    }

    void rollback() {
        for (auto [ptr, val] : stk.back()) {
            *ptr = val;
        }
        stk.pop_back();
    }
};
int n, m;
vector<array<int, 3>> edges;
const int B = 1200;
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());
        dsus.back().stk.clear();
        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;
    for (int b0 = 0; ; b0++) {
        if (dsus[b0 + 1].same(X, Y) && dsus[b0 + 1].isOk(X)) {
            int cnt = 0;
            int res;
            for (int i = B * b0; ; i++) {
                dsus[b0].unionize(edges[i][0], edges[i][1]);
                cnt++;
                if (dsus[b0].same(X, Y) && dsus[b0].isOk(X)) {
                    res = edges[i][2];
                    break;
                }
            }
            while (cnt--) dsus[b0].rollback();
            return res;
        }
    }
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 85 ms 100408 KB Output is correct
10 Correct 114 ms 145296 KB Output is correct
11 Correct 99 ms 140400 KB Output is correct
12 Correct 125 ms 156240 KB Output is correct
13 Correct 128 ms 156104 KB Output is correct
14 Correct 85 ms 100912 KB Output is correct
15 Correct 177 ms 150836 KB Output is correct
16 Correct 153 ms 143448 KB Output is correct
17 Correct 172 ms 160056 KB Output is correct
18 Correct 166 ms 160184 KB Output is correct
19 Execution timed out 2069 ms 11100 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 1 ms 788 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 756 KB Output is correct
18 Correct 2 ms 600 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 732 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 704 KB Output is correct
28 Correct 3 ms 860 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 85 ms 100408 KB Output is correct
11 Correct 114 ms 145296 KB Output is correct
12 Correct 99 ms 140400 KB Output is correct
13 Correct 125 ms 156240 KB Output is correct
14 Correct 128 ms 156104 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 1 ms 788 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 756 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 732 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 704 KB Output is correct
33 Correct 3 ms 860 KB Output is correct
34 Correct 9 ms 6232 KB Output is correct
35 Correct 121 ms 155748 KB Output is correct
36 Correct 135 ms 155788 KB Output is correct
37 Correct 118 ms 155740 KB Output is correct
38 Correct 124 ms 152464 KB Output is correct
39 Correct 114 ms 149560 KB Output is correct
40 Correct 92 ms 127200 KB Output is correct
41 Correct 109 ms 155988 KB Output is correct
42 Correct 105 ms 155732 KB Output is correct
43 Correct 113 ms 155880 KB Output is correct
44 Correct 109 ms 155988 KB Output is correct
45 Correct 137 ms 178392 KB Output is correct
46 Correct 104 ms 155672 KB Output is correct
47 Correct 116 ms 155600 KB Output is correct
48 Correct 116 ms 164260 KB Output is correct
49 Correct 64 ms 17016 KB Output is correct
50 Correct 59 ms 23888 KB Output is correct
51 Correct 115 ms 127844 KB Output is correct
52 Correct 181 ms 243024 KB Output is correct
53 Correct 182 ms 268620 KB Output is correct
54 Correct 193 ms 297308 KB Output is correct
55 Correct 123 ms 155728 KB Output is correct
56 Correct 180 ms 258388 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 85 ms 100408 KB Output is correct
10 Correct 114 ms 145296 KB Output is correct
11 Correct 99 ms 140400 KB Output is correct
12 Correct 125 ms 156240 KB Output is correct
13 Correct 128 ms 156104 KB Output is correct
14 Correct 85 ms 100912 KB Output is correct
15 Correct 177 ms 150836 KB Output is correct
16 Correct 153 ms 143448 KB Output is correct
17 Correct 172 ms 160056 KB Output is correct
18 Correct 166 ms 160184 KB Output is correct
19 Execution timed out 2066 ms 147940 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 85 ms 100408 KB Output is correct
11 Correct 114 ms 145296 KB Output is correct
12 Correct 99 ms 140400 KB Output is correct
13 Correct 125 ms 156240 KB Output is correct
14 Correct 128 ms 156104 KB Output is correct
15 Correct 85 ms 100912 KB Output is correct
16 Correct 177 ms 150836 KB Output is correct
17 Correct 153 ms 143448 KB Output is correct
18 Correct 172 ms 160056 KB Output is correct
19 Correct 166 ms 160184 KB Output is correct
20 Execution timed out 2066 ms 147940 KB Time limit exceeded
21 Halted 0 ms 0 KB -