oj.uz

Submission #926588

# Submission time Handle Problem Language Result Execution time Memory
926588 2024-02-13T11:31:50 Z TAhmed33 Bridges (APIO19_bridges) C++
100 / 100
 1323 ms 7552 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 25;
const int SZE = 1300;
struct DSU {
    int sze[MAXN], par[MAXN];
    stack <array <int, 2>> ops;
    void init (int n) {
        for (int i = 1; i <= n; i++) {
            sze[i] = 1; par[i] = i;
        }
        while (!ops.empty()) ops.pop();
    }
    inline int find (int x) {
        while (par[x] != x) x = par[x];
        return x;
    }
    void merge (int x, int y) {
        x = find(x); y = find(y);
        if (x == y) return;
        if (sze[x] > sze[y]) swap(x, y);
        sze[y] += sze[x]; 
        par[x] = y;
        ops.push({x, y});
    }
    void rollback () {  
        auto g = ops.top();
        ops.pop();
        sze[g[1]] -= sze[g[0]];
        par[g[0]] = g[0];
    }
} cur;
int n, m, q; 
array <int, 3> edges[MAXN], queries[MAXN];
bool vis[MAXN];
int ans[MAXN];
int main () {
    ios::sync_with_stdio(0); cin.tie(0);    
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        cin >> edges[i][0] >> edges[i][1] >> edges[i][2];
    }
    cin >> q;
    for (int i = 1; i <= q; i++) {
        cin >> queries[i][0] >> queries[i][1] >> queries[i][2];
    }
    for (int l = 1; l <= q; l += SZE) {
        int r = min(q, l + SZE - 1);
        cur.init(n); memset(vis, 0, sizeof(vis));
        vector <int> dd;
        vector <int> qq;
        vector <int> zz;
        for (int i = l; i <= r; i++) {
            if (queries[i][0] == 1) {
                vis[queries[i][1]] = 1;
                zz.push_back(queries[i][1]);
            } else qq.push_back(i);
        }
        for (int i = 1; i <= m; i++) {
            if (!vis[i]) {
                dd.push_back(i);
            }
        }
        vector <int> added[r - l + 1];
        for (int i = l; i <= r; i++) {
            if (queries[i][0] == 1) {
                edges[queries[i][1]][2] = queries[i][2];
            } else {
                for (auto j : zz) {
                    if (edges[j][2] >= queries[i][2]) {
                        added[i - l].push_back(j);
                    }
                }
            }
        }
        sort(qq.begin(), qq.end(), [&] (int a, int b) {
            return queries[a][2] > queries[b][2];
        });
        sort(dd.begin(), dd.end(), [&] (int a, int b) {
            return edges[a][2] < edges[b][2];
        });
        for (auto i : qq) {
            while (!dd.empty() && edges[dd.back()][2] >= queries[i][2]) {
                cur.merge(edges[dd.back()][0], edges[dd.back()][1]);
                dd.pop_back();
            }
            int z = cur.ops.size();
            for (auto j : added[i - l]) {
                cur.merge(edges[j][0], edges[j][1]);
            }
            ans[i] = cur.sze[cur.find(queries[i][1])];
            while ((int)cur.ops.size() > z) cur.rollback();
        }
    }
    for (int i = 1; i <= q; i++) {
        if (queries[i][0] == 2) cout << ans[i] << '\n';
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 28 ms 3908 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 32 ms 4140 KB Output is correct
6 Correct 32 ms 3996 KB Output is correct
7 Correct 24 ms 4188 KB Output is correct
8 Correct 33 ms 3732 KB Output is correct
9 Correct 43 ms 5264 KB Output is correct
10 Correct 34 ms 3928 KB Output is correct
11 Correct 38 ms 3928 KB Output is correct
12 Correct 44 ms 4216 KB Output is correct
13 Correct 51 ms 4032 KB Output is correct
14 Correct 36 ms 3864 KB Output is correct
15 Correct 40 ms 3812 KB Output is correct
16 Correct 28 ms 4620 KB Output is correct
17 Correct 29 ms 4240 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 822 ms 5244 KB Output is correct
2 Correct 824 ms 5180 KB Output is correct
3 Correct 824 ms 5284 KB Output is correct
4 Correct 864 ms 5128 KB Output is correct
5 Correct 854 ms 5128 KB Output is correct
6 Correct 973 ms 6676 KB Output is correct
7 Correct 979 ms 6796 KB Output is correct
8 Correct 988 ms 6544 KB Output is correct
9 Correct 27 ms 2836 KB Output is correct
10 Correct 572 ms 5900 KB Output is correct
11 Correct 539 ms 5568 KB Output is correct
12 Correct 665 ms 5320 KB Output is correct
13 Correct 641 ms 4984 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 704 ms 4780 KB Output is correct
2 Correct 470 ms 4948 KB Output is correct
3 Correct 711 ms 5456 KB Output is correct
4 Correct 682 ms 4632 KB Output is correct
5 Correct 34 ms 2900 KB Output is correct
6 Correct 710 ms 5200 KB Output is correct
7 Correct 650 ms 4780 KB Output is correct
8 Correct 600 ms 4180 KB Output is correct
9 Correct 445 ms 4268 KB Output is correct
10 Correct 417 ms 4040 KB Output is correct
11 Correct 531 ms 4208 KB Output is correct
12 Correct 405 ms 3816 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 959 ms 5032 KB Output is correct
2 Correct 39 ms 2900 KB Output is correct
3 Correct 121 ms 4088 KB Output is correct
4 Correct 49 ms 4104 KB Output is correct
5 Correct 476 ms 5260 KB Output is correct
6 Correct 956 ms 5004 KB Output is correct
7 Correct 472 ms 5040 KB Output is correct
8 Correct 457 ms 3748 KB Output is correct
9 Correct 431 ms 3860 KB Output is correct
10 Correct 457 ms 4248 KB Output is correct
11 Correct 716 ms 4652 KB Output is correct
12 Correct 719 ms 4652 KB Output is correct
13 Correct 737 ms 4648 KB Output is correct
14 Correct 417 ms 5296 KB Output is correct
15 Correct 439 ms 5292 KB Output is correct
16 Correct 967 ms 5020 KB Output is correct
17 Correct 1020 ms 5020 KB Output is correct
18 Correct 982 ms 5036 KB Output is correct
19 Correct 978 ms 5012 KB Output is correct
20 Correct 887 ms 4936 KB Output is correct
21 Correct 829 ms 4996 KB Output is correct
22 Correct 945 ms 5212 KB Output is correct
23 Correct 557 ms 4936 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 822 ms 5244 KB Output is correct
2 Correct 824 ms 5180 KB Output is correct
3 Correct 824 ms 5284 KB Output is correct
4 Correct 864 ms 5128 KB Output is correct
5 Correct 854 ms 5128 KB Output is correct
6 Correct 973 ms 6676 KB Output is correct
7 Correct 979 ms 6796 KB Output is correct
8 Correct 988 ms 6544 KB Output is correct
9 Correct 27 ms 2836 KB Output is correct
10 Correct 572 ms 5900 KB Output is correct
11 Correct 539 ms 5568 KB Output is correct
12 Correct 665 ms 5320 KB Output is correct
13 Correct 641 ms 4984 KB Output is correct
14 Correct 704 ms 4780 KB Output is correct
15 Correct 470 ms 4948 KB Output is correct
16 Correct 711 ms 5456 KB Output is correct
17 Correct 682 ms 4632 KB Output is correct
18 Correct 34 ms 2900 KB Output is correct
19 Correct 710 ms 5200 KB Output is correct
20 Correct 650 ms 4780 KB Output is correct
21 Correct 600 ms 4180 KB Output is correct
22 Correct 445 ms 4268 KB Output is correct
23 Correct 417 ms 4040 KB Output is correct
24 Correct 531 ms 4208 KB Output is correct
25 Correct 405 ms 3816 KB Output is correct
26 Correct 1115 ms 5264 KB Output is correct
27 Correct 919 ms 5920 KB Output is correct
28 Correct 892 ms 5132 KB Output is correct
29 Correct 649 ms 4284 KB Output is correct
30 Correct 961 ms 5504 KB Output is correct
31 Correct 960 ms 5596 KB Output is correct
32 Correct 978 ms 5756 KB Output is correct
33 Correct 831 ms 5052 KB Output is correct
34 Correct 879 ms 5280 KB Output is correct
35 Correct 831 ms 5316 KB Output is correct
36 Correct 663 ms 4504 KB Output is correct
37 Correct 633 ms 4372 KB Output is correct
38 Correct 634 ms 4480 KB Output is correct
39 Correct 549 ms 4464 KB Output is correct
40 Correct 535 ms 4288 KB Output is correct
41 Correct 500 ms 4292 KB Output is correct
42 Correct 541 ms 4048 KB Output is correct
43 Correct 528 ms 4276 KB Output is correct
44 Correct 494 ms 4028 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 28 ms 3908 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 32 ms 4140 KB Output is correct
6 Correct 32 ms 3996 KB Output is correct
7 Correct 24 ms 4188 KB Output is correct
8 Correct 33 ms 3732 KB Output is correct
9 Correct 43 ms 5264 KB Output is correct
10 Correct 34 ms 3928 KB Output is correct
11 Correct 38 ms 3928 KB Output is correct
12 Correct 44 ms 4216 KB Output is correct
13 Correct 51 ms 4032 KB Output is correct
14 Correct 36 ms 3864 KB Output is correct
15 Correct 40 ms 3812 KB Output is correct
16 Correct 28 ms 4620 KB Output is correct
17 Correct 29 ms 4240 KB Output is correct
18 Correct 822 ms 5244 KB Output is correct
19 Correct 824 ms 5180 KB Output is correct
20 Correct 824 ms 5284 KB Output is correct
21 Correct 864 ms 5128 KB Output is correct
22 Correct 854 ms 5128 KB Output is correct
23 Correct 973 ms 6676 KB Output is correct
24 Correct 979 ms 6796 KB Output is correct
25 Correct 988 ms 6544 KB Output is correct
26 Correct 27 ms 2836 KB Output is correct
27 Correct 572 ms 5900 KB Output is correct
28 Correct 539 ms 5568 KB Output is correct
29 Correct 665 ms 5320 KB Output is correct
30 Correct 641 ms 4984 KB Output is correct
31 Correct 704 ms 4780 KB Output is correct
32 Correct 470 ms 4948 KB Output is correct
33 Correct 711 ms 5456 KB Output is correct
34 Correct 682 ms 4632 KB Output is correct
35 Correct 34 ms 2900 KB Output is correct
36 Correct 710 ms 5200 KB Output is correct
37 Correct 650 ms 4780 KB Output is correct
38 Correct 600 ms 4180 KB Output is correct
39 Correct 445 ms 4268 KB Output is correct
40 Correct 417 ms 4040 KB Output is correct
41 Correct 531 ms 4208 KB Output is correct
42 Correct 405 ms 3816 KB Output is correct
43 Correct 959 ms 5032 KB Output is correct
44 Correct 39 ms 2900 KB Output is correct
45 Correct 121 ms 4088 KB Output is correct
46 Correct 49 ms 4104 KB Output is correct
47 Correct 476 ms 5260 KB Output is correct
48 Correct 956 ms 5004 KB Output is correct
49 Correct 472 ms 5040 KB Output is correct
50 Correct 457 ms 3748 KB Output is correct
51 Correct 431 ms 3860 KB Output is correct
52 Correct 457 ms 4248 KB Output is correct
53 Correct 716 ms 4652 KB Output is correct
54 Correct 719 ms 4652 KB Output is correct
55 Correct 737 ms 4648 KB Output is correct
56 Correct 417 ms 5296 KB Output is correct
57 Correct 439 ms 5292 KB Output is correct
58 Correct 967 ms 5020 KB Output is correct
59 Correct 1020 ms 5020 KB Output is correct
60 Correct 982 ms 5036 KB Output is correct
61 Correct 978 ms 5012 KB Output is correct
62 Correct 887 ms 4936 KB Output is correct
63 Correct 829 ms 4996 KB Output is correct
64 Correct 945 ms 5212 KB Output is correct
65 Correct 557 ms 4936 KB Output is correct
66 Correct 1115 ms 5264 KB Output is correct
67 Correct 919 ms 5920 KB Output is correct
68 Correct 892 ms 5132 KB Output is correct
69 Correct 649 ms 4284 KB Output is correct
70 Correct 961 ms 5504 KB Output is correct
71 Correct 960 ms 5596 KB Output is correct
72 Correct 978 ms 5756 KB Output is correct
73 Correct 831 ms 5052 KB Output is correct
74 Correct 879 ms 5280 KB Output is correct
75 Correct 831 ms 5316 KB Output is correct
76 Correct 663 ms 4504 KB Output is correct
77 Correct 633 ms 4372 KB Output is correct
78 Correct 634 ms 4480 KB Output is correct
79 Correct 549 ms 4464 KB Output is correct
80 Correct 535 ms 4288 KB Output is correct
81 Correct 500 ms 4292 KB Output is correct
82 Correct 541 ms 4048 KB Output is correct
83 Correct 528 ms 4276 KB Output is correct
84 Correct 494 ms 4028 KB Output is correct
85 Correct 1303 ms 6536 KB Output is correct
86 Correct 134 ms 5292 KB Output is correct
87 Correct 78 ms 6272 KB Output is correct
88 Correct 896 ms 6520 KB Output is correct
89 Correct 1307 ms 6196 KB Output is correct
90 Correct 739 ms 6460 KB Output is correct
91 Correct 835 ms 5168 KB Output is correct
92 Correct 897 ms 5380 KB Output is correct
93 Correct 1040 ms 6716 KB Output is correct
94 Correct 1080 ms 5740 KB Output is correct
95 Correct 1052 ms 5836 KB Output is correct
96 Correct 1127 ms 7108 KB Output is correct
97 Correct 560 ms 5584 KB Output is correct
98 Correct 559 ms 5696 KB Output is correct
99 Correct 1280 ms 6000 KB Output is correct
100 Correct 1270 ms 6336 KB Output is correct
101 Correct 1284 ms 6460 KB Output is correct
102 Correct 1323 ms 6304 KB Output is correct
103 Correct 1134 ms 7380 KB Output is correct
104 Correct 1170 ms 7552 KB Output is correct
105 Correct 959 ms 5720 KB Output is correct
106 Correct 805 ms 5364 KB Output is correct
107 Correct 925 ms 5884 KB Output is correct
108 Correct 1231 ms 7400 KB Output is correct
109 Correct 793 ms 7360 KB Output is correct