oj.uz

답안 #639731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639731 2022-09-11T10:37:23 Z KiriLL1ca 다리 (APIO19_bridges) C++14
100 / 100
 2523 ms 9992 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 = 800;
      
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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 29 ms 1940 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 27 ms 2164 KB Output is correct
6 Correct 26 ms 2004 KB Output is correct
7 Correct 23 ms 1984 KB Output is correct
8 Correct 37 ms 1840 KB Output is correct
9 Correct 37 ms 2996 KB Output is correct
10 Correct 39 ms 2036 KB Output is correct
11 Correct 30 ms 2004 KB Output is correct
12 Correct 44 ms 2388 KB Output is correct
13 Correct 34 ms 2036 KB Output is correct
14 Correct 31 ms 1916 KB Output is correct
15 Correct 37 ms 2044 KB Output is correct
16 Correct 34 ms 2444 KB Output is correct
17 Correct 35 ms 2452 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1350 ms 7912 KB Output is correct
2 Correct 1363 ms 7992 KB Output is correct
3 Correct 1354 ms 8012 KB Output is correct
4 Correct 1455 ms 7976 KB Output is correct
5 Correct 1385 ms 7900 KB Output is correct
6 Correct 1800 ms 8800 KB Output is correct
7 Correct 1787 ms 8856 KB Output is correct
8 Correct 1787 ms 8900 KB Output is correct
9 Correct 36 ms 2132 KB Output is correct
10 Correct 1356 ms 8212 KB Output is correct
11 Correct 1417 ms 8392 KB Output is correct
12 Correct 1186 ms 7580 KB Output is correct
13 Correct 1202 ms 7560 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 942 ms 6036 KB Output is correct
2 Correct 597 ms 4588 KB Output is correct
3 Correct 1038 ms 6612 KB Output is correct
4 Correct 929 ms 6020 KB Output is correct
5 Correct 34 ms 1996 KB Output is correct
6 Correct 1083 ms 6556 KB Output is correct
7 Correct 882 ms 6036 KB Output is correct
8 Correct 812 ms 5476 KB Output is correct
9 Correct 723 ms 5340 KB Output is correct
10 Correct 702 ms 5156 KB Output is correct
11 Correct 776 ms 5464 KB Output is correct
12 Correct 732 ms 5072 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1985 ms 7848 KB Output is correct
2 Correct 35 ms 2056 KB Output is correct
3 Correct 215 ms 4436 KB Output is correct
4 Correct 225 ms 4436 KB Output is correct
5 Correct 2305 ms 7828 KB Output is correct
6 Correct 2033 ms 7876 KB Output is correct
7 Correct 2313 ms 7896 KB Output is correct
8 Correct 1016 ms 6408 KB Output is correct
9 Correct 1125 ms 6460 KB Output is correct
10 Correct 1183 ms 6412 KB Output is correct
11 Correct 1510 ms 7188 KB Output is correct
12 Correct 1509 ms 7272 KB Output is correct
13 Correct 1577 ms 7356 KB Output is correct
14 Correct 2259 ms 7864 KB Output is correct
15 Correct 2278 ms 7876 KB Output is correct
16 Correct 1956 ms 7816 KB Output is correct
17 Correct 2001 ms 7844 KB Output is correct
18 Correct 2041 ms 7796 KB Output is correct
19 Correct 2015 ms 7840 KB Output is correct
20 Correct 1695 ms 7492 KB Output is correct
21 Correct 1667 ms 7580 KB Output is correct
22 Correct 1863 ms 7868 KB Output is correct
23 Correct 1924 ms 7320 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1350 ms 7912 KB Output is correct
2 Correct 1363 ms 7992 KB Output is correct
3 Correct 1354 ms 8012 KB Output is correct
4 Correct 1455 ms 7976 KB Output is correct
5 Correct 1385 ms 7900 KB Output is correct
6 Correct 1800 ms 8800 KB Output is correct
7 Correct 1787 ms 8856 KB Output is correct
8 Correct 1787 ms 8900 KB Output is correct
9 Correct 36 ms 2132 KB Output is correct
10 Correct 1356 ms 8212 KB Output is correct
11 Correct 1417 ms 8392 KB Output is correct
12 Correct 1186 ms 7580 KB Output is correct
13 Correct 1202 ms 7560 KB Output is correct
14 Correct 942 ms 6036 KB Output is correct
15 Correct 597 ms 4588 KB Output is correct
16 Correct 1038 ms 6612 KB Output is correct
17 Correct 929 ms 6020 KB Output is correct
18 Correct 34 ms 1996 KB Output is correct
19 Correct 1083 ms 6556 KB Output is correct
20 Correct 882 ms 6036 KB Output is correct
21 Correct 812 ms 5476 KB Output is correct
22 Correct 723 ms 5340 KB Output is correct
23 Correct 702 ms 5156 KB Output is correct
24 Correct 776 ms 5464 KB Output is correct
25 Correct 732 ms 5072 KB Output is correct
26 Correct 1314 ms 7844 KB Output is correct
27 Correct 1508 ms 8524 KB Output is correct
28 Correct 1400 ms 7892 KB Output is correct
29 Correct 1167 ms 6872 KB Output is correct
30 Correct 1515 ms 8236 KB Output is correct
31 Correct 1532 ms 8476 KB Output is correct
32 Correct 1535 ms 8316 KB Output is correct
33 Correct 1427 ms 7996 KB Output is correct
34 Correct 1360 ms 7932 KB Output is correct
35 Correct 1389 ms 7956 KB Output is correct
36 Correct 1190 ms 7072 KB Output is correct
37 Correct 1330 ms 7180 KB Output is correct
38 Correct 1219 ms 7144 KB Output is correct
39 Correct 1155 ms 6844 KB Output is correct
40 Correct 1165 ms 6796 KB Output is correct
41 Correct 1094 ms 6664 KB Output is correct
42 Correct 1055 ms 6700 KB Output is correct
43 Correct 1035 ms 6556 KB Output is correct
44 Correct 1051 ms 6764 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 29 ms 1940 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 27 ms 2164 KB Output is correct
6 Correct 26 ms 2004 KB Output is correct
7 Correct 23 ms 1984 KB Output is correct
8 Correct 37 ms 1840 KB Output is correct
9 Correct 37 ms 2996 KB Output is correct
10 Correct 39 ms 2036 KB Output is correct
11 Correct 30 ms 2004 KB Output is correct
12 Correct 44 ms 2388 KB Output is correct
13 Correct 34 ms 2036 KB Output is correct
14 Correct 31 ms 1916 KB Output is correct
15 Correct 37 ms 2044 KB Output is correct
16 Correct 34 ms 2444 KB Output is correct
17 Correct 35 ms 2452 KB Output is correct
18 Correct 1350 ms 7912 KB Output is correct
19 Correct 1363 ms 7992 KB Output is correct
20 Correct 1354 ms 8012 KB Output is correct
21 Correct 1455 ms 7976 KB Output is correct
22 Correct 1385 ms 7900 KB Output is correct
23 Correct 1800 ms 8800 KB Output is correct
24 Correct 1787 ms 8856 KB Output is correct
25 Correct 1787 ms 8900 KB Output is correct
26 Correct 36 ms 2132 KB Output is correct
27 Correct 1356 ms 8212 KB Output is correct
28 Correct 1417 ms 8392 KB Output is correct
29 Correct 1186 ms 7580 KB Output is correct
30 Correct 1202 ms 7560 KB Output is correct
31 Correct 942 ms 6036 KB Output is correct
32 Correct 597 ms 4588 KB Output is correct
33 Correct 1038 ms 6612 KB Output is correct
34 Correct 929 ms 6020 KB Output is correct
35 Correct 34 ms 1996 KB Output is correct
36 Correct 1083 ms 6556 KB Output is correct
37 Correct 882 ms 6036 KB Output is correct
38 Correct 812 ms 5476 KB Output is correct
39 Correct 723 ms 5340 KB Output is correct
40 Correct 702 ms 5156 KB Output is correct
41 Correct 776 ms 5464 KB Output is correct
42 Correct 732 ms 5072 KB Output is correct
43 Correct 1985 ms 7848 KB Output is correct
44 Correct 35 ms 2056 KB Output is correct
45 Correct 215 ms 4436 KB Output is correct
46 Correct 225 ms 4436 KB Output is correct
47 Correct 2305 ms 7828 KB Output is correct
48 Correct 2033 ms 7876 KB Output is correct
49 Correct 2313 ms 7896 KB Output is correct
50 Correct 1016 ms 6408 KB Output is correct
51 Correct 1125 ms 6460 KB Output is correct
52 Correct 1183 ms 6412 KB Output is correct
53 Correct 1510 ms 7188 KB Output is correct
54 Correct 1509 ms 7272 KB Output is correct
55 Correct 1577 ms 7356 KB Output is correct
56 Correct 2259 ms 7864 KB Output is correct
57 Correct 2278 ms 7876 KB Output is correct
58 Correct 1956 ms 7816 KB Output is correct
59 Correct 2001 ms 7844 KB Output is correct
60 Correct 2041 ms 7796 KB Output is correct
61 Correct 2015 ms 7840 KB Output is correct
62 Correct 1695 ms 7492 KB Output is correct
63 Correct 1667 ms 7580 KB Output is correct
64 Correct 1863 ms 7868 KB Output is correct
65 Correct 1924 ms 7320 KB Output is correct
66 Correct 1314 ms 7844 KB Output is correct
67 Correct 1508 ms 8524 KB Output is correct
68 Correct 1400 ms 7892 KB Output is correct
69 Correct 1167 ms 6872 KB Output is correct
70 Correct 1515 ms 8236 KB Output is correct
71 Correct 1532 ms 8476 KB Output is correct
72 Correct 1535 ms 8316 KB Output is correct
73 Correct 1427 ms 7996 KB Output is correct
74 Correct 1360 ms 7932 KB Output is correct
75 Correct 1389 ms 7956 KB Output is correct
76 Correct 1190 ms 7072 KB Output is correct
77 Correct 1330 ms 7180 KB Output is correct
78 Correct 1219 ms 7144 KB Output is correct
79 Correct 1155 ms 6844 KB Output is correct
80 Correct 1165 ms 6796 KB Output is correct
81 Correct 1094 ms 6664 KB Output is correct
82 Correct 1055 ms 6700 KB Output is correct
83 Correct 1035 ms 6556 KB Output is correct
84 Correct 1051 ms 6764 KB Output is correct
85 Correct 2256 ms 9100 KB Output is correct
86 Correct 211 ms 5236 KB Output is correct
87 Correct 253 ms 5528 KB Output is correct
88 Correct 2523 ms 9516 KB Output is correct
89 Correct 2213 ms 9160 KB Output is correct
90 Correct 2445 ms 9424 KB Output is correct
91 Correct 1381 ms 8060 KB Output is correct
92 Correct 1342 ms 7856 KB Output is correct
93 Correct 1788 ms 8912 KB Output is correct
94 Correct 1778 ms 8760 KB Output is correct
95 Correct 1797 ms 8668 KB Output is correct
96 Correct 1993 ms 9648 KB Output is correct
97 Correct 2300 ms 8604 KB Output is correct
98 Correct 2292 ms 8368 KB Output is correct
99 Correct 2153 ms 9444 KB Output is correct
100 Correct 2189 ms 9132 KB Output is correct
101 Correct 2227 ms 9172 KB Output is correct
102 Correct 2200 ms 9304 KB Output is correct
103 Correct 2217 ms 9920 KB Output is correct
104 Correct 2184 ms 9992 KB Output is correct
105 Correct 1830 ms 8332 KB Output is correct
106 Correct 1557 ms 7640 KB Output is correct
107 Correct 1734 ms 8160 KB Output is correct
108 Correct 2239 ms 9924 KB Output is correct
109 Correct 2169 ms 9612 KB Output is correct