oj.uz

답안 #376911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376911 2021-03-12T06:51:51 Z KoD 다리 (APIO19_bridges) C++17
100 / 100
 2626 ms 7896 KB 
#include <bits/stdc++.h>

template <class T>
using Vec = std::vector<T>;

struct DSU {
    Vec<int> par;
    std::stack<std::pair<int, int>> past;
    DSU(const int n): par(n, -1) { }
    int find(int u) const {
        while (par[u] >= 0) {
            u = par[u];
        }
        return u;
    }
    int find_notrack(const int u) {
        return par[u] < 0 ? u : par[u] = find_notrack(par[u]);
    }
    int merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return 0;
        }
        if (par[x] > par[y]) {
            std::swap(x, y);
        }
        past.emplace(x, par[x]);
        past.emplace(y, par[y]);
        par[x] += par[y];
        par[y] = x;
        return 2;
    }
    void merge_notrack(int x, int y) {
        x = find_notrack(x);
        y = find_notrack(y);
        if (x == y) {
            return;
        }
        if (par[x] > par[y]) {
            std::swap(x, y);
        }
        par[x] += par[y];
        par[y] = x;
    }
    int comp(const int x) const {
        return -par[find(x)];
    }
    void rollback() {
        while (!past.empty()) {
            const auto [i, v] = past.top();
            past.pop();
            par[i] = v;
        }
    }
};

int scan() {
    int x;
    std::scanf("%d", &x);
    return x;
}

constexpr int BSIZE = 600;

int main() {
    const auto N = scan();
    const auto M = scan();
    Vec<int> U(M), V(M), D(M);
    for (int i = 0; i < M; ++i) {
        U[i] = scan() - 1;
        V[i] = scan() - 1;
        D[i] = scan();
    }
    const auto Q = scan();
    Vec<int> T(Q), K(Q), W(Q);
    for (int i = 0; i < Q; ++i) {
        T[i] = scan();
        K[i] = scan() - 1;
        W[i] = scan();
    }
    const auto Steps = (Q + BSIZE - 1) / BSIZE;
    Vec<int> ans;
    ans.reserve(Q);
    Vec<bool> dyn(M);
    Vec<int> still(M);
    std::iota(still.begin(), still.end(), 0);
    for (int step = 0; step < Steps; ++step) {
        const auto qL = step * BSIZE;
        const auto qR = std::min((step + 1) * BSIZE, Q);
        Vec<int> set;
        Vec<std::pair<int, int>> ask;
        set.reserve(qR - qL);
        ask.reserve(qR - qL);
        for (int i = qL; i < qR; ++i) {
            if (T[i] == 1) {
                set.push_back(i);
                dyn[K[i]] = true;
            }
            else {
                ask.emplace_back(i, (int) ans.size());
                ans.push_back(0);
            }
        }
        std::sort(ask.begin(), ask.end(), [&](const auto &q1, const auto &q2) {
            return W[q1.first] > W[q2.first];
        });
        Vec<int> change;
        change.reserve(qR - qL);
        for (int i = 0; i < M; ++i) {
            if (dyn[i]) {
                change.push_back(i);
            }
        }
        std::sort(still.begin(), still.end(), [&](const int i, const int j) {
            return D[i] < D[j];
        });
        DSU dsu(N);
        int still_idx = (int) still.size();
        for (const auto [idx, ptr]: ask) {
            while (still_idx > 0) {
                const auto i = still[still_idx - 1];
                if (dyn[i]) {
                    still_idx -= 1;
                    continue;
                }
                if (W[idx] > D[i]) {
                    break;
                }
                still_idx -= 1;
                dsu.merge_notrack(U[i], V[i]);
            }
            std::stack<std::pair<int, int>> past;
            for (const auto i: set) {
                if (i > idx) {
                    break;
                }
                past.emplace(K[i], D[K[i]]);
                D[K[i]] = W[i];
            }
            for (const auto i: change) {
                if (W[idx] <= D[i]) {
                    dsu.merge(U[i], V[i]);
                }
            }
            ans[ptr] = dsu.comp(K[idx]);
            dsu.rollback();
            while (!past.empty()) {
                const auto [i, v] = past.top();
                past.pop();
                D[i] = v;
            }
        }
        for (const auto i: set) {
            D[K[i]] = W[i];
            dyn[K[i]] = false;
        }
    }
    for (const auto x: ans) {
        std::printf("%d\n", x);
    }
    return 0;
}

Compilation message

bridges.cpp: In function 'int scan()':
bridges.cpp:60:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   60 |     std::scanf("%d", &x);
      |     ~~~~~~~~~~^~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 25 ms 492 KB Output is correct
4 Correct 6 ms 492 KB Output is correct
5 Correct 21 ms 492 KB Output is correct
6 Correct 20 ms 492 KB Output is correct
7 Correct 24 ms 492 KB Output is correct
8 Correct 25 ms 492 KB Output is correct
9 Correct 29 ms 492 KB Output is correct
10 Correct 26 ms 492 KB Output is correct
11 Correct 25 ms 492 KB Output is correct
12 Correct 28 ms 492 KB Output is correct
13 Correct 30 ms 492 KB Output is correct
14 Correct 28 ms 492 KB Output is correct
15 Correct 31 ms 620 KB Output is correct
16 Correct 27 ms 492 KB Output is correct
17 Correct 27 ms 492 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1477 ms 2800 KB Output is correct
2 Correct 1450 ms 2808 KB Output is correct
3 Correct 1464 ms 2844 KB Output is correct
4 Correct 1477 ms 2984 KB Output is correct
5 Correct 1443 ms 3112 KB Output is correct
6 Correct 1940 ms 2964 KB Output is correct
7 Correct 1960 ms 2992 KB Output is correct
8 Correct 1922 ms 3112 KB Output is correct
9 Correct 62 ms 2028 KB Output is correct
10 Correct 1261 ms 2948 KB Output is correct
11 Correct 1185 ms 2984 KB Output is correct
12 Correct 1361 ms 3308 KB Output is correct
13 Correct 1218 ms 2716 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1078 ms 2676 KB Output is correct
2 Correct 734 ms 2156 KB Output is correct
3 Correct 1207 ms 3048 KB Output is correct
4 Correct 1071 ms 2520 KB Output is correct
5 Correct 58 ms 2028 KB Output is correct
6 Correct 1174 ms 2752 KB Output is correct
7 Correct 991 ms 2764 KB Output is correct
8 Correct 913 ms 2792 KB Output is correct
9 Correct 787 ms 2920 KB Output is correct
10 Correct 722 ms 2940 KB Output is correct
11 Correct 731 ms 2408 KB Output is correct
12 Correct 683 ms 2280 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1313 ms 4136 KB Output is correct
2 Correct 60 ms 2156 KB Output is correct
3 Correct 150 ms 2284 KB Output is correct
4 Correct 95 ms 2304 KB Output is correct
5 Correct 926 ms 4520 KB Output is correct
6 Correct 1356 ms 4268 KB Output is correct
7 Correct 929 ms 4392 KB Output is correct
8 Correct 636 ms 3264 KB Output is correct
9 Correct 631 ms 3260 KB Output is correct
10 Correct 686 ms 3420 KB Output is correct
11 Correct 1086 ms 3880 KB Output is correct
12 Correct 1090 ms 3752 KB Output is correct
13 Correct 1089 ms 4008 KB Output is correct
14 Correct 873 ms 4424 KB Output is correct
15 Correct 892 ms 4540 KB Output is correct
16 Correct 1415 ms 4520 KB Output is correct
17 Correct 1433 ms 4340 KB Output is correct
18 Correct 1426 ms 4332 KB Output is correct
19 Correct 1420 ms 4320 KB Output is correct
20 Correct 1243 ms 4428 KB Output is correct
21 Correct 1247 ms 4200 KB Output is correct
22 Correct 1374 ms 4416 KB Output is correct
23 Correct 1027 ms 4156 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1477 ms 2800 KB Output is correct
2 Correct 1450 ms 2808 KB Output is correct
3 Correct 1464 ms 2844 KB Output is correct
4 Correct 1477 ms 2984 KB Output is correct
5 Correct 1443 ms 3112 KB Output is correct
6 Correct 1940 ms 2964 KB Output is correct
7 Correct 1960 ms 2992 KB Output is correct
8 Correct 1922 ms 3112 KB Output is correct
9 Correct 62 ms 2028 KB Output is correct
10 Correct 1261 ms 2948 KB Output is correct
11 Correct 1185 ms 2984 KB Output is correct
12 Correct 1361 ms 3308 KB Output is correct
13 Correct 1218 ms 2716 KB Output is correct
14 Correct 1078 ms 2676 KB Output is correct
15 Correct 734 ms 2156 KB Output is correct
16 Correct 1207 ms 3048 KB Output is correct
17 Correct 1071 ms 2520 KB Output is correct
18 Correct 58 ms 2028 KB Output is correct
19 Correct 1174 ms 2752 KB Output is correct
20 Correct 991 ms 2764 KB Output is correct
21 Correct 913 ms 2792 KB Output is correct
22 Correct 787 ms 2920 KB Output is correct
23 Correct 722 ms 2940 KB Output is correct
24 Correct 731 ms 2408 KB Output is correct
25 Correct 683 ms 2280 KB Output is correct
26 Correct 1454 ms 2956 KB Output is correct
27 Correct 1722 ms 3344 KB Output is correct
28 Correct 1557 ms 2904 KB Output is correct
29 Correct 1231 ms 3128 KB Output is correct
30 Correct 1691 ms 3324 KB Output is correct
31 Correct 1706 ms 3108 KB Output is correct
32 Correct 1710 ms 3240 KB Output is correct
33 Correct 1529 ms 3128 KB Output is correct
34 Correct 1522 ms 2856 KB Output is correct
35 Correct 1562 ms 3008 KB Output is correct
36 Correct 1279 ms 2824 KB Output is correct
37 Correct 1288 ms 2988 KB Output is correct
38 Correct 1258 ms 2868 KB Output is correct
39 Correct 1084 ms 3332 KB Output is correct
40 Correct 1071 ms 3220 KB Output is correct
41 Correct 1085 ms 3140 KB Output is correct
42 Correct 983 ms 2600 KB Output is correct
43 Correct 980 ms 2736 KB Output is correct
44 Correct 981 ms 2704 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 25 ms 492 KB Output is correct
4 Correct 6 ms 492 KB Output is correct
5 Correct 21 ms 492 KB Output is correct
6 Correct 20 ms 492 KB Output is correct
7 Correct 24 ms 492 KB Output is correct
8 Correct 25 ms 492 KB Output is correct
9 Correct 29 ms 492 KB Output is correct
10 Correct 26 ms 492 KB Output is correct
11 Correct 25 ms 492 KB Output is correct
12 Correct 28 ms 492 KB Output is correct
13 Correct 30 ms 492 KB Output is correct
14 Correct 28 ms 492 KB Output is correct
15 Correct 31 ms 620 KB Output is correct
16 Correct 27 ms 492 KB Output is correct
17 Correct 27 ms 492 KB Output is correct
18 Correct 1477 ms 2800 KB Output is correct
19 Correct 1450 ms 2808 KB Output is correct
20 Correct 1464 ms 2844 KB Output is correct
21 Correct 1477 ms 2984 KB Output is correct
22 Correct 1443 ms 3112 KB Output is correct
23 Correct 1940 ms 2964 KB Output is correct
24 Correct 1960 ms 2992 KB Output is correct
25 Correct 1922 ms 3112 KB Output is correct
26 Correct 62 ms 2028 KB Output is correct
27 Correct 1261 ms 2948 KB Output is correct
28 Correct 1185 ms 2984 KB Output is correct
29 Correct 1361 ms 3308 KB Output is correct
30 Correct 1218 ms 2716 KB Output is correct
31 Correct 1078 ms 2676 KB Output is correct
32 Correct 734 ms 2156 KB Output is correct
33 Correct 1207 ms 3048 KB Output is correct
34 Correct 1071 ms 2520 KB Output is correct
35 Correct 58 ms 2028 KB Output is correct
36 Correct 1174 ms 2752 KB Output is correct
37 Correct 991 ms 2764 KB Output is correct
38 Correct 913 ms 2792 KB Output is correct
39 Correct 787 ms 2920 KB Output is correct
40 Correct 722 ms 2940 KB Output is correct
41 Correct 731 ms 2408 KB Output is correct
42 Correct 683 ms 2280 KB Output is correct
43 Correct 1313 ms 4136 KB Output is correct
44 Correct 60 ms 2156 KB Output is correct
45 Correct 150 ms 2284 KB Output is correct
46 Correct 95 ms 2304 KB Output is correct
47 Correct 926 ms 4520 KB Output is correct
48 Correct 1356 ms 4268 KB Output is correct
49 Correct 929 ms 4392 KB Output is correct
50 Correct 636 ms 3264 KB Output is correct
51 Correct 631 ms 3260 KB Output is correct
52 Correct 686 ms 3420 KB Output is correct
53 Correct 1086 ms 3880 KB Output is correct
54 Correct 1090 ms 3752 KB Output is correct
55 Correct 1089 ms 4008 KB Output is correct
56 Correct 873 ms 4424 KB Output is correct
57 Correct 892 ms 4540 KB Output is correct
58 Correct 1415 ms 4520 KB Output is correct
59 Correct 1433 ms 4340 KB Output is correct
60 Correct 1426 ms 4332 KB Output is correct
61 Correct 1420 ms 4320 KB Output is correct
62 Correct 1243 ms 4428 KB Output is correct
63 Correct 1247 ms 4200 KB Output is correct
64 Correct 1374 ms 4416 KB Output is correct
65 Correct 1027 ms 4156 KB Output is correct
66 Correct 1454 ms 2956 KB Output is correct
67 Correct 1722 ms 3344 KB Output is correct
68 Correct 1557 ms 2904 KB Output is correct
69 Correct 1231 ms 3128 KB Output is correct
70 Correct 1691 ms 3324 KB Output is correct
71 Correct 1706 ms 3108 KB Output is correct
72 Correct 1710 ms 3240 KB Output is correct
73 Correct 1529 ms 3128 KB Output is correct
74 Correct 1522 ms 2856 KB Output is correct
75 Correct 1562 ms 3008 KB Output is correct
76 Correct 1279 ms 2824 KB Output is correct
77 Correct 1288 ms 2988 KB Output is correct
78 Correct 1258 ms 2868 KB Output is correct
79 Correct 1084 ms 3332 KB Output is correct
80 Correct 1071 ms 3220 KB Output is correct
81 Correct 1085 ms 3140 KB Output is correct
82 Correct 983 ms 2600 KB Output is correct
83 Correct 980 ms 2736 KB Output is correct
84 Correct 981 ms 2704 KB Output is correct
85 Correct 2544 ms 4164 KB Output is correct
86 Correct 258 ms 4076 KB Output is correct
87 Correct 144 ms 4076 KB Output is correct
88 Correct 1366 ms 6188 KB Output is correct
89 Correct 2544 ms 7896 KB Output is correct
90 Correct 1382 ms 6184 KB Output is correct
91 Correct 1538 ms 5544 KB Output is correct
92 Correct 1545 ms 5692 KB Output is correct
93 Correct 2015 ms 5688 KB Output is correct
94 Correct 2033 ms 6440 KB Output is correct
95 Correct 2031 ms 6872 KB Output is correct
96 Correct 1994 ms 6696 KB Output is correct
97 Correct 1124 ms 6440 KB Output is correct
98 Correct 1224 ms 5672 KB Output is correct
99 Correct 2562 ms 7720 KB Output is correct
100 Correct 2626 ms 7456 KB Output is correct
101 Correct 2619 ms 7624 KB Output is correct
102 Correct 2621 ms 7848 KB Output is correct
103 Correct 2222 ms 7104 KB Output is correct
104 Correct 2148 ms 7044 KB Output is correct
105 Correct 1869 ms 6824 KB Output is correct
106 Correct 1574 ms 6440 KB Output is correct
107 Correct 1975 ms 7264 KB Output is correct
108 Correct 2391 ms 7440 KB Output is correct
109 Correct 1321 ms 5692 KB Output is correct