oj.uz

Submission #545493

# Submission time Handle Problem Language Result Execution time Memory
545493 2022-04-04T15:52:49 Z Mazaalai Bridges (APIO19_bridges) C++17
100 / 100
 2043 ms 32348 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

const int B = 1000;

int n, m, q;

stack<int> stck;
int sz[100001], cmp[100001];

void reset() {
    iota(cmp + 1, cmp + 1 + n, 1);
    fill(sz + 1, sz + n + 1, 1);
}

inline int find(int a) {
    while (cmp[a] != a) a = cmp[a];
    return a;
}

void onion(int a, int b) {
    a = find(a), b = find(b);
    if (a == b) return;
    if (sz[a] > sz[b]) swap(a, b);
    stck.push(a);
    sz[b] += sz[a];
    cmp[a] = cmp[b];
}

void rollback(int x) {
    while (stck.size() > x) {
        int k = stck.top();
        stck.pop();
        sz[cmp[k]] -= sz[k];
        cmp[k] = k;
    }
}

int u[100001], v[100001], w[100001];
int t[100001], x[100001], y[100001];
bool changed[100001];
vector<int> to_join[B];
int ans[100001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    FOR(i, 1, m + 1) cin >> u[i] >> v[i] >> w[i];
    cin >> q;
    FOR(i, 1, q + 1) cin >> t[i] >> x[i] >> y[i];

    for (int l = 1; l <= q; l += B) {
        int r = min(q + 1, l + B);
        reset();
        fill(changed + 1, changed + m + 1, false);

        vector<int> ask, upd, unchanged;
        FOR(i, l, r) {
            if (t[i] == 1) {
                changed[x[i]] = true;
                upd.push_back(i);
            } else ask.push_back(i);
        }
        FOR(i, 1, m + 1) if (!changed[i]) unchanged.push_back(i);

        FOR(i, l, r) {
            if (t[i] == 1) w[x[i]] = y[i];
            else {
                to_join[i - l].clear();
                for (int j : upd) if (w[x[j]] >= y[i]) to_join[i - l].push_back(x[j]);
            }
        }

        sort(ask.begin(), ask.end(), [&](int a, int b) { return y[a] > y[b]; });
        sort(unchanged.begin(), unchanged.end(), [&](int a, int b) { return w[a] > w[b]; });

        int ptr = 0;
        for (int i : ask) {
            while (ptr < unchanged.size() && w[unchanged[ptr]] >= y[i]) {
                onion(u[unchanged[ptr]], v[unchanged[ptr]]);
                ptr++;
            }
            int prev_size = stck.size();
            for (int j : to_join[i - l]) onion(u[j], v[j]);
            ans[i] = sz[find(x[i])];
            rollback(prev_size);
        }
    }

    FOR(i, 1, q + 1) if (t[i] == 2) cout << ans[i] << '\n';
    return 0;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:33:24: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |     while (stck.size() > x) {
      |            ~~~~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:82:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             while (ptr < unchanged.size() && w[unchanged[ptr]] >= y[i]) {
      |                    ~~~~^~~~~~~~~~~~~~~~~~

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 39 ms 2644 KB Output is correct
4 Correct 4 ms 476 KB Output is correct
5 Correct 36 ms 3036 KB Output is correct
6 Correct 27 ms 2720 KB Output is correct
7 Correct 32 ms 3544 KB Output is correct
8 Correct 35 ms 2792 KB Output is correct
9 Correct 45 ms 4296 KB Output is correct
10 Correct 39 ms 2920 KB Output is correct
11 Correct 37 ms 2768 KB Output is correct
12 Correct 44 ms 2920 KB Output is correct
13 Correct 43 ms 2920 KB Output is correct
14 Correct 42 ms 2744 KB Output is correct
15 Correct 46 ms 2912 KB Output is correct
16 Correct 51 ms 3976 KB Output is correct
17 Correct 42 ms 3532 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1269 ms 26072 KB Output is correct
2 Correct 1305 ms 28504 KB Output is correct
3 Correct 1296 ms 28548 KB Output is correct
4 Correct 1352 ms 28528 KB Output is correct
5 Correct 1325 ms 28720 KB Output is correct
6 Correct 1971 ms 30484 KB Output is correct
7 Correct 1996 ms 30356 KB Output is correct
8 Correct 2037 ms 30300 KB Output is correct
9 Correct 34 ms 3404 KB Output is correct
10 Correct 1110 ms 29528 KB Output is correct
11 Correct 1014 ms 29580 KB Output is correct
12 Correct 1107 ms 27060 KB Output is correct
13 Correct 1119 ms 29932 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1026 ms 18672 KB Output is correct
2 Correct 799 ms 11300 KB Output is correct
3 Correct 1273 ms 22628 KB Output is correct
4 Correct 1079 ms 21104 KB Output is correct
5 Correct 48 ms 3464 KB Output is correct
6 Correct 1245 ms 20992 KB Output is correct
7 Correct 999 ms 20668 KB Output is correct
8 Correct 888 ms 20524 KB Output is correct
9 Correct 700 ms 19396 KB Output is correct
10 Correct 629 ms 19336 KB Output is correct
11 Correct 740 ms 22244 KB Output is correct
12 Correct 647 ms 22112 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1493 ms 24860 KB Output is correct
2 Correct 40 ms 3532 KB Output is correct
3 Correct 154 ms 4520 KB Output is correct
4 Correct 73 ms 4652 KB Output is correct
5 Correct 783 ms 27192 KB Output is correct
6 Correct 1457 ms 28640 KB Output is correct
7 Correct 671 ms 27084 KB Output is correct
8 Correct 700 ms 26668 KB Output is correct
9 Correct 700 ms 26632 KB Output is correct
10 Correct 680 ms 26536 KB Output is correct
11 Correct 1050 ms 27988 KB Output is correct
12 Correct 1012 ms 27972 KB Output is correct
13 Correct 1049 ms 28144 KB Output is correct
14 Correct 620 ms 27216 KB Output is correct
15 Correct 661 ms 27180 KB Output is correct
16 Correct 1375 ms 28812 KB Output is correct
17 Correct 1396 ms 28852 KB Output is correct
18 Correct 1391 ms 29072 KB Output is correct
19 Correct 1363 ms 29244 KB Output is correct
20 Correct 1165 ms 28480 KB Output is correct
21 Correct 1168 ms 28264 KB Output is correct
22 Correct 1327 ms 28304 KB Output is correct
23 Correct 767 ms 24992 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1269 ms 26072 KB Output is correct
2 Correct 1305 ms 28504 KB Output is correct
3 Correct 1296 ms 28548 KB Output is correct
4 Correct 1352 ms 28528 KB Output is correct
5 Correct 1325 ms 28720 KB Output is correct
6 Correct 1971 ms 30484 KB Output is correct
7 Correct 1996 ms 30356 KB Output is correct
8 Correct 2037 ms 30300 KB Output is correct
9 Correct 34 ms 3404 KB Output is correct
10 Correct 1110 ms 29528 KB Output is correct
11 Correct 1014 ms 29580 KB Output is correct
12 Correct 1107 ms 27060 KB Output is correct
13 Correct 1119 ms 29932 KB Output is correct
14 Correct 1026 ms 18672 KB Output is correct
15 Correct 799 ms 11300 KB Output is correct
16 Correct 1273 ms 22628 KB Output is correct
17 Correct 1079 ms 21104 KB Output is correct
18 Correct 48 ms 3464 KB Output is correct
19 Correct 1245 ms 20992 KB Output is correct
20 Correct 999 ms 20668 KB Output is correct
21 Correct 888 ms 20524 KB Output is correct
22 Correct 700 ms 19396 KB Output is correct
23 Correct 629 ms 19336 KB Output is correct
24 Correct 740 ms 22244 KB Output is correct
25 Correct 647 ms 22112 KB Output is correct
26 Correct 1309 ms 29168 KB Output is correct
27 Correct 1568 ms 30616 KB Output is correct
28 Correct 1307 ms 28872 KB Output is correct
29 Correct 907 ms 28528 KB Output is correct
30 Correct 1503 ms 30564 KB Output is correct
31 Correct 1547 ms 30508 KB Output is correct
32 Correct 1561 ms 30488 KB Output is correct
33 Correct 1300 ms 28840 KB Output is correct
34 Correct 1290 ms 28792 KB Output is correct
35 Correct 1306 ms 28856 KB Output is correct
36 Correct 961 ms 28436 KB Output is correct
37 Correct 966 ms 28404 KB Output is correct
38 Correct 947 ms 28444 KB Output is correct
39 Correct 765 ms 27084 KB Output is correct
40 Correct 767 ms 27048 KB Output is correct
41 Correct 778 ms 27136 KB Output is correct
42 Correct 760 ms 29060 KB Output is correct
43 Correct 766 ms 28988 KB Output is correct
44 Correct 777 ms 28968 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 39 ms 2644 KB Output is correct
4 Correct 4 ms 476 KB Output is correct
5 Correct 36 ms 3036 KB Output is correct
6 Correct 27 ms 2720 KB Output is correct
7 Correct 32 ms 3544 KB Output is correct
8 Correct 35 ms 2792 KB Output is correct
9 Correct 45 ms 4296 KB Output is correct
10 Correct 39 ms 2920 KB Output is correct
11 Correct 37 ms 2768 KB Output is correct
12 Correct 44 ms 2920 KB Output is correct
13 Correct 43 ms 2920 KB Output is correct
14 Correct 42 ms 2744 KB Output is correct
15 Correct 46 ms 2912 KB Output is correct
16 Correct 51 ms 3976 KB Output is correct
17 Correct 42 ms 3532 KB Output is correct
18 Correct 1269 ms 26072 KB Output is correct
19 Correct 1305 ms 28504 KB Output is correct
20 Correct 1296 ms 28548 KB Output is correct
21 Correct 1352 ms 28528 KB Output is correct
22 Correct 1325 ms 28720 KB Output is correct
23 Correct 1971 ms 30484 KB Output is correct
24 Correct 1996 ms 30356 KB Output is correct
25 Correct 2037 ms 30300 KB Output is correct
26 Correct 34 ms 3404 KB Output is correct
27 Correct 1110 ms 29528 KB Output is correct
28 Correct 1014 ms 29580 KB Output is correct
29 Correct 1107 ms 27060 KB Output is correct
30 Correct 1119 ms 29932 KB Output is correct
31 Correct 1026 ms 18672 KB Output is correct
32 Correct 799 ms 11300 KB Output is correct
33 Correct 1273 ms 22628 KB Output is correct
34 Correct 1079 ms 21104 KB Output is correct
35 Correct 48 ms 3464 KB Output is correct
36 Correct 1245 ms 20992 KB Output is correct
37 Correct 999 ms 20668 KB Output is correct
38 Correct 888 ms 20524 KB Output is correct
39 Correct 700 ms 19396 KB Output is correct
40 Correct 629 ms 19336 KB Output is correct
41 Correct 740 ms 22244 KB Output is correct
42 Correct 647 ms 22112 KB Output is correct
43 Correct 1493 ms 24860 KB Output is correct
44 Correct 40 ms 3532 KB Output is correct
45 Correct 154 ms 4520 KB Output is correct
46 Correct 73 ms 4652 KB Output is correct
47 Correct 783 ms 27192 KB Output is correct
48 Correct 1457 ms 28640 KB Output is correct
49 Correct 671 ms 27084 KB Output is correct
50 Correct 700 ms 26668 KB Output is correct
51 Correct 700 ms 26632 KB Output is correct
52 Correct 680 ms 26536 KB Output is correct
53 Correct 1050 ms 27988 KB Output is correct
54 Correct 1012 ms 27972 KB Output is correct
55 Correct 1049 ms 28144 KB Output is correct
56 Correct 620 ms 27216 KB Output is correct
57 Correct 661 ms 27180 KB Output is correct
58 Correct 1375 ms 28812 KB Output is correct
59 Correct 1396 ms 28852 KB Output is correct
60 Correct 1391 ms 29072 KB Output is correct
61 Correct 1363 ms 29244 KB Output is correct
62 Correct 1165 ms 28480 KB Output is correct
63 Correct 1168 ms 28264 KB Output is correct
64 Correct 1327 ms 28304 KB Output is correct
65 Correct 767 ms 24992 KB Output is correct
66 Correct 1309 ms 29168 KB Output is correct
67 Correct 1568 ms 30616 KB Output is correct
68 Correct 1307 ms 28872 KB Output is correct
69 Correct 907 ms 28528 KB Output is correct
70 Correct 1503 ms 30564 KB Output is correct
71 Correct 1547 ms 30508 KB Output is correct
72 Correct 1561 ms 30488 KB Output is correct
73 Correct 1300 ms 28840 KB Output is correct
74 Correct 1290 ms 28792 KB Output is correct
75 Correct 1306 ms 28856 KB Output is correct
76 Correct 961 ms 28436 KB Output is correct
77 Correct 966 ms 28404 KB Output is correct
78 Correct 947 ms 28444 KB Output is correct
79 Correct 765 ms 27084 KB Output is correct
80 Correct 767 ms 27048 KB Output is correct
81 Correct 778 ms 27136 KB Output is correct
82 Correct 760 ms 29060 KB Output is correct
83 Correct 766 ms 28988 KB Output is correct
84 Correct 777 ms 28968 KB Output is correct
85 Correct 1851 ms 30896 KB Output is correct
86 Correct 174 ms 6628 KB Output is correct
87 Correct 116 ms 8008 KB Output is correct
88 Correct 1076 ms 31168 KB Output is correct
89 Correct 1785 ms 31008 KB Output is correct
90 Correct 1105 ms 31248 KB Output is correct
91 Correct 1361 ms 28820 KB Output is correct
92 Correct 1323 ms 28956 KB Output is correct
93 Correct 1926 ms 30184 KB Output is correct
94 Correct 1526 ms 30328 KB Output is correct
95 Correct 1571 ms 30460 KB Output is correct
96 Correct 1795 ms 32068 KB Output is correct
97 Correct 793 ms 27684 KB Output is correct
98 Correct 901 ms 30988 KB Output is correct
99 Correct 1803 ms 31496 KB Output is correct
100 Correct 1842 ms 30976 KB Output is correct
101 Correct 1868 ms 31308 KB Output is correct
102 Correct 1857 ms 31340 KB Output is correct
103 Correct 2043 ms 32268 KB Output is correct
104 Correct 2005 ms 32348 KB Output is correct
105 Correct 1468 ms 32196 KB Output is correct
106 Correct 1206 ms 31524 KB Output is correct
107 Correct 1401 ms 28800 KB Output is correct
108 Correct 1901 ms 31076 KB Output is correct
109 Correct 1380 ms 28936 KB Output is correct