oj.uz

답안 #722435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722435 2023-04-12T00:38:23 Z GrandTiger1729 다리 (APIO19_bridges) C++17
100 / 100
 2734 ms 9764 KB 
#include <bits/stdc++.h>
using namespace std;

struct DSU {
    vector<int> rt, sz;
    vector<int> stk;
    DSU(int n){
        rt.resize(n);
        iota(rt.begin(), rt.end(), 0);
        sz.resize(n, 1);
    }
    int find(int u){
        if (u == rt[u]) return u;
        return find(rt[u]);
    }
    bool same(int u, int v){
        return find(u) == find(v); 
    }
    void unite(int u, int v){
        u = find(u), v = find(v);
        if (u == v) return;
        if (sz[u] > sz[v])
            swap(u, v);
        rt[u] = v;
        sz[v] += sz[u];
        stk.push_back(u);
    }
    void undo(){
        int u = stk.back(), v = rt[u];
        stk.pop_back();
        sz[v] -= sz[u];
        rt[u] = u;
    }
    void rollback(){
        while (stk.size())
            undo();
    }
    void checkpoint(){
        stk.clear();
    }
    int size(int u){
        return sz[find(u)];
    }
};
struct Edge {
    int u, v, w, id;
    Edge() = default;
    Edge(int _u, int _v, int _w, int _i): u(_u), v(_v), w(_w), id(_i){} 
};
struct Event {
    int i, w, id;
    Event() = default;
    Event(int _i, int _w, int _id): i(_i), w(_w), id(_id){}
};
struct Query {
    int u, w, id;
    Query() = default;
    Query(int _u, int _w, int _i): u(_u), w(_w), id(_i){}
};

const int B = 500;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n, m; cin >> n >> m;
    vector<Edge> ed(m);
    for (int i = 0; i < m; i++){
        int u, v, w; cin >> u >> v >> w;
        u--, v--;
        ed[i] = Edge(u, v, w, i);
    }
    int q; cin >> q;
    vector<int> ans(q);
    for (int qq = 0; qq < q; ){
        int R = min(q, qq + B);
        vector<Event> evnt;
        vector<Query> qry;
        vector<int> vis(m);
        for (; qq < R; qq++){
            int t; cin >> t;
            if (t == 1){
                int i, w; cin >> i >> w;
                i--;
                evnt.emplace_back(i, w, qq);
                vis[i] = 1;
            }else{
                int u, w; cin >> u >> w;
                u--;
                qry.emplace_back(u, w, qq);
            }
        }
        reverse(evnt.begin(), evnt.end());
        vector<Edge> eed;
        for (int i = 0; i < m; i++){
            if (vis[i])
                evnt.emplace_back(i, ed[i].w, -1);
            else
                eed.push_back(ed[i]);
        }
        sort(eed.begin(), eed.end(), [&](auto x, auto y){
            return x.w > y.w;
        });
        sort(qry.begin(), qry.end(), [&](auto x, auto y){
            return x.w > y.w;
        });
        DSU dsu(n);
        int i = 0;
        for (auto &[u, w, id]: qry){
            while (i < eed.size() && eed[i].w >= w){
                dsu.unite(eed[i].u, eed[i].v);
                i++;
            }
            dsu.checkpoint();
            for (auto &[ii, ww, j]: evnt){
                if (j < id){
                    if (vis[ii] != -1 && ww >= w)
                        dsu.unite(ed[ii].u, ed[ii].v);
                    vis[ii] = -1;
                }
            }
            ans[id] = dsu.size(u);
            for (auto &[ii, ww, j]: evnt)
                if (j < id)
                    vis[ii] = 1;
            dsu.rollback();
        }
        reverse(evnt.begin(), evnt.end());
        for (auto [i, w, id]: evnt)
            if (id != -1)
                ed[i].w = w;
    }
    for (auto &x: ans)
        if (x != 0)
            cout << x << '\n';
    return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:108:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |             while (i < eed.size() && eed[i].w >= w){
      |                    ~~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 28 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 19 ms 340 KB Output is correct
6 Correct 18 ms 376 KB Output is correct
7 Correct 19 ms 384 KB Output is correct
8 Correct 19 ms 392 KB Output is correct
9 Correct 22 ms 380 KB Output is correct
10 Correct 19 ms 388 KB Output is correct
11 Correct 18 ms 388 KB Output is correct
12 Correct 19 ms 340 KB Output is correct
13 Correct 24 ms 392 KB Output is correct
14 Correct 22 ms 388 KB Output is correct
15 Correct 22 ms 340 KB Output is correct
16 Correct 21 ms 392 KB Output is correct
17 Correct 20 ms 372 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1544 ms 3840 KB Output is correct
2 Correct 1660 ms 3700 KB Output is correct
3 Correct 1546 ms 3784 KB Output is correct
4 Correct 1592 ms 3576 KB Output is correct
5 Correct 1558 ms 3800 KB Output is correct
6 Correct 1886 ms 3836 KB Output is correct
7 Correct 1947 ms 3692 KB Output is correct
8 Correct 1966 ms 3888 KB Output is correct
9 Correct 33 ms 840 KB Output is correct
10 Correct 1126 ms 3856 KB Output is correct
11 Correct 1069 ms 3836 KB Output is correct
12 Correct 1384 ms 3776 KB Output is correct
13 Correct 1421 ms 3636 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1178 ms 2516 KB Output is correct
2 Correct 614 ms 1148 KB Output is correct
3 Correct 1182 ms 2820 KB Output is correct
4 Correct 1171 ms 2488 KB Output is correct
5 Correct 36 ms 856 KB Output is correct
6 Correct 1162 ms 2412 KB Output is correct
7 Correct 1064 ms 2544 KB Output is correct
8 Correct 997 ms 2556 KB Output is correct
9 Correct 822 ms 2716 KB Output is correct
10 Correct 791 ms 2540 KB Output is correct
11 Correct 862 ms 2404 KB Output is correct
12 Correct 791 ms 2680 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2367 ms 6372 KB Output is correct
2 Correct 41 ms 2252 KB Output is correct
3 Correct 242 ms 7768 KB Output is correct
4 Correct 136 ms 8056 KB Output is correct
5 Correct 1440 ms 8560 KB Output is correct
6 Correct 2341 ms 8524 KB Output is correct
7 Correct 1420 ms 8452 KB Output is correct
8 Correct 1110 ms 5664 KB Output is correct
9 Correct 1107 ms 5748 KB Output is correct
10 Correct 1136 ms 5736 KB Output is correct
11 Correct 1804 ms 7976 KB Output is correct
12 Correct 1791 ms 7700 KB Output is correct
13 Correct 1948 ms 7800 KB Output is correct
14 Correct 1399 ms 8700 KB Output is correct
15 Correct 1449 ms 8628 KB Output is correct
16 Correct 2421 ms 8600 KB Output is correct
17 Correct 2430 ms 8876 KB Output is correct
18 Correct 2390 ms 9764 KB Output is correct
19 Correct 2396 ms 8924 KB Output is correct
20 Correct 2052 ms 7972 KB Output is correct
21 Correct 2012 ms 7752 KB Output is correct
22 Correct 2334 ms 8648 KB Output is correct
23 Correct 1483 ms 7088 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1544 ms 3840 KB Output is correct
2 Correct 1660 ms 3700 KB Output is correct
3 Correct 1546 ms 3784 KB Output is correct
4 Correct 1592 ms 3576 KB Output is correct
5 Correct 1558 ms 3800 KB Output is correct
6 Correct 1886 ms 3836 KB Output is correct
7 Correct 1947 ms 3692 KB Output is correct
8 Correct 1966 ms 3888 KB Output is correct
9 Correct 33 ms 840 KB Output is correct
10 Correct 1126 ms 3856 KB Output is correct
11 Correct 1069 ms 3836 KB Output is correct
12 Correct 1384 ms 3776 KB Output is correct
13 Correct 1421 ms 3636 KB Output is correct
14 Correct 1178 ms 2516 KB Output is correct
15 Correct 614 ms 1148 KB Output is correct
16 Correct 1182 ms 2820 KB Output is correct
17 Correct 1171 ms 2488 KB Output is correct
18 Correct 36 ms 856 KB Output is correct
19 Correct 1162 ms 2412 KB Output is correct
20 Correct 1064 ms 2544 KB Output is correct
21 Correct 997 ms 2556 KB Output is correct
22 Correct 822 ms 2716 KB Output is correct
23 Correct 791 ms 2540 KB Output is correct
24 Correct 862 ms 2404 KB Output is correct
25 Correct 791 ms 2680 KB Output is correct
26 Correct 1616 ms 3672 KB Output is correct
27 Correct 1716 ms 3784 KB Output is correct
28 Correct 1574 ms 3780 KB Output is correct
29 Correct 1395 ms 3744 KB Output is correct
30 Correct 1704 ms 3852 KB Output is correct
31 Correct 1723 ms 3800 KB Output is correct
32 Correct 1686 ms 3892 KB Output is correct
33 Correct 1561 ms 3688 KB Output is correct
34 Correct 1597 ms 3848 KB Output is correct
35 Correct 1566 ms 3836 KB Output is correct
36 Correct 1378 ms 3792 KB Output is correct
37 Correct 1418 ms 3840 KB Output is correct
38 Correct 1378 ms 3816 KB Output is correct
39 Correct 1229 ms 3676 KB Output is correct
40 Correct 1230 ms 3632 KB Output is correct
41 Correct 1245 ms 3692 KB Output is correct
42 Correct 1257 ms 3844 KB Output is correct
43 Correct 1205 ms 3652 KB Output is correct
44 Correct 1187 ms 3720 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 28 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 19 ms 340 KB Output is correct
6 Correct 18 ms 376 KB Output is correct
7 Correct 19 ms 384 KB Output is correct
8 Correct 19 ms 392 KB Output is correct
9 Correct 22 ms 380 KB Output is correct
10 Correct 19 ms 388 KB Output is correct
11 Correct 18 ms 388 KB Output is correct
12 Correct 19 ms 340 KB Output is correct
13 Correct 24 ms 392 KB Output is correct
14 Correct 22 ms 388 KB Output is correct
15 Correct 22 ms 340 KB Output is correct
16 Correct 21 ms 392 KB Output is correct
17 Correct 20 ms 372 KB Output is correct
18 Correct 1544 ms 3840 KB Output is correct
19 Correct 1660 ms 3700 KB Output is correct
20 Correct 1546 ms 3784 KB Output is correct
21 Correct 1592 ms 3576 KB Output is correct
22 Correct 1558 ms 3800 KB Output is correct
23 Correct 1886 ms 3836 KB Output is correct
24 Correct 1947 ms 3692 KB Output is correct
25 Correct 1966 ms 3888 KB Output is correct
26 Correct 33 ms 840 KB Output is correct
27 Correct 1126 ms 3856 KB Output is correct
28 Correct 1069 ms 3836 KB Output is correct
29 Correct 1384 ms 3776 KB Output is correct
30 Correct 1421 ms 3636 KB Output is correct
31 Correct 1178 ms 2516 KB Output is correct
32 Correct 614 ms 1148 KB Output is correct
33 Correct 1182 ms 2820 KB Output is correct
34 Correct 1171 ms 2488 KB Output is correct
35 Correct 36 ms 856 KB Output is correct
36 Correct 1162 ms 2412 KB Output is correct
37 Correct 1064 ms 2544 KB Output is correct
38 Correct 997 ms 2556 KB Output is correct
39 Correct 822 ms 2716 KB Output is correct
40 Correct 791 ms 2540 KB Output is correct
41 Correct 862 ms 2404 KB Output is correct
42 Correct 791 ms 2680 KB Output is correct
43 Correct 2367 ms 6372 KB Output is correct
44 Correct 41 ms 2252 KB Output is correct
45 Correct 242 ms 7768 KB Output is correct
46 Correct 136 ms 8056 KB Output is correct
47 Correct 1440 ms 8560 KB Output is correct
48 Correct 2341 ms 8524 KB Output is correct
49 Correct 1420 ms 8452 KB Output is correct
50 Correct 1110 ms 5664 KB Output is correct
51 Correct 1107 ms 5748 KB Output is correct
52 Correct 1136 ms 5736 KB Output is correct
53 Correct 1804 ms 7976 KB Output is correct
54 Correct 1791 ms 7700 KB Output is correct
55 Correct 1948 ms 7800 KB Output is correct
56 Correct 1399 ms 8700 KB Output is correct
57 Correct 1449 ms 8628 KB Output is correct
58 Correct 2421 ms 8600 KB Output is correct
59 Correct 2430 ms 8876 KB Output is correct
60 Correct 2390 ms 9764 KB Output is correct
61 Correct 2396 ms 8924 KB Output is correct
62 Correct 2052 ms 7972 KB Output is correct
63 Correct 2012 ms 7752 KB Output is correct
64 Correct 2334 ms 8648 KB Output is correct
65 Correct 1483 ms 7088 KB Output is correct
66 Correct 1616 ms 3672 KB Output is correct
67 Correct 1716 ms 3784 KB Output is correct
68 Correct 1574 ms 3780 KB Output is correct
69 Correct 1395 ms 3744 KB Output is correct
70 Correct 1704 ms 3852 KB Output is correct
71 Correct 1723 ms 3800 KB Output is correct
72 Correct 1686 ms 3892 KB Output is correct
73 Correct 1561 ms 3688 KB Output is correct
74 Correct 1597 ms 3848 KB Output is correct
75 Correct 1566 ms 3836 KB Output is correct
76 Correct 1378 ms 3792 KB Output is correct
77 Correct 1418 ms 3840 KB Output is correct
78 Correct 1378 ms 3816 KB Output is correct
79 Correct 1229 ms 3676 KB Output is correct
80 Correct 1230 ms 3632 KB Output is correct
81 Correct 1245 ms 3692 KB Output is correct
82 Correct 1257 ms 3844 KB Output is correct
83 Correct 1205 ms 3652 KB Output is correct
84 Correct 1187 ms 3720 KB Output is correct
85 Correct 2692 ms 8832 KB Output is correct
86 Correct 270 ms 7484 KB Output is correct
87 Correct 156 ms 7512 KB Output is correct
88 Correct 1763 ms 8596 KB Output is correct
89 Correct 2701 ms 8624 KB Output is correct
90 Correct 1707 ms 8492 KB Output is correct
91 Correct 1558 ms 5668 KB Output is correct
92 Correct 1545 ms 5616 KB Output is correct
93 Correct 1873 ms 5812 KB Output is correct
94 Correct 2180 ms 7896 KB Output is correct
95 Correct 2156 ms 7844 KB Output is correct
96 Correct 2241 ms 8020 KB Output is correct
97 Correct 1535 ms 8468 KB Output is correct
98 Correct 1566 ms 8416 KB Output is correct
99 Correct 2705 ms 8860 KB Output is correct
100 Correct 2722 ms 8752 KB Output is correct
101 Correct 2734 ms 8448 KB Output is correct
102 Correct 2687 ms 8428 KB Output is correct
103 Correct 2527 ms 7844 KB Output is correct
104 Correct 2507 ms 7908 KB Output is correct
105 Correct 2223 ms 7976 KB Output is correct
106 Correct 1886 ms 7344 KB Output is correct
107 Correct 2172 ms 7884 KB Output is correct
108 Correct 2633 ms 8276 KB Output is correct
109 Correct 1801 ms 7796 KB Output is correct