oj.uz

답안 #563627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
563627 2022-05-17T18:39:36 Z brunovsky 다리 (APIO19_bridges) C++17
100 / 100
 2609 ms 14448 KB 
#include <bits/stdc++.h>
#ifdef LOCAL
#include "code/formatting.hpp"
#else
#define debug(...) (void)0
#endif

using namespace std;

struct disjoint_set_rollback {
    int N, S;
    vector<int> next;
    vector<pair<int, int>> history;

    explicit disjoint_set_rollback(int N = 0) : N(N), S(N), next(N, -1) {}

    void assign(int n) { *this = disjoint_set_rollback(n); }
    void reset() { *this = disjoint_set_rollback(N); }
    bool same(int i, int j) { return find(i) == find(j); }
    bool unit(int i) { return next[i] == -1; }
    bool root(int i) { return next[i] < 0; }
    int size(int i) { return -next[i]; }
    int time() const { return history.size(); }

    void rollback(int t) {
        int i = time();
        while (i > t) {
            i--, next[history[i].first] = history[i].second;
            i--, next[history[i].first] = history[i].second;
            S++;
        }
        history.resize(t);
    }

    int find(int i) {
        while (next[i] >= 0) {
            i = next[i];
        }
        return i;
    }

    bool join(int i, int j) {
        i = find(i);
        j = find(j);
        if (i != j) {
            if (size(i) < size(j)) {
                swap(i, j);
            }
            history.emplace_back(i, next[i]);
            history.emplace_back(j, next[j]);
            next[i] += next[j];
            next[j] = i, S--;
            return true;
        }
        return false;
    }
};

auto filter_pairs(const vector<array<int, 2>>& a) {
    int N = a.size();
    vector<array<int, 2>> b;
    for (int i = 0; i < N; i++) {
        if (i == 0 || a[i][0] != a[i - 1][0]) {
            b.push_back(a[i]);
        }
    }
    return b;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int N, M;
    cin >> N >> M;
    vector<array<int, 3>> graph(M);
    for (int i = 0; i < M; i++) {
        int u, v, d;
        cin >> u >> v >> d, u--, v--;
        graph[i] = {d, u, v};
    }

    auto edge_compare = [&](int a, int b) {
        return make_pair(graph[a][0], a) > make_pair(graph[b][0], b);
    };
    set<int, decltype(edge_compare)> edges(edge_compare);
    for (int e = 0; e < M; e++) {
        edges.insert(e);
    }

    int Q;
    cin >> Q;
    vector<array<int, 3>> queries(Q);
    for (int q = 0; q < Q; q++) {
        int t, a, b;
        cin >> t >> a >> b, a--;
        queries[q] = {t, a, b};
    }

    const int B = sqrt(2 * N + Q);
    vector<int> ans(Q), weight(M);

    for (int L = 0, R = min(B, Q); L < Q; L = R, R = min(Q, R + B)) {
        vector<int> upds, asks;
        vector<array<int, 2>> bans;
        for (int q = L; q < R; q++) {
            auto [t, a, b] = queries[q];
            if (t == 1) {
                upds.push_back(q);
                bans.push_back({a, q});
                weight[a] = -1;
            } else if (t == 2) {
                asks.push_back(q);
            } else {
                assert(false);
            }
        }

        sort(begin(asks), end(asks), [&](int i, int j) {
            return make_pair(queries[i][2], j) > make_pair(queries[j][2], i);
        });

        sort(begin(bans), end(bans));
        bans = filter_pairs(bans);

        for (auto [e, _] : bans) {
            edges.erase(e);
        }

        disjoint_set_rollback dsu(N);

        auto it = edges.begin();
        int U = upds.size();

        for (int q : asks) {
            auto [tq, s, w] = queries[q];
            while (it != edges.end() && graph[*it][0] >= w) {
                auto [_, a, b] = graph[*it++];
                dsu.join(a, b);
            }
            int time = dsu.time();
            for (int u = 0; u < U && upds[u] < q; u++) {
                auto [_, e, c] = queries[upds[u]];
                weight[e] = c;
            }
            for (auto [e, t] : bans) {
                int c = q < t ? graph[e][0] : weight[e];
                auto [_, a, b] = graph[e];
                if (c >= w) {
                    dsu.join(a, b);
                }
            }
            ans[q] = dsu.size(dsu.find(s));
            dsu.rollback(time);
        }

        for (int q : upds) {
            auto [_, e, w] = queries[q];
            edges.erase(e), graph[e][0] = w, edges.insert(e);
            weight[e] = 0;
        }
    }

    for (int q = 0; q < Q; q++) {
        if (ans[q] > 0) {
            cout << ans[q] << '\n';
        }
    }

    return 0;
}

// sqrt rebuilds

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 13 ms 716 KB Output is correct
4 Correct 4 ms 544 KB Output is correct
5 Correct 9 ms 620 KB Output is correct
6 Correct 8 ms 632 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 11 ms 596 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 10 ms 596 KB Output is correct
11 Correct 10 ms 636 KB Output is correct
12 Correct 11 ms 624 KB Output is correct
13 Correct 11 ms 584 KB Output is correct
14 Correct 11 ms 592 KB Output is correct
15 Correct 10 ms 592 KB Output is correct
16 Correct 10 ms 560 KB Output is correct
17 Correct 10 ms 468 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1172 ms 10200 KB Output is correct
2 Correct 1175 ms 10012 KB Output is correct
3 Correct 1139 ms 9992 KB Output is correct
4 Correct 1136 ms 10068 KB Output is correct
5 Correct 1152 ms 10028 KB Output is correct
6 Correct 1347 ms 9876 KB Output is correct
7 Correct 1317 ms 9872 KB Output is correct
8 Correct 1347 ms 9876 KB Output is correct
9 Correct 32 ms 3400 KB Output is correct
10 Correct 872 ms 8700 KB Output is correct
11 Correct 925 ms 8680 KB Output is correct
12 Correct 963 ms 9672 KB Output is correct
13 Correct 1052 ms 10044 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 794 ms 7480 KB Output is correct
2 Correct 412 ms 4424 KB Output is correct
3 Correct 846 ms 7384 KB Output is correct
4 Correct 781 ms 7552 KB Output is correct
5 Correct 32 ms 3404 KB Output is correct
6 Correct 850 ms 7568 KB Output is correct
7 Correct 777 ms 7660 KB Output is correct
8 Correct 725 ms 7440 KB Output is correct
9 Correct 594 ms 7472 KB Output is correct
10 Correct 597 ms 7468 KB Output is correct
11 Correct 685 ms 7588 KB Output is correct
12 Correct 649 ms 7484 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2093 ms 14108 KB Output is correct
2 Correct 32 ms 3408 KB Output is correct
3 Correct 583 ms 8640 KB Output is correct
4 Correct 311 ms 8648 KB Output is correct
5 Correct 1462 ms 12640 KB Output is correct
6 Correct 2068 ms 14448 KB Output is correct
7 Correct 1516 ms 12788 KB Output is correct
8 Correct 882 ms 9752 KB Output is correct
9 Correct 792 ms 9852 KB Output is correct
10 Correct 798 ms 9748 KB Output is correct
11 Correct 1410 ms 12120 KB Output is correct
12 Correct 1358 ms 12108 KB Output is correct
13 Correct 1478 ms 11736 KB Output is correct
14 Correct 1266 ms 12776 KB Output is correct
15 Correct 1351 ms 12772 KB Output is correct
16 Correct 2138 ms 14088 KB Output is correct
17 Correct 2159 ms 14088 KB Output is correct
18 Correct 2056 ms 14244 KB Output is correct
19 Correct 2117 ms 14060 KB Output is correct
20 Correct 1614 ms 12484 KB Output is correct
21 Correct 1581 ms 12248 KB Output is correct
22 Correct 1970 ms 13384 KB Output is correct
23 Correct 1440 ms 11168 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1172 ms 10200 KB Output is correct
2 Correct 1175 ms 10012 KB Output is correct
3 Correct 1139 ms 9992 KB Output is correct
4 Correct 1136 ms 10068 KB Output is correct
5 Correct 1152 ms 10028 KB Output is correct
6 Correct 1347 ms 9876 KB Output is correct
7 Correct 1317 ms 9872 KB Output is correct
8 Correct 1347 ms 9876 KB Output is correct
9 Correct 32 ms 3400 KB Output is correct
10 Correct 872 ms 8700 KB Output is correct
11 Correct 925 ms 8680 KB Output is correct
12 Correct 963 ms 9672 KB Output is correct
13 Correct 1052 ms 10044 KB Output is correct
14 Correct 794 ms 7480 KB Output is correct
15 Correct 412 ms 4424 KB Output is correct
16 Correct 846 ms 7384 KB Output is correct
17 Correct 781 ms 7552 KB Output is correct
18 Correct 32 ms 3404 KB Output is correct
19 Correct 850 ms 7568 KB Output is correct
20 Correct 777 ms 7660 KB Output is correct
21 Correct 725 ms 7440 KB Output is correct
22 Correct 594 ms 7472 KB Output is correct
23 Correct 597 ms 7468 KB Output is correct
24 Correct 685 ms 7588 KB Output is correct
25 Correct 649 ms 7484 KB Output is correct
26 Correct 1101 ms 9880 KB Output is correct
27 Correct 1327 ms 9668 KB Output is correct
28 Correct 1222 ms 9984 KB Output is correct
29 Correct 1024 ms 9900 KB Output is correct
30 Correct 1246 ms 9684 KB Output is correct
31 Correct 1320 ms 9860 KB Output is correct
32 Correct 1308 ms 9700 KB Output is correct
33 Correct 1185 ms 9932 KB Output is correct
34 Correct 1173 ms 9924 KB Output is correct
35 Correct 1169 ms 9860 KB Output is correct
36 Correct 1073 ms 10104 KB Output is correct
37 Correct 1024 ms 9816 KB Output is correct
38 Correct 1020 ms 9904 KB Output is correct
39 Correct 876 ms 9944 KB Output is correct
40 Correct 905 ms 9928 KB Output is correct
41 Correct 882 ms 9968 KB Output is correct
42 Correct 905 ms 9868 KB Output is correct
43 Correct 884 ms 9880 KB Output is correct
44 Correct 890 ms 9800 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 13 ms 716 KB Output is correct
4 Correct 4 ms 544 KB Output is correct
5 Correct 9 ms 620 KB Output is correct
6 Correct 8 ms 632 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 11 ms 596 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 10 ms 596 KB Output is correct
11 Correct 10 ms 636 KB Output is correct
12 Correct 11 ms 624 KB Output is correct
13 Correct 11 ms 584 KB Output is correct
14 Correct 11 ms 592 KB Output is correct
15 Correct 10 ms 592 KB Output is correct
16 Correct 10 ms 560 KB Output is correct
17 Correct 10 ms 468 KB Output is correct
18 Correct 1172 ms 10200 KB Output is correct
19 Correct 1175 ms 10012 KB Output is correct
20 Correct 1139 ms 9992 KB Output is correct
21 Correct 1136 ms 10068 KB Output is correct
22 Correct 1152 ms 10028 KB Output is correct
23 Correct 1347 ms 9876 KB Output is correct
24 Correct 1317 ms 9872 KB Output is correct
25 Correct 1347 ms 9876 KB Output is correct
26 Correct 32 ms 3400 KB Output is correct
27 Correct 872 ms 8700 KB Output is correct
28 Correct 925 ms 8680 KB Output is correct
29 Correct 963 ms 9672 KB Output is correct
30 Correct 1052 ms 10044 KB Output is correct
31 Correct 794 ms 7480 KB Output is correct
32 Correct 412 ms 4424 KB Output is correct
33 Correct 846 ms 7384 KB Output is correct
34 Correct 781 ms 7552 KB Output is correct
35 Correct 32 ms 3404 KB Output is correct
36 Correct 850 ms 7568 KB Output is correct
37 Correct 777 ms 7660 KB Output is correct
38 Correct 725 ms 7440 KB Output is correct
39 Correct 594 ms 7472 KB Output is correct
40 Correct 597 ms 7468 KB Output is correct
41 Correct 685 ms 7588 KB Output is correct
42 Correct 649 ms 7484 KB Output is correct
43 Correct 2093 ms 14108 KB Output is correct
44 Correct 32 ms 3408 KB Output is correct
45 Correct 583 ms 8640 KB Output is correct
46 Correct 311 ms 8648 KB Output is correct
47 Correct 1462 ms 12640 KB Output is correct
48 Correct 2068 ms 14448 KB Output is correct
49 Correct 1516 ms 12788 KB Output is correct
50 Correct 882 ms 9752 KB Output is correct
51 Correct 792 ms 9852 KB Output is correct
52 Correct 798 ms 9748 KB Output is correct
53 Correct 1410 ms 12120 KB Output is correct
54 Correct 1358 ms 12108 KB Output is correct
55 Correct 1478 ms 11736 KB Output is correct
56 Correct 1266 ms 12776 KB Output is correct
57 Correct 1351 ms 12772 KB Output is correct
58 Correct 2138 ms 14088 KB Output is correct
59 Correct 2159 ms 14088 KB Output is correct
60 Correct 2056 ms 14244 KB Output is correct
61 Correct 2117 ms 14060 KB Output is correct
62 Correct 1614 ms 12484 KB Output is correct
63 Correct 1581 ms 12248 KB Output is correct
64 Correct 1970 ms 13384 KB Output is correct
65 Correct 1440 ms 11168 KB Output is correct
66 Correct 1101 ms 9880 KB Output is correct
67 Correct 1327 ms 9668 KB Output is correct
68 Correct 1222 ms 9984 KB Output is correct
69 Correct 1024 ms 9900 KB Output is correct
70 Correct 1246 ms 9684 KB Output is correct
71 Correct 1320 ms 9860 KB Output is correct
72 Correct 1308 ms 9700 KB Output is correct
73 Correct 1185 ms 9932 KB Output is correct
74 Correct 1173 ms 9924 KB Output is correct
75 Correct 1169 ms 9860 KB Output is correct
76 Correct 1073 ms 10104 KB Output is correct
77 Correct 1024 ms 9816 KB Output is correct
78 Correct 1020 ms 9904 KB Output is correct
79 Correct 876 ms 9944 KB Output is correct
80 Correct 905 ms 9928 KB Output is correct
81 Correct 882 ms 9968 KB Output is correct
82 Correct 905 ms 9868 KB Output is correct
83 Correct 884 ms 9880 KB Output is correct
84 Correct 890 ms 9800 KB Output is correct
85 Correct 2394 ms 14392 KB Output is correct
86 Correct 587 ms 8604 KB Output is correct
87 Correct 316 ms 8652 KB Output is correct
88 Correct 1839 ms 12568 KB Output is correct
89 Correct 2425 ms 14092 KB Output is correct
90 Correct 1838 ms 12568 KB Output is correct
91 Correct 1198 ms 9788 KB Output is correct
92 Correct 1189 ms 10080 KB Output is correct
93 Correct 1474 ms 9856 KB Output is correct
94 Correct 1733 ms 12212 KB Output is correct
95 Correct 1753 ms 12192 KB Output is correct
96 Correct 1762 ms 11888 KB Output is correct
97 Correct 1589 ms 12700 KB Output is correct
98 Correct 1796 ms 12656 KB Output is correct
99 Correct 2427 ms 14152 KB Output is correct
100 Correct 2609 ms 13956 KB Output is correct
101 Correct 2415 ms 14184 KB Output is correct
102 Correct 2427 ms 14104 KB Output is correct
103 Correct 2125 ms 12512 KB Output is correct
104 Correct 2013 ms 12560 KB Output is correct
105 Correct 1874 ms 12800 KB Output is correct
106 Correct 1531 ms 11896 KB Output is correct
107 Correct 1727 ms 12560 KB Output is correct
108 Correct 2252 ms 13640 KB Output is correct
109 Correct 1774 ms 11196 KB Output is correct