oj.uz

Submission #722495

# Submission time Handle Problem Language Result Execution time Memory
722495 2023-04-12T07:06:27 Z GrandTiger1729 Bridges (APIO19_bridges) C++17
100 / 100
 2079 ms 6696 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 = 900;
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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 40 ms 420 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 22 ms 340 KB Output is correct
6 Correct 21 ms 404 KB Output is correct
7 Correct 24 ms 340 KB Output is correct
8 Correct 23 ms 400 KB Output is correct
9 Correct 25 ms 340 KB Output is correct
10 Correct 23 ms 340 KB Output is correct
11 Correct 24 ms 400 KB Output is correct
12 Correct 25 ms 340 KB Output is correct
13 Correct 29 ms 340 KB Output is correct
14 Correct 29 ms 388 KB Output is correct
15 Correct 26 ms 392 KB Output is correct
16 Correct 24 ms 388 KB Output is correct
17 Correct 25 ms 340 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1348 ms 3804 KB Output is correct
2 Correct 1383 ms 3516 KB Output is correct
3 Correct 1373 ms 3804 KB Output is correct
4 Correct 1423 ms 3712 KB Output is correct
5 Correct 1420 ms 3936 KB Output is correct
6 Correct 2015 ms 3628 KB Output is correct
7 Correct 2007 ms 3616 KB Output is correct
8 Correct 2008 ms 3716 KB Output is correct
9 Correct 29 ms 844 KB Output is correct
10 Correct 1254 ms 3760 KB Output is correct
11 Correct 1183 ms 3604 KB Output is correct
12 Correct 1113 ms 3636 KB Output is correct
13 Correct 1144 ms 3676 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1125 ms 2776 KB Output is correct
2 Correct 867 ms 1228 KB Output is correct
3 Correct 1276 ms 2596 KB Output is correct
4 Correct 1103 ms 2580 KB Output is correct
5 Correct 30 ms 980 KB Output is correct
6 Correct 1225 ms 2648 KB Output is correct
7 Correct 1046 ms 2548 KB Output is correct
8 Correct 960 ms 2424 KB Output is correct
9 Correct 667 ms 2412 KB Output is correct
10 Correct 615 ms 2624 KB Output is correct
11 Correct 713 ms 2664 KB Output is correct
12 Correct 638 ms 2408 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1372 ms 6404 KB Output is correct
2 Correct 28 ms 844 KB Output is correct
3 Correct 152 ms 5964 KB Output is correct
4 Correct 87 ms 5976 KB Output is correct
5 Correct 842 ms 6528 KB Output is correct
6 Correct 1321 ms 6404 KB Output is correct
7 Correct 818 ms 6316 KB Output is correct
8 Correct 639 ms 3528 KB Output is correct
9 Correct 621 ms 3704 KB Output is correct
10 Correct 640 ms 3680 KB Output is correct
11 Correct 1028 ms 5596 KB Output is correct
12 Correct 1014 ms 5608 KB Output is correct
13 Correct 1036 ms 5656 KB Output is correct
14 Correct 769 ms 6420 KB Output is correct
15 Correct 790 ms 6400 KB Output is correct
16 Correct 1339 ms 6616 KB Output is correct
17 Correct 1381 ms 6396 KB Output is correct
18 Correct 1362 ms 6644 KB Output is correct
19 Correct 1375 ms 6584 KB Output is correct
20 Correct 1141 ms 5932 KB Output is correct
21 Correct 1130 ms 5892 KB Output is correct
22 Correct 1323 ms 6244 KB Output is correct
23 Correct 816 ms 5892 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1348 ms 3804 KB Output is correct
2 Correct 1383 ms 3516 KB Output is correct
3 Correct 1373 ms 3804 KB Output is correct
4 Correct 1423 ms 3712 KB Output is correct
5 Correct 1420 ms 3936 KB Output is correct
6 Correct 2015 ms 3628 KB Output is correct
7 Correct 2007 ms 3616 KB Output is correct
8 Correct 2008 ms 3716 KB Output is correct
9 Correct 29 ms 844 KB Output is correct
10 Correct 1254 ms 3760 KB Output is correct
11 Correct 1183 ms 3604 KB Output is correct
12 Correct 1113 ms 3636 KB Output is correct
13 Correct 1144 ms 3676 KB Output is correct
14 Correct 1125 ms 2776 KB Output is correct
15 Correct 867 ms 1228 KB Output is correct
16 Correct 1276 ms 2596 KB Output is correct
17 Correct 1103 ms 2580 KB Output is correct
18 Correct 30 ms 980 KB Output is correct
19 Correct 1225 ms 2648 KB Output is correct
20 Correct 1046 ms 2548 KB Output is correct
21 Correct 960 ms 2424 KB Output is correct
22 Correct 667 ms 2412 KB Output is correct
23 Correct 615 ms 2624 KB Output is correct
24 Correct 713 ms 2664 KB Output is correct
25 Correct 638 ms 2408 KB Output is correct
26 Correct 1430 ms 3632 KB Output is correct
27 Correct 1670 ms 3800 KB Output is correct
28 Correct 1427 ms 3752 KB Output is correct
29 Correct 1106 ms 3616 KB Output is correct
30 Correct 1657 ms 3756 KB Output is correct
31 Correct 1675 ms 3568 KB Output is correct
32 Correct 1695 ms 3756 KB Output is correct
33 Correct 1391 ms 3896 KB Output is correct
34 Correct 1410 ms 3852 KB Output is correct
35 Correct 1425 ms 3816 KB Output is correct
36 Correct 1141 ms 3592 KB Output is correct
37 Correct 1137 ms 3680 KB Output is correct
38 Correct 1134 ms 3744 KB Output is correct
39 Correct 796 ms 3700 KB Output is correct
40 Correct 808 ms 3604 KB Output is correct
41 Correct 814 ms 3708 KB Output is correct
42 Correct 822 ms 3708 KB Output is correct
43 Correct 818 ms 3648 KB Output is correct
44 Correct 799 ms 3632 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 40 ms 420 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 22 ms 340 KB Output is correct
6 Correct 21 ms 404 KB Output is correct
7 Correct 24 ms 340 KB Output is correct
8 Correct 23 ms 400 KB Output is correct
9 Correct 25 ms 340 KB Output is correct
10 Correct 23 ms 340 KB Output is correct
11 Correct 24 ms 400 KB Output is correct
12 Correct 25 ms 340 KB Output is correct
13 Correct 29 ms 340 KB Output is correct
14 Correct 29 ms 388 KB Output is correct
15 Correct 26 ms 392 KB Output is correct
16 Correct 24 ms 388 KB Output is correct
17 Correct 25 ms 340 KB Output is correct
18 Correct 1348 ms 3804 KB Output is correct
19 Correct 1383 ms 3516 KB Output is correct
20 Correct 1373 ms 3804 KB Output is correct
21 Correct 1423 ms 3712 KB Output is correct
22 Correct 1420 ms 3936 KB Output is correct
23 Correct 2015 ms 3628 KB Output is correct
24 Correct 2007 ms 3616 KB Output is correct
25 Correct 2008 ms 3716 KB Output is correct
26 Correct 29 ms 844 KB Output is correct
27 Correct 1254 ms 3760 KB Output is correct
28 Correct 1183 ms 3604 KB Output is correct
29 Correct 1113 ms 3636 KB Output is correct
30 Correct 1144 ms 3676 KB Output is correct
31 Correct 1125 ms 2776 KB Output is correct
32 Correct 867 ms 1228 KB Output is correct
33 Correct 1276 ms 2596 KB Output is correct
34 Correct 1103 ms 2580 KB Output is correct
35 Correct 30 ms 980 KB Output is correct
36 Correct 1225 ms 2648 KB Output is correct
37 Correct 1046 ms 2548 KB Output is correct
38 Correct 960 ms 2424 KB Output is correct
39 Correct 667 ms 2412 KB Output is correct
40 Correct 615 ms 2624 KB Output is correct
41 Correct 713 ms 2664 KB Output is correct
42 Correct 638 ms 2408 KB Output is correct
43 Correct 1372 ms 6404 KB Output is correct
44 Correct 28 ms 844 KB Output is correct
45 Correct 152 ms 5964 KB Output is correct
46 Correct 87 ms 5976 KB Output is correct
47 Correct 842 ms 6528 KB Output is correct
48 Correct 1321 ms 6404 KB Output is correct
49 Correct 818 ms 6316 KB Output is correct
50 Correct 639 ms 3528 KB Output is correct
51 Correct 621 ms 3704 KB Output is correct
52 Correct 640 ms 3680 KB Output is correct
53 Correct 1028 ms 5596 KB Output is correct
54 Correct 1014 ms 5608 KB Output is correct
55 Correct 1036 ms 5656 KB Output is correct
56 Correct 769 ms 6420 KB Output is correct
57 Correct 790 ms 6400 KB Output is correct
58 Correct 1339 ms 6616 KB Output is correct
59 Correct 1381 ms 6396 KB Output is correct
60 Correct 1362 ms 6644 KB Output is correct
61 Correct 1375 ms 6584 KB Output is correct
62 Correct 1141 ms 5932 KB Output is correct
63 Correct 1130 ms 5892 KB Output is correct
64 Correct 1323 ms 6244 KB Output is correct
65 Correct 816 ms 5892 KB Output is correct
66 Correct 1430 ms 3632 KB Output is correct
67 Correct 1670 ms 3800 KB Output is correct
68 Correct 1427 ms 3752 KB Output is correct
69 Correct 1106 ms 3616 KB Output is correct
70 Correct 1657 ms 3756 KB Output is correct
71 Correct 1675 ms 3568 KB Output is correct
72 Correct 1695 ms 3756 KB Output is correct
73 Correct 1391 ms 3896 KB Output is correct
74 Correct 1410 ms 3852 KB Output is correct
75 Correct 1425 ms 3816 KB Output is correct
76 Correct 1141 ms 3592 KB Output is correct
77 Correct 1137 ms 3680 KB Output is correct
78 Correct 1134 ms 3744 KB Output is correct
79 Correct 796 ms 3700 KB Output is correct
80 Correct 808 ms 3604 KB Output is correct
81 Correct 814 ms 3708 KB Output is correct
82 Correct 822 ms 3708 KB Output is correct
83 Correct 818 ms 3648 KB Output is correct
84 Correct 799 ms 3632 KB Output is correct
85 Correct 1953 ms 6696 KB Output is correct
86 Correct 202 ms 5952 KB Output is correct
87 Correct 137 ms 5900 KB Output is correct
88 Correct 1409 ms 6560 KB Output is correct
89 Correct 1950 ms 6476 KB Output is correct
90 Correct 1422 ms 6460 KB Output is correct
91 Correct 1492 ms 3708 KB Output is correct
92 Correct 1498 ms 3692 KB Output is correct
93 Correct 2073 ms 3748 KB Output is correct
94 Correct 1769 ms 5540 KB Output is correct
95 Correct 1767 ms 5708 KB Output is correct
96 Correct 1934 ms 5564 KB Output is correct
97 Correct 994 ms 6624 KB Output is correct
98 Correct 1072 ms 6416 KB Output is correct
99 Correct 1997 ms 6528 KB Output is correct
100 Correct 1987 ms 6272 KB Output is correct
101 Correct 2053 ms 6428 KB Output is correct
102 Correct 1996 ms 6312 KB Output is correct
103 Correct 2079 ms 5852 KB Output is correct
104 Correct 2064 ms 5908 KB Output is correct
105 Correct 1532 ms 5752 KB Output is correct
106 Correct 1211 ms 5484 KB Output is correct
107 Correct 1419 ms 5952 KB Output is correct
108 Correct 1972 ms 6368 KB Output is correct
109 Correct 1496 ms 5792 KB Output is correct