oj.uz

Submission #385580

# Submission time Handle Problem Language Result Execution time Memory
385580 2021-04-04T15:28:48 Z ntabc05101 Bridges (APIO19_bridges) C++14
100 / 100
 2519 ms 32372 KB 
#include<bits/stdc++.h>
using namespace std;

const int block = 1000;
const int mx = 100000;

int parent[5 + mx], sz[5 + mx];
stack<int> st;

void init(int n) {
        iota(parent, parent + n, 0);
        fill(sz, sz + n, 1);
}

int find(int x) {
        while (x != parent[x]) {
                x = parent[x];
        }
        return x;
}

void unite_set(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) {
                return ;
        }

        if (sz[x] < sz[y]) {
                swap(x, y);
        }
        st.emplace(y);
        parent[y] = x;
        sz[x] += sz[y];
}

void roll_back(int x) {
        while (st.size() > x) {
                int y = st.top();
                st.pop();

                sz[parent[y]] -= sz[y];
                parent[y] = y;
        }
}

int n, m, q;
int u[5 + mx], v[5 + mx], w[5 + mx];
int t[5 + mx], x[5 + mx], y[5 + mx];
bool changed[5 + mx];
vector<int> to_join[block];
int result[5 + mx];

int main() {
        ios_base::sync_with_stdio(0); cin.tie(0);

        cin >> n >> m;
        for (int i = 0; i < m; i++) {
                cin >> u[i] >> v[i] >> w[i];
                u[i]--, v[i]--;
        }
        cin >> q;
        for (int i = 0; i < q; i++) {
                cin >> t[i] >> x[i] >> y[i];
                x[i]--;
        }

        fill(changed, changed + m, false);
        for (int l = 0; l < q; l += block) {
                int r = min(l + block, q);
                init(n);

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

                for (int i = 0; i < m; i++) {
                        if (!changed[i]) {
                                unchanged.emplace_back(i);
                        }
                        else {
                                changed[i] = false;
                        }
                }

                for (int i = l; i < r; i++) {
                        if (t[i] == 1) {
                                w[x[i]] = y[i];
                        }
                        else {
                                to_join[i - l].clear();
                                for (auto& u: upd) {
                                        if (w[x[u]] >= y[i]) {
                                                to_join[i - l].emplace_back(x[u]);
                                        }
                                }
                        }
                }

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

                int p = 0;
                for (int& i: ask) {
                        while (p < unchanged.size() && w[unchanged[p]] >= y[i]) {
                                unite_set(u[unchanged[p]], v[unchanged[p]]);
                                p++;
                        }

                        int pre_sz = st.size();
                        for (int& j: to_join[i - l]) {
                                unite_set(u[j], v[j]);
                        }
                        result[i] = sz[find(x[i])];

                        roll_back(pre_sz);
                }
        }

        for (int i = 0; i < q; i++) {
                if (t[i] == 2) {
                        cout << result[i] << "\n";
                }
        }

        return 0;
}

Compilation message

bridges.cpp: In function 'void roll_back(int)':
bridges.cpp:37:26: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |         while (st.size() > x) {
      |                ~~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:115:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |                         while (p < unchanged.size() && w[unchanged[p]] >= y[i]) {
      |                                ~~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 41 ms 2796 KB Output is correct
4 Correct 5 ms 620 KB Output is correct
5 Correct 40 ms 2924 KB Output is correct
6 Correct 38 ms 2668 KB Output is correct
7 Correct 43 ms 3564 KB Output is correct
8 Correct 46 ms 2668 KB Output is correct
9 Correct 54 ms 4352 KB Output is correct
10 Correct 44 ms 2796 KB Output is correct
11 Correct 42 ms 2668 KB Output is correct
12 Correct 52 ms 2924 KB Output is correct
13 Correct 49 ms 2796 KB Output is correct
14 Correct 56 ms 2668 KB Output is correct
15 Correct 54 ms 2796 KB Output is correct
16 Correct 58 ms 3948 KB Output is correct
17 Correct 48 ms 3436 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1504 ms 26184 KB Output is correct
2 Correct 1500 ms 26204 KB Output is correct
3 Correct 1591 ms 26228 KB Output is correct
4 Correct 1517 ms 26100 KB Output is correct
5 Correct 1510 ms 26440 KB Output is correct
6 Correct 2230 ms 28068 KB Output is correct
7 Correct 2185 ms 28016 KB Output is correct
8 Correct 2276 ms 27912 KB Output is correct
9 Correct 57 ms 2156 KB Output is correct
10 Correct 1320 ms 28108 KB Output is correct
11 Correct 1189 ms 27948 KB Output is correct
12 Correct 1282 ms 24816 KB Output is correct
13 Correct 1354 ms 27472 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1185 ms 18768 KB Output is correct
2 Correct 912 ms 9708 KB Output is correct
3 Correct 1380 ms 20732 KB Output is correct
4 Correct 1153 ms 18768 KB Output is correct
5 Correct 41 ms 2156 KB Output is correct
6 Correct 1335 ms 18936 KB Output is correct
7 Correct 1073 ms 18468 KB Output is correct
8 Correct 966 ms 18408 KB Output is correct
9 Correct 833 ms 17120 KB Output is correct
10 Correct 708 ms 17056 KB Output is correct
11 Correct 871 ms 19896 KB Output is correct
12 Correct 718 ms 19820 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1796 ms 24888 KB Output is correct
2 Correct 47 ms 3564 KB Output is correct
3 Correct 229 ms 4780 KB Output is correct
4 Correct 89 ms 4780 KB Output is correct
5 Correct 929 ms 27240 KB Output is correct
6 Correct 1924 ms 28732 KB Output is correct
7 Correct 955 ms 27324 KB Output is correct
8 Correct 839 ms 26636 KB Output is correct
9 Correct 901 ms 26772 KB Output is correct
10 Correct 884 ms 26756 KB Output is correct
11 Correct 1352 ms 27988 KB Output is correct
12 Correct 1287 ms 28112 KB Output is correct
13 Correct 1403 ms 28112 KB Output is correct
14 Correct 864 ms 27340 KB Output is correct
15 Correct 900 ms 27272 KB Output is correct
16 Correct 1723 ms 28980 KB Output is correct
17 Correct 1734 ms 29036 KB Output is correct
18 Correct 1900 ms 29208 KB Output is correct
19 Correct 1791 ms 29108 KB Output is correct
20 Correct 1514 ms 28492 KB Output is correct
21 Correct 1612 ms 28356 KB Output is correct
22 Correct 1671 ms 28500 KB Output is correct
23 Correct 973 ms 25168 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1504 ms 26184 KB Output is correct
2 Correct 1500 ms 26204 KB Output is correct
3 Correct 1591 ms 26228 KB Output is correct
4 Correct 1517 ms 26100 KB Output is correct
5 Correct 1510 ms 26440 KB Output is correct
6 Correct 2230 ms 28068 KB Output is correct
7 Correct 2185 ms 28016 KB Output is correct
8 Correct 2276 ms 27912 KB Output is correct
9 Correct 57 ms 2156 KB Output is correct
10 Correct 1320 ms 28108 KB Output is correct
11 Correct 1189 ms 27948 KB Output is correct
12 Correct 1282 ms 24816 KB Output is correct
13 Correct 1354 ms 27472 KB Output is correct
14 Correct 1185 ms 18768 KB Output is correct
15 Correct 912 ms 9708 KB Output is correct
16 Correct 1380 ms 20732 KB Output is correct
17 Correct 1153 ms 18768 KB Output is correct
18 Correct 41 ms 2156 KB Output is correct
19 Correct 1335 ms 18936 KB Output is correct
20 Correct 1073 ms 18468 KB Output is correct
21 Correct 966 ms 18408 KB Output is correct
22 Correct 833 ms 17120 KB Output is correct
23 Correct 708 ms 17056 KB Output is correct
24 Correct 871 ms 19896 KB Output is correct
25 Correct 718 ms 19820 KB Output is correct
26 Correct 1513 ms 26336 KB Output is correct
27 Correct 1875 ms 28300 KB Output is correct
28 Correct 1584 ms 26212 KB Output is correct
29 Correct 1205 ms 25804 KB Output is correct
30 Correct 1819 ms 27944 KB Output is correct
31 Correct 1884 ms 27968 KB Output is correct
32 Correct 1791 ms 27928 KB Output is correct
33 Correct 1535 ms 26064 KB Output is correct
34 Correct 1563 ms 26068 KB Output is correct
35 Correct 1616 ms 26100 KB Output is correct
36 Correct 1158 ms 25908 KB Output is correct
37 Correct 1179 ms 25824 KB Output is correct
38 Correct 1161 ms 25808 KB Output is correct
39 Correct 1092 ms 24464 KB Output is correct
40 Correct 1000 ms 24412 KB Output is correct
41 Correct 986 ms 24380 KB Output is correct
42 Correct 988 ms 26480 KB Output is correct
43 Correct 955 ms 26436 KB Output is correct
44 Correct 939 ms 26284 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 41 ms 2796 KB Output is correct
4 Correct 5 ms 620 KB Output is correct
5 Correct 40 ms 2924 KB Output is correct
6 Correct 38 ms 2668 KB Output is correct
7 Correct 43 ms 3564 KB Output is correct
8 Correct 46 ms 2668 KB Output is correct
9 Correct 54 ms 4352 KB Output is correct
10 Correct 44 ms 2796 KB Output is correct
11 Correct 42 ms 2668 KB Output is correct
12 Correct 52 ms 2924 KB Output is correct
13 Correct 49 ms 2796 KB Output is correct
14 Correct 56 ms 2668 KB Output is correct
15 Correct 54 ms 2796 KB Output is correct
16 Correct 58 ms 3948 KB Output is correct
17 Correct 48 ms 3436 KB Output is correct
18 Correct 1504 ms 26184 KB Output is correct
19 Correct 1500 ms 26204 KB Output is correct
20 Correct 1591 ms 26228 KB Output is correct
21 Correct 1517 ms 26100 KB Output is correct
22 Correct 1510 ms 26440 KB Output is correct
23 Correct 2230 ms 28068 KB Output is correct
24 Correct 2185 ms 28016 KB Output is correct
25 Correct 2276 ms 27912 KB Output is correct
26 Correct 57 ms 2156 KB Output is correct
27 Correct 1320 ms 28108 KB Output is correct
28 Correct 1189 ms 27948 KB Output is correct
29 Correct 1282 ms 24816 KB Output is correct
30 Correct 1354 ms 27472 KB Output is correct
31 Correct 1185 ms 18768 KB Output is correct
32 Correct 912 ms 9708 KB Output is correct
33 Correct 1380 ms 20732 KB Output is correct
34 Correct 1153 ms 18768 KB Output is correct
35 Correct 41 ms 2156 KB Output is correct
36 Correct 1335 ms 18936 KB Output is correct
37 Correct 1073 ms 18468 KB Output is correct
38 Correct 966 ms 18408 KB Output is correct
39 Correct 833 ms 17120 KB Output is correct
40 Correct 708 ms 17056 KB Output is correct
41 Correct 871 ms 19896 KB Output is correct
42 Correct 718 ms 19820 KB Output is correct
43 Correct 1796 ms 24888 KB Output is correct
44 Correct 47 ms 3564 KB Output is correct
45 Correct 229 ms 4780 KB Output is correct
46 Correct 89 ms 4780 KB Output is correct
47 Correct 929 ms 27240 KB Output is correct
48 Correct 1924 ms 28732 KB Output is correct
49 Correct 955 ms 27324 KB Output is correct
50 Correct 839 ms 26636 KB Output is correct
51 Correct 901 ms 26772 KB Output is correct
52 Correct 884 ms 26756 KB Output is correct
53 Correct 1352 ms 27988 KB Output is correct
54 Correct 1287 ms 28112 KB Output is correct
55 Correct 1403 ms 28112 KB Output is correct
56 Correct 864 ms 27340 KB Output is correct
57 Correct 900 ms 27272 KB Output is correct
58 Correct 1723 ms 28980 KB Output is correct
59 Correct 1734 ms 29036 KB Output is correct
60 Correct 1900 ms 29208 KB Output is correct
61 Correct 1791 ms 29108 KB Output is correct
62 Correct 1514 ms 28492 KB Output is correct
63 Correct 1612 ms 28356 KB Output is correct
64 Correct 1671 ms 28500 KB Output is correct
65 Correct 973 ms 25168 KB Output is correct
66 Correct 1513 ms 26336 KB Output is correct
67 Correct 1875 ms 28300 KB Output is correct
68 Correct 1584 ms 26212 KB Output is correct
69 Correct 1205 ms 25804 KB Output is correct
70 Correct 1819 ms 27944 KB Output is correct
71 Correct 1884 ms 27968 KB Output is correct
72 Correct 1791 ms 27928 KB Output is correct
73 Correct 1535 ms 26064 KB Output is correct
74 Correct 1563 ms 26068 KB Output is correct
75 Correct 1616 ms 26100 KB Output is correct
76 Correct 1158 ms 25908 KB Output is correct
77 Correct 1179 ms 25824 KB Output is correct
78 Correct 1161 ms 25808 KB Output is correct
79 Correct 1092 ms 24464 KB Output is correct
80 Correct 1000 ms 24412 KB Output is correct
81 Correct 986 ms 24380 KB Output is correct
82 Correct 988 ms 26480 KB Output is correct
83 Correct 955 ms 26436 KB Output is correct
84 Correct 939 ms 26284 KB Output is correct
85 Correct 2491 ms 30924 KB Output is correct
86 Correct 210 ms 6668 KB Output is correct
87 Correct 137 ms 8108 KB Output is correct
88 Correct 1406 ms 31200 KB Output is correct
89 Correct 2253 ms 31088 KB Output is correct
90 Correct 1400 ms 31252 KB Output is correct
91 Correct 1592 ms 28844 KB Output is correct
92 Correct 1589 ms 28884 KB Output is correct
93 Correct 2343 ms 30208 KB Output is correct
94 Correct 1915 ms 30436 KB Output is correct
95 Correct 1918 ms 30448 KB Output is correct
96 Correct 2283 ms 32076 KB Output is correct
97 Correct 1108 ms 27788 KB Output is correct
98 Correct 1136 ms 31132 KB Output is correct
99 Correct 2249 ms 31420 KB Output is correct
100 Correct 2246 ms 31336 KB Output is correct
101 Correct 2462 ms 31588 KB Output is correct
102 Correct 2321 ms 31528 KB Output is correct
103 Correct 2505 ms 32372 KB Output is correct
104 Correct 2519 ms 32288 KB Output is correct
105 Correct 1859 ms 32048 KB Output is correct
106 Correct 1480 ms 31776 KB Output is correct
107 Correct 1732 ms 28948 KB Output is correct
108 Correct 2517 ms 31236 KB Output is correct
109 Correct 1745 ms 29128 KB Output is correct