oj.uz

답안 #551298

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551298 2022-04-20T08:32:39 Z hoanghq2004 다리 (APIO19_bridges) C++14
100 / 100
 2695 ms 13608 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e5 + 10;
const int B = 400;

int n, m, q;
struct edges {
    int u, v, w, i;
    int operator < (const edges& other) const {
        if (w != other.w) return w > other.w;
        return i < other.i;
    }
} e[N];

set <edges> s;
int temp, num;
int par[N], sz[N];
int ans[N];

struct dta {
    int u, par, sz;
} old[N];

int Find(int u) {
    if (u == par[u]) return u;
    if (temp) old[num++] = {u, par[u], sz[u]};
    return par[u] = Find(par[u]);
}

void Union(int u, int v) {
    if ((u = Find(u)) == (v = Find(v))) return;
    if (temp) {
        old[num++] = {u, par[u], sz[u]};
        old[num++] = {v, par[v], sz[v]};
    }
    if (sz[u] < sz[v]) swap(u, v);
    par[v] = u;
    sz[u] += sz[v];
}

void rollback() {
    for (int i = num - 1; i >= 0; --i) {
        int u = old[i].u;
        par[u] = old[i].par;
        sz[u] = old[i].sz;
    }
    num = 0;
}

int cmd[N], x[N], y[N];
int flag[N], cur[N];

struct triple {
    int x, y, z;
    int operator < (const triple& other) const {
        if (x != other.x) return x > other.x;
        if (y != other.y) return y > other.y;
        return z > other.z;
    }
} ask[N], upd[N];

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        cin >> e[i].u >> e[i].v >> e[i].w;
        e[i].i = i;
        s.insert(e[i]);
    }
    cin >> q;
    int cnt = 0;
    for (int T = 0; T < q; ++T) {
        cin >> cmd[cnt] >> x[cnt] >> y[cnt];
        ++cnt;
        if (cnt == B || T == q - 1) {
            for (int i = 1; i <= n; ++i) par[i] = i, sz[i] = 1;
            vector <int> _;
            int n1 = 0, n2 = 0;
            for (int i = 0; i < cnt; ++i) {
                if (cmd[i] == 1) {
                    flag[x[i]] = 1, _.push_back(x[i]);
                    upd[n2++] = {y[i], x[i], i};
                } else {
                    ask[n1++] = {y[i], x[i], i};
                }
            }
            sort(ask, ask + n1);
            auto iter = s.begin();
            for (int j = 0; j < n1; ++j) {
                auto [w, z, id] = ask[j];
                while (1) {
                    if (iter == s.end() || iter -> w < w) break;
                    if (!flag[iter -> i]) Union(iter -> u, iter -> v);
                    ++iter;
                }
                for (auto i: _) cur[i] = e[i].w;
                temp = 1;
                for (int i = 0; i < n2; ++i) {
                    if (upd[i].z > id) break;
                    cur[upd[i].y] = upd[i].x;
                }
                for (auto i: _)
                    if (cur[i] >= w) Union(e[i].u, e[i].v);
                ans[id] = sz[Find(z)];
                temp = 0;
                rollback();
            }
            for (int i = 0; i < cnt; ++i) {
                if (cmd[i] == 1) {
                    s.erase(e[x[i]]);
                    e[x[i]].w = y[i];
                    s.insert(e[x[i]]);
                    flag[x[i]] = 0;
                } else {
                    cout << ans[i] << '\n';
                }
            }
            cnt = 0;
        }
    }
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:100:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  100 |                 auto [w, z, id] = ask[j];
      |                      ^

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 22 ms 500 KB Output is correct
4 Correct 6 ms 396 KB Output is correct
5 Correct 22 ms 420 KB Output is correct
6 Correct 20 ms 420 KB Output is correct
7 Correct 21 ms 340 KB Output is correct
8 Correct 22 ms 340 KB Output is correct
9 Correct 28 ms 340 KB Output is correct
10 Correct 23 ms 420 KB Output is correct
11 Correct 23 ms 408 KB Output is correct
12 Correct 26 ms 340 KB Output is correct
13 Correct 26 ms 424 KB Output is correct
14 Correct 22 ms 340 KB Output is correct
15 Correct 26 ms 420 KB Output is correct
16 Correct 26 ms 416 KB Output is correct
17 Correct 24 ms 420 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1193 ms 5208 KB Output is correct
2 Correct 1167 ms 5280 KB Output is correct
3 Correct 1199 ms 5116 KB Output is correct
4 Correct 1244 ms 5284 KB Output is correct
5 Correct 1278 ms 5220 KB Output is correct
6 Correct 1870 ms 5476 KB Output is correct
7 Correct 1838 ms 5364 KB Output is correct
8 Correct 1808 ms 5428 KB Output is correct
9 Correct 34 ms 568 KB Output is correct
10 Correct 824 ms 5384 KB Output is correct
11 Correct 835 ms 5212 KB Output is correct
12 Correct 1223 ms 5596 KB Output is correct
13 Correct 1255 ms 5260 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 825 ms 3516 KB Output is correct
2 Correct 458 ms 1412 KB Output is correct
3 Correct 914 ms 3608 KB Output is correct
4 Correct 766 ms 3656 KB Output is correct
5 Correct 31 ms 520 KB Output is correct
6 Correct 813 ms 3736 KB Output is correct
7 Correct 727 ms 3608 KB Output is correct
8 Correct 689 ms 3588 KB Output is correct
9 Correct 605 ms 3772 KB Output is correct
10 Correct 553 ms 3624 KB Output is correct
11 Correct 577 ms 3500 KB Output is correct
12 Correct 617 ms 3500 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2654 ms 9016 KB Output is correct
2 Correct 35 ms 560 KB Output is correct
3 Correct 281 ms 8296 KB Output is correct
4 Correct 102 ms 8168 KB Output is correct
5 Correct 1728 ms 9176 KB Output is correct
6 Correct 2695 ms 9024 KB Output is correct
7 Correct 1687 ms 9060 KB Output is correct
8 Correct 946 ms 5004 KB Output is correct
9 Correct 966 ms 4796 KB Output is correct
10 Correct 835 ms 5144 KB Output is correct
11 Correct 1427 ms 6972 KB Output is correct
12 Correct 1271 ms 7144 KB Output is correct
13 Correct 1297 ms 7424 KB Output is correct
14 Correct 909 ms 9272 KB Output is correct
15 Correct 1088 ms 9216 KB Output is correct
16 Correct 1879 ms 9132 KB Output is correct
17 Correct 1967 ms 11340 KB Output is correct
18 Correct 1870 ms 11408 KB Output is correct
19 Correct 1914 ms 11380 KB Output is correct
20 Correct 1532 ms 10352 KB Output is correct
21 Correct 1482 ms 10188 KB Output is correct
22 Correct 1809 ms 11144 KB Output is correct
23 Correct 1169 ms 9696 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1193 ms 5208 KB Output is correct
2 Correct 1167 ms 5280 KB Output is correct
3 Correct 1199 ms 5116 KB Output is correct
4 Correct 1244 ms 5284 KB Output is correct
5 Correct 1278 ms 5220 KB Output is correct
6 Correct 1870 ms 5476 KB Output is correct
7 Correct 1838 ms 5364 KB Output is correct
8 Correct 1808 ms 5428 KB Output is correct
9 Correct 34 ms 568 KB Output is correct
10 Correct 824 ms 5384 KB Output is correct
11 Correct 835 ms 5212 KB Output is correct
12 Correct 1223 ms 5596 KB Output is correct
13 Correct 1255 ms 5260 KB Output is correct
14 Correct 825 ms 3516 KB Output is correct
15 Correct 458 ms 1412 KB Output is correct
16 Correct 914 ms 3608 KB Output is correct
17 Correct 766 ms 3656 KB Output is correct
18 Correct 31 ms 520 KB Output is correct
19 Correct 813 ms 3736 KB Output is correct
20 Correct 727 ms 3608 KB Output is correct
21 Correct 689 ms 3588 KB Output is correct
22 Correct 605 ms 3772 KB Output is correct
23 Correct 553 ms 3624 KB Output is correct
24 Correct 577 ms 3500 KB Output is correct
25 Correct 617 ms 3500 KB Output is correct
26 Correct 873 ms 5136 KB Output is correct
27 Correct 1085 ms 5268 KB Output is correct
28 Correct 989 ms 5540 KB Output is correct
29 Correct 826 ms 5240 KB Output is correct
30 Correct 1142 ms 5588 KB Output is correct
31 Correct 1147 ms 5484 KB Output is correct
32 Correct 1211 ms 5620 KB Output is correct
33 Correct 996 ms 5256 KB Output is correct
34 Correct 1022 ms 5380 KB Output is correct
35 Correct 1088 ms 5364 KB Output is correct
36 Correct 878 ms 5372 KB Output is correct
37 Correct 867 ms 5336 KB Output is correct
38 Correct 852 ms 5332 KB Output is correct
39 Correct 764 ms 5372 KB Output is correct
40 Correct 742 ms 5464 KB Output is correct
41 Correct 713 ms 5260 KB Output is correct
42 Correct 718 ms 5224 KB Output is correct
43 Correct 715 ms 5180 KB Output is correct
44 Correct 727 ms 5224 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 22 ms 500 KB Output is correct
4 Correct 6 ms 396 KB Output is correct
5 Correct 22 ms 420 KB Output is correct
6 Correct 20 ms 420 KB Output is correct
7 Correct 21 ms 340 KB Output is correct
8 Correct 22 ms 340 KB Output is correct
9 Correct 28 ms 340 KB Output is correct
10 Correct 23 ms 420 KB Output is correct
11 Correct 23 ms 408 KB Output is correct
12 Correct 26 ms 340 KB Output is correct
13 Correct 26 ms 424 KB Output is correct
14 Correct 22 ms 340 KB Output is correct
15 Correct 26 ms 420 KB Output is correct
16 Correct 26 ms 416 KB Output is correct
17 Correct 24 ms 420 KB Output is correct
18 Correct 1193 ms 5208 KB Output is correct
19 Correct 1167 ms 5280 KB Output is correct
20 Correct 1199 ms 5116 KB Output is correct
21 Correct 1244 ms 5284 KB Output is correct
22 Correct 1278 ms 5220 KB Output is correct
23 Correct 1870 ms 5476 KB Output is correct
24 Correct 1838 ms 5364 KB Output is correct
25 Correct 1808 ms 5428 KB Output is correct
26 Correct 34 ms 568 KB Output is correct
27 Correct 824 ms 5384 KB Output is correct
28 Correct 835 ms 5212 KB Output is correct
29 Correct 1223 ms 5596 KB Output is correct
30 Correct 1255 ms 5260 KB Output is correct
31 Correct 825 ms 3516 KB Output is correct
32 Correct 458 ms 1412 KB Output is correct
33 Correct 914 ms 3608 KB Output is correct
34 Correct 766 ms 3656 KB Output is correct
35 Correct 31 ms 520 KB Output is correct
36 Correct 813 ms 3736 KB Output is correct
37 Correct 727 ms 3608 KB Output is correct
38 Correct 689 ms 3588 KB Output is correct
39 Correct 605 ms 3772 KB Output is correct
40 Correct 553 ms 3624 KB Output is correct
41 Correct 577 ms 3500 KB Output is correct
42 Correct 617 ms 3500 KB Output is correct
43 Correct 2654 ms 9016 KB Output is correct
44 Correct 35 ms 560 KB Output is correct
45 Correct 281 ms 8296 KB Output is correct
46 Correct 102 ms 8168 KB Output is correct
47 Correct 1728 ms 9176 KB Output is correct
48 Correct 2695 ms 9024 KB Output is correct
49 Correct 1687 ms 9060 KB Output is correct
50 Correct 946 ms 5004 KB Output is correct
51 Correct 966 ms 4796 KB Output is correct
52 Correct 835 ms 5144 KB Output is correct
53 Correct 1427 ms 6972 KB Output is correct
54 Correct 1271 ms 7144 KB Output is correct
55 Correct 1297 ms 7424 KB Output is correct
56 Correct 909 ms 9272 KB Output is correct
57 Correct 1088 ms 9216 KB Output is correct
58 Correct 1879 ms 9132 KB Output is correct
59 Correct 1967 ms 11340 KB Output is correct
60 Correct 1870 ms 11408 KB Output is correct
61 Correct 1914 ms 11380 KB Output is correct
62 Correct 1532 ms 10352 KB Output is correct
63 Correct 1482 ms 10188 KB Output is correct
64 Correct 1809 ms 11144 KB Output is correct
65 Correct 1169 ms 9696 KB Output is correct
66 Correct 873 ms 5136 KB Output is correct
67 Correct 1085 ms 5268 KB Output is correct
68 Correct 989 ms 5540 KB Output is correct
69 Correct 826 ms 5240 KB Output is correct
70 Correct 1142 ms 5588 KB Output is correct
71 Correct 1147 ms 5484 KB Output is correct
72 Correct 1211 ms 5620 KB Output is correct
73 Correct 996 ms 5256 KB Output is correct
74 Correct 1022 ms 5380 KB Output is correct
75 Correct 1088 ms 5364 KB Output is correct
76 Correct 878 ms 5372 KB Output is correct
77 Correct 867 ms 5336 KB Output is correct
78 Correct 852 ms 5332 KB Output is correct
79 Correct 764 ms 5372 KB Output is correct
80 Correct 742 ms 5464 KB Output is correct
81 Correct 713 ms 5260 KB Output is correct
82 Correct 718 ms 5224 KB Output is correct
83 Correct 715 ms 5180 KB Output is correct
84 Correct 727 ms 5224 KB Output is correct
85 Correct 2301 ms 12032 KB Output is correct
86 Correct 230 ms 10792 KB Output is correct
87 Correct 121 ms 10944 KB Output is correct
88 Correct 1559 ms 11936 KB Output is correct
89 Correct 2224 ms 11768 KB Output is correct
90 Correct 1473 ms 11652 KB Output is correct
91 Correct 1056 ms 7480 KB Output is correct
92 Correct 1057 ms 7536 KB Output is correct
93 Correct 1388 ms 7556 KB Output is correct
94 Correct 1716 ms 9732 KB Output is correct
95 Correct 1770 ms 9752 KB Output is correct
96 Correct 1791 ms 9676 KB Output is correct
97 Correct 1281 ms 11932 KB Output is correct
98 Correct 1366 ms 11216 KB Output is correct
99 Correct 2456 ms 11888 KB Output is correct
100 Correct 2485 ms 13420 KB Output is correct
101 Correct 2412 ms 13428 KB Output is correct
102 Correct 2378 ms 13608 KB Output is correct
103 Correct 2097 ms 11256 KB Output is correct
104 Correct 2023 ms 11336 KB Output is correct
105 Correct 1835 ms 11108 KB Output is correct
106 Correct 1455 ms 10236 KB Output is correct
107 Correct 1628 ms 11436 KB Output is correct
108 Correct 2196 ms 12504 KB Output is correct
109 Correct 1623 ms 9808 KB Output is correct