oj.uz

답안 #639729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639729 2022-09-11T10:33:53 Z KiriLL1ca 다리 (APIO19_bridges) C++14
100 / 100
 2100 ms 15656 KB 
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define pb push_back
#define endl '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }

const int N = 1e5 + 100;
const int buben = 1000;
      
struct dsu {
        vector <int> p, rk;
        vector <array <int, 6>> st;
        dsu () {}
        dsu (int n) : p(n), rk(n, 1), st() { iota(all(p), 0); }
        inline int par (int x) { while (p[x] != x) x = p[x]; return x; }
        inline bool unite (int x, int y) {
                x = par(x), y = par(y);
                if (x == y) return 0;
                if (rk[x] < rk[y]) swap(x, y);
                st.pb({x, y, p[x], p[y], rk[x], rk[y]});
                rk[x] += rk[y]; p[y] = x; return 1;
        }
        inline void rollback () {
                if (!sz(st)) { cout << "ebis"; exit(0); }
                auto [x, y, px, py, rkx, rky] = st.back(); st.pop_back();
                p[x] = px; p[y] = py;
                rk[x] = rkx; rk[y] = rky;
        }
        inline bool same (int x, int y) { return par(x) == par(y); }
        inline int size (int x) { return rk[par(x)]; }
};       

inline void solve () {
        int n, m; cin >> n >> m;
        vector <array <int, 3>> edge (m);
        for (auto &[i, j, k] : edge) cin >> i >> j >> k, --i, --j;
        int q; cin >> q;
        vector <array <int, 3>> qry (q);
        for (auto &[t, i, j] : qry) cin >> t >> i >> j, --i;
        vector <int> ans (q, -1);
        for (int l = 0; l < q; l += buben) {
                int r = min(q, l + buben);
                vector <bool> chg (m);
                vector <array <int, 3>> ask, unchg;
                vector <int> upd;
                
                for (int i = l; i < r; ++i) {
                        if (qry[i][0] == 1) {
                                chg[qry[i][1]] = 1; upd.pb(qry[i][1]);
                        }
                        else {
                                ask.pb({qry[i][2], qry[i][1], i});
                        }
                }
                
                for (int i = 0; i < m; ++i) if (!chg[i]) unchg.pb({edge[i][2], edge[i][0], edge[i][1]});
                vector <vector <array <int, 3>>> add (buben);
                
                for (int i = l; i < r; ++i) {
                        if (qry[i][0] == 1) {
                                edge[qry[i][1]][2] = qry[i][2];
                        }
                        else {
                                for (auto j : upd) if (edge[j][2] >= qry[i][2]) add[i - l].pb(edge[j]);
                        }
                }
                
                sort(rall(ask)); sort(rall(unchg));
                
                int uk = 0;
                dsu D (n);
                for (auto [d, v, id] : ask) {
                        while (uk < sz(unchg) && unchg[uk][0] >= d) {
                                D.unite(unchg[uk][1], unchg[uk][2]);
                                ++uk; 
                        }
                        int cnt = 0;
                        for (auto [u, v, w] : add[id - l]) {
                                cnt += D.unite(u, v); 
                        }
                        ans[id] = D.size(v);
                        while (cnt--) D.rollback();
                }
        }
        for (auto i : ans) if (~i) cout << i << endl;
}

signed main() {
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        int t = 1; // cin >> t;
        while (t--) solve();
        return 0;
}

Compilation message

bridges.cpp: In member function 'void dsu::rollback()':
bridges.cpp:43:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   43 |                 auto [x, y, px, py, rkx, rky] = st.back(); st.pop_back();
      |                      ^
bridges.cpp: In function 'void solve()':
bridges.cpp:54:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |         for (auto &[i, j, k] : edge) cin >> i >> j >> k, --i, --j;
      |                    ^
bridges.cpp:57:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |         for (auto &[t, i, j] : qry) cin >> t >> i >> j, --i;
      |                    ^
bridges.cpp:90:27: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   90 |                 for (auto [d, v, id] : ask) {
      |                           ^
bridges.cpp:96:35: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   96 |                         for (auto [u, v, w] : add[id - l]) {
      |                                   ^

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 39 ms 2760 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 31 ms 3340 KB Output is correct
6 Correct 29 ms 3668 KB Output is correct
7 Correct 29 ms 3884 KB Output is correct
8 Correct 32 ms 2484 KB Output is correct
9 Correct 41 ms 5544 KB Output is correct
10 Correct 35 ms 2804 KB Output is correct
11 Correct 37 ms 2724 KB Output is correct
12 Correct 47 ms 3532 KB Output is correct
13 Correct 41 ms 2968 KB Output is correct
14 Correct 37 ms 2748 KB Output is correct
15 Correct 45 ms 2868 KB Output is correct
16 Correct 41 ms 4504 KB Output is correct
17 Correct 41 ms 3880 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1177 ms 11408 KB Output is correct
2 Correct 1192 ms 11560 KB Output is correct
3 Correct 1203 ms 11452 KB Output is correct
4 Correct 1238 ms 11312 KB Output is correct
5 Correct 1238 ms 11636 KB Output is correct
6 Correct 1724 ms 14060 KB Output is correct
7 Correct 1730 ms 13992 KB Output is correct
8 Correct 1723 ms 14064 KB Output is correct
9 Correct 37 ms 3404 KB Output is correct
10 Correct 1256 ms 11852 KB Output is correct
11 Correct 1309 ms 11276 KB Output is correct
12 Correct 1056 ms 10368 KB Output is correct
13 Correct 1048 ms 10528 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 895 ms 9272 KB Output is correct
2 Correct 629 ms 8108 KB Output is correct
3 Correct 1022 ms 10472 KB Output is correct
4 Correct 868 ms 9172 KB Output is correct
5 Correct 34 ms 3400 KB Output is correct
6 Correct 1031 ms 9700 KB Output is correct
7 Correct 837 ms 8724 KB Output is correct
8 Correct 738 ms 8448 KB Output is correct
9 Correct 637 ms 8020 KB Output is correct
10 Correct 594 ms 7656 KB Output is correct
11 Correct 707 ms 7916 KB Output is correct
12 Correct 590 ms 7624 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1486 ms 11784 KB Output is correct
2 Correct 35 ms 3404 KB Output is correct
3 Correct 153 ms 6232 KB Output is correct
4 Correct 177 ms 6348 KB Output is correct
5 Correct 1744 ms 10240 KB Output is correct
6 Correct 1487 ms 11652 KB Output is correct
7 Correct 1764 ms 10376 KB Output is correct
8 Correct 757 ms 9188 KB Output is correct
9 Correct 775 ms 9224 KB Output is correct
10 Correct 785 ms 9044 KB Output is correct
11 Correct 1161 ms 10444 KB Output is correct
12 Correct 1131 ms 10584 KB Output is correct
13 Correct 1173 ms 10376 KB Output is correct
14 Correct 1728 ms 10144 KB Output is correct
15 Correct 1728 ms 10248 KB Output is correct
16 Correct 1511 ms 11584 KB Output is correct
17 Correct 1527 ms 11652 KB Output is correct
18 Correct 1536 ms 11704 KB Output is correct
19 Correct 1516 ms 11812 KB Output is correct
20 Correct 1285 ms 10600 KB Output is correct
21 Correct 1291 ms 10764 KB Output is correct
22 Correct 1444 ms 11608 KB Output is correct
23 Correct 1411 ms 9624 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1177 ms 11408 KB Output is correct
2 Correct 1192 ms 11560 KB Output is correct
3 Correct 1203 ms 11452 KB Output is correct
4 Correct 1238 ms 11312 KB Output is correct
5 Correct 1238 ms 11636 KB Output is correct
6 Correct 1724 ms 14060 KB Output is correct
7 Correct 1730 ms 13992 KB Output is correct
8 Correct 1723 ms 14064 KB Output is correct
9 Correct 37 ms 3404 KB Output is correct
10 Correct 1256 ms 11852 KB Output is correct
11 Correct 1309 ms 11276 KB Output is correct
12 Correct 1056 ms 10368 KB Output is correct
13 Correct 1048 ms 10528 KB Output is correct
14 Correct 895 ms 9272 KB Output is correct
15 Correct 629 ms 8108 KB Output is correct
16 Correct 1022 ms 10472 KB Output is correct
17 Correct 868 ms 9172 KB Output is correct
18 Correct 34 ms 3400 KB Output is correct
19 Correct 1031 ms 9700 KB Output is correct
20 Correct 837 ms 8724 KB Output is correct
21 Correct 738 ms 8448 KB Output is correct
22 Correct 637 ms 8020 KB Output is correct
23 Correct 594 ms 7656 KB Output is correct
24 Correct 707 ms 7916 KB Output is correct
25 Correct 590 ms 7624 KB Output is correct
26 Correct 1158 ms 11476 KB Output is correct
27 Correct 1408 ms 13248 KB Output is correct
28 Correct 1240 ms 11460 KB Output is correct
29 Correct 974 ms 9948 KB Output is correct
30 Correct 1375 ms 12264 KB Output is correct
31 Correct 1404 ms 12480 KB Output is correct
32 Correct 1398 ms 12256 KB Output is correct
33 Correct 1237 ms 11264 KB Output is correct
34 Correct 1237 ms 11524 KB Output is correct
35 Correct 1245 ms 11384 KB Output is correct
36 Correct 1029 ms 10256 KB Output is correct
37 Correct 1020 ms 10108 KB Output is correct
38 Correct 1006 ms 9980 KB Output is correct
39 Correct 871 ms 9608 KB Output is correct
40 Correct 863 ms 9604 KB Output is correct
41 Correct 918 ms 9664 KB Output is correct
42 Correct 864 ms 9704 KB Output is correct
43 Correct 839 ms 9360 KB Output is correct
44 Correct 823 ms 9480 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 39 ms 2760 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 31 ms 3340 KB Output is correct
6 Correct 29 ms 3668 KB Output is correct
7 Correct 29 ms 3884 KB Output is correct
8 Correct 32 ms 2484 KB Output is correct
9 Correct 41 ms 5544 KB Output is correct
10 Correct 35 ms 2804 KB Output is correct
11 Correct 37 ms 2724 KB Output is correct
12 Correct 47 ms 3532 KB Output is correct
13 Correct 41 ms 2968 KB Output is correct
14 Correct 37 ms 2748 KB Output is correct
15 Correct 45 ms 2868 KB Output is correct
16 Correct 41 ms 4504 KB Output is correct
17 Correct 41 ms 3880 KB Output is correct
18 Correct 1177 ms 11408 KB Output is correct
19 Correct 1192 ms 11560 KB Output is correct
20 Correct 1203 ms 11452 KB Output is correct
21 Correct 1238 ms 11312 KB Output is correct
22 Correct 1238 ms 11636 KB Output is correct
23 Correct 1724 ms 14060 KB Output is correct
24 Correct 1730 ms 13992 KB Output is correct
25 Correct 1723 ms 14064 KB Output is correct
26 Correct 37 ms 3404 KB Output is correct
27 Correct 1256 ms 11852 KB Output is correct
28 Correct 1309 ms 11276 KB Output is correct
29 Correct 1056 ms 10368 KB Output is correct
30 Correct 1048 ms 10528 KB Output is correct
31 Correct 895 ms 9272 KB Output is correct
32 Correct 629 ms 8108 KB Output is correct
33 Correct 1022 ms 10472 KB Output is correct
34 Correct 868 ms 9172 KB Output is correct
35 Correct 34 ms 3400 KB Output is correct
36 Correct 1031 ms 9700 KB Output is correct
37 Correct 837 ms 8724 KB Output is correct
38 Correct 738 ms 8448 KB Output is correct
39 Correct 637 ms 8020 KB Output is correct
40 Correct 594 ms 7656 KB Output is correct
41 Correct 707 ms 7916 KB Output is correct
42 Correct 590 ms 7624 KB Output is correct
43 Correct 1486 ms 11784 KB Output is correct
44 Correct 35 ms 3404 KB Output is correct
45 Correct 153 ms 6232 KB Output is correct
46 Correct 177 ms 6348 KB Output is correct
47 Correct 1744 ms 10240 KB Output is correct
48 Correct 1487 ms 11652 KB Output is correct
49 Correct 1764 ms 10376 KB Output is correct
50 Correct 757 ms 9188 KB Output is correct
51 Correct 775 ms 9224 KB Output is correct
52 Correct 785 ms 9044 KB Output is correct
53 Correct 1161 ms 10444 KB Output is correct
54 Correct 1131 ms 10584 KB Output is correct
55 Correct 1173 ms 10376 KB Output is correct
56 Correct 1728 ms 10144 KB Output is correct
57 Correct 1728 ms 10248 KB Output is correct
58 Correct 1511 ms 11584 KB Output is correct
59 Correct 1527 ms 11652 KB Output is correct
60 Correct 1536 ms 11704 KB Output is correct
61 Correct 1516 ms 11812 KB Output is correct
62 Correct 1285 ms 10600 KB Output is correct
63 Correct 1291 ms 10764 KB Output is correct
64 Correct 1444 ms 11608 KB Output is correct
65 Correct 1411 ms 9624 KB Output is correct
66 Correct 1158 ms 11476 KB Output is correct
67 Correct 1408 ms 13248 KB Output is correct
68 Correct 1240 ms 11460 KB Output is correct
69 Correct 974 ms 9948 KB Output is correct
70 Correct 1375 ms 12264 KB Output is correct
71 Correct 1404 ms 12480 KB Output is correct
72 Correct 1398 ms 12256 KB Output is correct
73 Correct 1237 ms 11264 KB Output is correct
74 Correct 1237 ms 11524 KB Output is correct
75 Correct 1245 ms 11384 KB Output is correct
76 Correct 1029 ms 10256 KB Output is correct
77 Correct 1020 ms 10108 KB Output is correct
78 Correct 1006 ms 9980 KB Output is correct
79 Correct 871 ms 9608 KB Output is correct
80 Correct 863 ms 9604 KB Output is correct
81 Correct 918 ms 9664 KB Output is correct
82 Correct 864 ms 9704 KB Output is correct
83 Correct 839 ms 9360 KB Output is correct
84 Correct 823 ms 9480 KB Output is correct
85 Correct 1833 ms 13760 KB Output is correct
86 Correct 175 ms 8168 KB Output is correct
87 Correct 201 ms 9632 KB Output is correct
88 Correct 2028 ms 13220 KB Output is correct
89 Correct 1822 ms 13720 KB Output is correct
90 Correct 2100 ms 13124 KB Output is correct
91 Correct 1272 ms 11336 KB Output is correct
92 Correct 1262 ms 11460 KB Output is correct
93 Correct 1771 ms 12648 KB Output is correct
94 Correct 1547 ms 12428 KB Output is correct
95 Correct 1579 ms 12964 KB Output is correct
96 Correct 1838 ms 15016 KB Output is correct
97 Correct 1877 ms 11596 KB Output is correct
98 Correct 1870 ms 10884 KB Output is correct
99 Correct 1847 ms 13896 KB Output is correct
100 Correct 1845 ms 13860 KB Output is correct
101 Correct 1869 ms 13832 KB Output is correct
102 Correct 1893 ms 13896 KB Output is correct
103 Correct 2021 ms 15656 KB Output is correct
104 Correct 2009 ms 15556 KB Output is correct
105 Correct 1562 ms 12044 KB Output is correct
106 Correct 1291 ms 11016 KB Output is correct
107 Correct 1521 ms 11744 KB Output is correct
108 Correct 1945 ms 14340 KB Output is correct
109 Correct 1952 ms 12736 KB Output is correct