oj.uz

Submission #683490

# Submission time Handle Problem Language Result Execution time Memory
683490 2023-01-18T14:57:19 Z Nursik Bridges (APIO19_bridges) C++14
100 / 100
 2013 ms 12328 KB 
#include <stdio.h>
 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;
 
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ld long double
#define bug cout << "bug\n";

const int maxn = 1e5 + 1, maxm = 5e4 + 1;
const int mod = 1e9 + 7, inf = 1e9, block = 800, hb = 126067, base = 1000050017;
const ll biginf = 5e18;
const ld eps = 1e-15;
using namespace std;

int n, m, q;
int u[maxn], v[maxn], d[maxn], used[maxn], ans[maxn];
int t[maxn];
int x[maxn], y[maxn];
vector<int> add[block + block];
struct dsu{
    int p[maxm], sz[maxm];
    stack<pair<int, int>> st;
    void init(){
        for (int i = 1; i <= n; ++i){
            p[i] = i, sz[i] = 1;
        }
        while (st.size() > 0){
            st.pop();
        }
    }
    int get(int v){
        if (v == p[v])
            return v;
        return get(p[v]);
    }
    void unite(int a, int b){
        a = get(a), b = get(b);
        if (a == b)
            return;
        if (sz[a] > sz[b])
            swap(a, b);
        p[a] = b;
        sz[b] += sz[a];
        st.push(mp(a, sz[a]));
    }
    void rollback(int y){
        while (st.size() != y){
            pair<int, int> cur = st.top();
            int r = p[cur.f];
            sz[r] -= cur.s;
            p[cur.f] = cur.f;
            st.pop();
        }
    }
} rt;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; ++i){
        cin >> u[i] >> v[i] >> d[i];
    }
    cin >> q;
    for (int i = 1; i <= q; ++i){
        cin >> t[i];
        if (t[i] == 1){
            cin >> x[i] >> y[i];
        }
        else{
            cin >> x[i] >> y[i];
        }
    }
    for (int i = 1; i <= q; i += block){
        rt.init();
        int l = i, r = min(q, i + block - 1);
        vector<int> changed;
        vector<pair<int, int>> unchanged;
        vector<pair<int, int>> ask;
        for (int j = l; j <= r; ++j){
            if (t[j] == 1){
                used[x[j]] = 1;
                changed.pb(x[j]);
            }
            else{
                ask.pb(mp(y[j], j));
            }
        }
        for (int j = l; j <= r; ++j){
            if (t[j] == 1){
                d[x[j]] = y[j];
            }
            else{
                add[j - l].clear();
                for (auto it : changed){
                    if (d[it] >= y[j]){
                        add[j - l].pb(it);
                    }
                }
            }
        }
        for (int j = 1; j <= m; ++j){
            if (used[j] == 0){
                unchanged.pb(mp(d[j], j));
            }
            used[j] = 0;
        }
        sort(ask.begin(), ask.end());
        sort(unchanged.begin(), unchanged.end());
        int uk = (int)unchanged.size() - 1;
        for (int j = (int)ask.size() - 1; j >= 0; --j){
            while (uk >= 0 && unchanged[uk].f >= ask[j].f){
                int z = unchanged[uk].s;
                rt.unite(u[z], v[z]);
                uk -= 1;
            }
            int cur = (int)rt.st.size();
            int pos = ask[j].s;
            for (auto it : add[pos - l]){
                rt.unite(u[it], v[it]);
            }
            ans[pos] = rt.sz[rt.get(x[pos])];
            rt.rollback(cur);
        }
    }
    for (int i = 1; i <= q; ++i){
        if (t[i] == 2){
            cout << ans[i] << '\n';
        }
    }
}
/*
 */

Compilation message

bridges.cpp: In member function 'void dsu::rollback(int)':
bridges.cpp:76:26: warning: comparison of integer expressions of different signedness: 'std::stack<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |         while (st.size() != y){
      |                ~~~~~~~~~~^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 23 ms 2228 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 22 ms 2292 KB Output is correct
6 Correct 16 ms 2240 KB Output is correct
7 Correct 21 ms 2356 KB Output is correct
8 Correct 27 ms 2372 KB Output is correct
9 Correct 24 ms 2252 KB Output is correct
10 Correct 26 ms 2384 KB Output is correct
11 Correct 27 ms 2308 KB Output is correct
12 Correct 36 ms 2300 KB Output is correct
13 Correct 30 ms 2428 KB Output is correct
14 Correct 28 ms 2380 KB Output is correct
15 Correct 30 ms 2384 KB Output is correct
16 Correct 23 ms 2260 KB Output is correct
17 Correct 25 ms 2280 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1269 ms 6064 KB Output is correct
2 Correct 1247 ms 8796 KB Output is correct
3 Correct 1243 ms 8824 KB Output is correct
4 Correct 1298 ms 8796 KB Output is correct
5 Correct 1283 ms 8864 KB Output is correct
6 Correct 1708 ms 8724 KB Output is correct
7 Correct 1701 ms 8592 KB Output is correct
8 Correct 1727 ms 8492 KB Output is correct
9 Correct 32 ms 3404 KB Output is correct
10 Correct 1176 ms 8064 KB Output is correct
11 Correct 1152 ms 7640 KB Output is correct
12 Correct 1107 ms 7560 KB Output is correct
13 Correct 1124 ms 10152 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 959 ms 5168 KB Output is correct
2 Correct 606 ms 5632 KB Output is correct
3 Correct 1094 ms 7308 KB Output is correct
4 Correct 949 ms 7564 KB Output is correct
5 Correct 33 ms 3464 KB Output is correct
6 Correct 1066 ms 7468 KB Output is correct
7 Correct 869 ms 7404 KB Output is correct
8 Correct 805 ms 7708 KB Output is correct
9 Correct 670 ms 6368 KB Output is correct
10 Correct 611 ms 6432 KB Output is correct
11 Correct 712 ms 9108 KB Output is correct
12 Correct 634 ms 8940 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1643 ms 6380 KB Output is correct
2 Correct 31 ms 2020 KB Output is correct
3 Correct 172 ms 3904 KB Output is correct
4 Correct 154 ms 3904 KB Output is correct
5 Correct 1565 ms 6564 KB Output is correct
6 Correct 1607 ms 6356 KB Output is correct
7 Correct 1574 ms 6452 KB Output is correct
8 Correct 823 ms 4316 KB Output is correct
9 Correct 841 ms 4288 KB Output is correct
10 Correct 839 ms 4456 KB Output is correct
11 Correct 1248 ms 5572 KB Output is correct
12 Correct 1261 ms 5640 KB Output is correct
13 Correct 1314 ms 5984 KB Output is correct
14 Correct 1398 ms 6704 KB Output is correct
15 Correct 1557 ms 6456 KB Output is correct
16 Correct 1658 ms 6380 KB Output is correct
17 Correct 1657 ms 6404 KB Output is correct
18 Correct 1653 ms 6340 KB Output is correct
19 Correct 1615 ms 6324 KB Output is correct
20 Correct 1383 ms 6228 KB Output is correct
21 Correct 1394 ms 6184 KB Output is correct
22 Correct 1580 ms 6348 KB Output is correct
23 Correct 1503 ms 6104 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1269 ms 6064 KB Output is correct
2 Correct 1247 ms 8796 KB Output is correct
3 Correct 1243 ms 8824 KB Output is correct
4 Correct 1298 ms 8796 KB Output is correct
5 Correct 1283 ms 8864 KB Output is correct
6 Correct 1708 ms 8724 KB Output is correct
7 Correct 1701 ms 8592 KB Output is correct
8 Correct 1727 ms 8492 KB Output is correct
9 Correct 32 ms 3404 KB Output is correct
10 Correct 1176 ms 8064 KB Output is correct
11 Correct 1152 ms 7640 KB Output is correct
12 Correct 1107 ms 7560 KB Output is correct
13 Correct 1124 ms 10152 KB Output is correct
14 Correct 959 ms 5168 KB Output is correct
15 Correct 606 ms 5632 KB Output is correct
16 Correct 1094 ms 7308 KB Output is correct
17 Correct 949 ms 7564 KB Output is correct
18 Correct 33 ms 3464 KB Output is correct
19 Correct 1066 ms 7468 KB Output is correct
20 Correct 869 ms 7404 KB Output is correct
21 Correct 805 ms 7708 KB Output is correct
22 Correct 670 ms 6368 KB Output is correct
23 Correct 611 ms 6432 KB Output is correct
24 Correct 712 ms 9108 KB Output is correct
25 Correct 634 ms 8940 KB Output is correct
26 Correct 1334 ms 8916 KB Output is correct
27 Correct 1522 ms 8484 KB Output is correct
28 Correct 1339 ms 8952 KB Output is correct
29 Correct 1004 ms 9116 KB Output is correct
30 Correct 1462 ms 8740 KB Output is correct
31 Correct 1533 ms 8700 KB Output is correct
32 Correct 1506 ms 8944 KB Output is correct
33 Correct 1299 ms 9012 KB Output is correct
34 Correct 1288 ms 8872 KB Output is correct
35 Correct 1321 ms 8860 KB Output is correct
36 Correct 1038 ms 9132 KB Output is correct
37 Correct 1050 ms 9096 KB Output is correct
38 Correct 1039 ms 9112 KB Output is correct
39 Correct 931 ms 7716 KB Output is correct
40 Correct 932 ms 7812 KB Output is correct
41 Correct 907 ms 7752 KB Output is correct
42 Correct 888 ms 9920 KB Output is correct
43 Correct 891 ms 9684 KB Output is correct
44 Correct 854 ms 9808 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 23 ms 2228 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 22 ms 2292 KB Output is correct
6 Correct 16 ms 2240 KB Output is correct
7 Correct 21 ms 2356 KB Output is correct
8 Correct 27 ms 2372 KB Output is correct
9 Correct 24 ms 2252 KB Output is correct
10 Correct 26 ms 2384 KB Output is correct
11 Correct 27 ms 2308 KB Output is correct
12 Correct 36 ms 2300 KB Output is correct
13 Correct 30 ms 2428 KB Output is correct
14 Correct 28 ms 2380 KB Output is correct
15 Correct 30 ms 2384 KB Output is correct
16 Correct 23 ms 2260 KB Output is correct
17 Correct 25 ms 2280 KB Output is correct
18 Correct 1269 ms 6064 KB Output is correct
19 Correct 1247 ms 8796 KB Output is correct
20 Correct 1243 ms 8824 KB Output is correct
21 Correct 1298 ms 8796 KB Output is correct
22 Correct 1283 ms 8864 KB Output is correct
23 Correct 1708 ms 8724 KB Output is correct
24 Correct 1701 ms 8592 KB Output is correct
25 Correct 1727 ms 8492 KB Output is correct
26 Correct 32 ms 3404 KB Output is correct
27 Correct 1176 ms 8064 KB Output is correct
28 Correct 1152 ms 7640 KB Output is correct
29 Correct 1107 ms 7560 KB Output is correct
30 Correct 1124 ms 10152 KB Output is correct
31 Correct 959 ms 5168 KB Output is correct
32 Correct 606 ms 5632 KB Output is correct
33 Correct 1094 ms 7308 KB Output is correct
34 Correct 949 ms 7564 KB Output is correct
35 Correct 33 ms 3464 KB Output is correct
36 Correct 1066 ms 7468 KB Output is correct
37 Correct 869 ms 7404 KB Output is correct
38 Correct 805 ms 7708 KB Output is correct
39 Correct 670 ms 6368 KB Output is correct
40 Correct 611 ms 6432 KB Output is correct
41 Correct 712 ms 9108 KB Output is correct
42 Correct 634 ms 8940 KB Output is correct
43 Correct 1643 ms 6380 KB Output is correct
44 Correct 31 ms 2020 KB Output is correct
45 Correct 172 ms 3904 KB Output is correct
46 Correct 154 ms 3904 KB Output is correct
47 Correct 1565 ms 6564 KB Output is correct
48 Correct 1607 ms 6356 KB Output is correct
49 Correct 1574 ms 6452 KB Output is correct
50 Correct 823 ms 4316 KB Output is correct
51 Correct 841 ms 4288 KB Output is correct
52 Correct 839 ms 4456 KB Output is correct
53 Correct 1248 ms 5572 KB Output is correct
54 Correct 1261 ms 5640 KB Output is correct
55 Correct 1314 ms 5984 KB Output is correct
56 Correct 1398 ms 6704 KB Output is correct
57 Correct 1557 ms 6456 KB Output is correct
58 Correct 1658 ms 6380 KB Output is correct
59 Correct 1657 ms 6404 KB Output is correct
60 Correct 1653 ms 6340 KB Output is correct
61 Correct 1615 ms 6324 KB Output is correct
62 Correct 1383 ms 6228 KB Output is correct
63 Correct 1394 ms 6184 KB Output is correct
64 Correct 1580 ms 6348 KB Output is correct
65 Correct 1503 ms 6104 KB Output is correct
66 Correct 1334 ms 8916 KB Output is correct
67 Correct 1522 ms 8484 KB Output is correct
68 Correct 1339 ms 8952 KB Output is correct
69 Correct 1004 ms 9116 KB Output is correct
70 Correct 1462 ms 8740 KB Output is correct
71 Correct 1533 ms 8700 KB Output is correct
72 Correct 1506 ms 8944 KB Output is correct
73 Correct 1299 ms 9012 KB Output is correct
74 Correct 1288 ms 8872 KB Output is correct
75 Correct 1321 ms 8860 KB Output is correct
76 Correct 1038 ms 9132 KB Output is correct
77 Correct 1050 ms 9096 KB Output is correct
78 Correct 1039 ms 9112 KB Output is correct
79 Correct 931 ms 7716 KB Output is correct
80 Correct 932 ms 7812 KB Output is correct
81 Correct 907 ms 7752 KB Output is correct
82 Correct 888 ms 9920 KB Output is correct
83 Correct 891 ms 9684 KB Output is correct
84 Correct 854 ms 9808 KB Output is correct
85 Correct 1877 ms 11580 KB Output is correct
86 Correct 190 ms 7436 KB Output is correct
87 Correct 173 ms 7564 KB Output is correct
88 Correct 1833 ms 10312 KB Output is correct
89 Correct 1866 ms 11920 KB Output is correct
90 Correct 1840 ms 10676 KB Output is correct
91 Correct 1312 ms 8696 KB Output is correct
92 Correct 1335 ms 8772 KB Output is correct
93 Correct 1803 ms 8588 KB Output is correct
94 Correct 1579 ms 10688 KB Output is correct
95 Correct 1597 ms 10708 KB Output is correct
96 Correct 1698 ms 10404 KB Output is correct
97 Correct 1653 ms 11540 KB Output is correct
98 Correct 1666 ms 11760 KB Output is correct
99 Correct 1933 ms 12024 KB Output is correct
100 Correct 1884 ms 11744 KB Output is correct
101 Correct 2013 ms 11796 KB Output is correct
102 Correct 1956 ms 11996 KB Output is correct
103 Correct 1864 ms 10788 KB Output is correct
104 Correct 1876 ms 10772 KB Output is correct
105 Correct 1539 ms 12328 KB Output is correct
106 Correct 1298 ms 12276 KB Output is correct
107 Correct 1447 ms 10040 KB Output is correct
108 Correct 1822 ms 11388 KB Output is correct
109 Correct 1722 ms 9484 KB Output is correct