oj.uz

Submission #546618

# Submission time Handle Problem Language Result Execution time Memory
546618 2022-04-07T21:27:20 Z wmch13 Bridges (APIO19_bridges) C++14
100 / 100
 2001 ms 32460 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:21: 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:15: 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 35 ms 2636 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 34 ms 2904 KB Output is correct
6 Correct 26 ms 2516 KB Output is correct
7 Correct 31 ms 3416 KB Output is correct
8 Correct 36 ms 2636 KB Output is correct
9 Correct 43 ms 4224 KB Output is correct
10 Correct 36 ms 2748 KB Output is correct
11 Correct 37 ms 2644 KB Output is correct
12 Correct 43 ms 2868 KB Output is correct
13 Correct 44 ms 2764 KB Output is correct
14 Correct 42 ms 2644 KB Output is correct
15 Correct 43 ms 2692 KB Output is correct
16 Correct 39 ms 3972 KB Output is correct
17 Correct 38 ms 3404 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1213 ms 26136 KB Output is correct
2 Correct 1240 ms 26144 KB Output is correct
3 Correct 1254 ms 26104 KB Output is correct
4 Correct 1233 ms 26160 KB Output is correct
5 Correct 1335 ms 26308 KB Output is correct
6 Correct 1870 ms 28104 KB Output is correct
7 Correct 1839 ms 27828 KB Output is correct
8 Correct 1832 ms 28076 KB Output is correct
9 Correct 30 ms 2132 KB Output is correct
10 Correct 1016 ms 27992 KB Output is correct
11 Correct 942 ms 27880 KB Output is correct
12 Correct 1044 ms 24760 KB Output is correct
13 Correct 1083 ms 27472 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 990 ms 18828 KB Output is correct
2 Correct 786 ms 9708 KB Output is correct
3 Correct 1202 ms 20496 KB Output is correct
4 Correct 999 ms 18716 KB Output is correct
5 Correct 31 ms 2108 KB Output is correct
6 Correct 1125 ms 18744 KB Output is correct
7 Correct 906 ms 18392 KB Output is correct
8 Correct 782 ms 18408 KB Output is correct
9 Correct 646 ms 17076 KB Output is correct
10 Correct 625 ms 17016 KB Output is correct
11 Correct 733 ms 19968 KB Output is correct
12 Correct 623 ms 19812 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1577 ms 24788 KB Output is correct
2 Correct 38 ms 3380 KB Output is correct
3 Correct 166 ms 4568 KB Output is correct
4 Correct 72 ms 4684 KB Output is correct
5 Correct 749 ms 27180 KB Output is correct
6 Correct 1443 ms 28628 KB Output is correct
7 Correct 759 ms 27192 KB Output is correct
8 Correct 707 ms 26608 KB Output is correct
9 Correct 703 ms 26792 KB Output is correct
10 Correct 730 ms 26576 KB Output is correct
11 Correct 1124 ms 27872 KB Output is correct
12 Correct 1084 ms 28084 KB Output is correct
13 Correct 1147 ms 27928 KB Output is correct
14 Correct 671 ms 27208 KB Output is correct
15 Correct 698 ms 27216 KB Output is correct
16 Correct 1475 ms 28820 KB Output is correct
17 Correct 1483 ms 28748 KB Output is correct
18 Correct 1466 ms 29048 KB Output is correct
19 Correct 1484 ms 28996 KB Output is correct
20 Correct 1312 ms 28284 KB Output is correct
21 Correct 1253 ms 28248 KB Output is correct
22 Correct 1428 ms 28292 KB Output is correct
23 Correct 798 ms 25032 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1213 ms 26136 KB Output is correct
2 Correct 1240 ms 26144 KB Output is correct
3 Correct 1254 ms 26104 KB Output is correct
4 Correct 1233 ms 26160 KB Output is correct
5 Correct 1335 ms 26308 KB Output is correct
6 Correct 1870 ms 28104 KB Output is correct
7 Correct 1839 ms 27828 KB Output is correct
8 Correct 1832 ms 28076 KB Output is correct
9 Correct 30 ms 2132 KB Output is correct
10 Correct 1016 ms 27992 KB Output is correct
11 Correct 942 ms 27880 KB Output is correct
12 Correct 1044 ms 24760 KB Output is correct
13 Correct 1083 ms 27472 KB Output is correct
14 Correct 990 ms 18828 KB Output is correct
15 Correct 786 ms 9708 KB Output is correct
16 Correct 1202 ms 20496 KB Output is correct
17 Correct 999 ms 18716 KB Output is correct
18 Correct 31 ms 2108 KB Output is correct
19 Correct 1125 ms 18744 KB Output is correct
20 Correct 906 ms 18392 KB Output is correct
21 Correct 782 ms 18408 KB Output is correct
22 Correct 646 ms 17076 KB Output is correct
23 Correct 625 ms 17016 KB Output is correct
24 Correct 733 ms 19968 KB Output is correct
25 Correct 623 ms 19812 KB Output is correct
26 Correct 1407 ms 26268 KB Output is correct
27 Correct 1559 ms 28076 KB Output is correct
28 Correct 1298 ms 26072 KB Output is correct
29 Correct 896 ms 25712 KB Output is correct
30 Correct 1490 ms 28172 KB Output is correct
31 Correct 1506 ms 27884 KB Output is correct
32 Correct 1519 ms 28064 KB Output is correct
33 Correct 1265 ms 26072 KB Output is correct
34 Correct 1275 ms 26032 KB Output is correct
35 Correct 1302 ms 26252 KB Output is correct
36 Correct 971 ms 25812 KB Output is correct
37 Correct 935 ms 25828 KB Output is correct
38 Correct 927 ms 25864 KB Output is correct
39 Correct 766 ms 24288 KB Output is correct
40 Correct 763 ms 24344 KB Output is correct
41 Correct 757 ms 24428 KB Output is correct
42 Correct 760 ms 26508 KB Output is correct
43 Correct 753 ms 26408 KB Output is correct
44 Correct 745 ms 26152 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 35 ms 2636 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 34 ms 2904 KB Output is correct
6 Correct 26 ms 2516 KB Output is correct
7 Correct 31 ms 3416 KB Output is correct
8 Correct 36 ms 2636 KB Output is correct
9 Correct 43 ms 4224 KB Output is correct
10 Correct 36 ms 2748 KB Output is correct
11 Correct 37 ms 2644 KB Output is correct
12 Correct 43 ms 2868 KB Output is correct
13 Correct 44 ms 2764 KB Output is correct
14 Correct 42 ms 2644 KB Output is correct
15 Correct 43 ms 2692 KB Output is correct
16 Correct 39 ms 3972 KB Output is correct
17 Correct 38 ms 3404 KB Output is correct
18 Correct 1213 ms 26136 KB Output is correct
19 Correct 1240 ms 26144 KB Output is correct
20 Correct 1254 ms 26104 KB Output is correct
21 Correct 1233 ms 26160 KB Output is correct
22 Correct 1335 ms 26308 KB Output is correct
23 Correct 1870 ms 28104 KB Output is correct
24 Correct 1839 ms 27828 KB Output is correct
25 Correct 1832 ms 28076 KB Output is correct
26 Correct 30 ms 2132 KB Output is correct
27 Correct 1016 ms 27992 KB Output is correct
28 Correct 942 ms 27880 KB Output is correct
29 Correct 1044 ms 24760 KB Output is correct
30 Correct 1083 ms 27472 KB Output is correct
31 Correct 990 ms 18828 KB Output is correct
32 Correct 786 ms 9708 KB Output is correct
33 Correct 1202 ms 20496 KB Output is correct
34 Correct 999 ms 18716 KB Output is correct
35 Correct 31 ms 2108 KB Output is correct
36 Correct 1125 ms 18744 KB Output is correct
37 Correct 906 ms 18392 KB Output is correct
38 Correct 782 ms 18408 KB Output is correct
39 Correct 646 ms 17076 KB Output is correct
40 Correct 625 ms 17016 KB Output is correct
41 Correct 733 ms 19968 KB Output is correct
42 Correct 623 ms 19812 KB Output is correct
43 Correct 1577 ms 24788 KB Output is correct
44 Correct 38 ms 3380 KB Output is correct
45 Correct 166 ms 4568 KB Output is correct
46 Correct 72 ms 4684 KB Output is correct
47 Correct 749 ms 27180 KB Output is correct
48 Correct 1443 ms 28628 KB Output is correct
49 Correct 759 ms 27192 KB Output is correct
50 Correct 707 ms 26608 KB Output is correct
51 Correct 703 ms 26792 KB Output is correct
52 Correct 730 ms 26576 KB Output is correct
53 Correct 1124 ms 27872 KB Output is correct
54 Correct 1084 ms 28084 KB Output is correct
55 Correct 1147 ms 27928 KB Output is correct
56 Correct 671 ms 27208 KB Output is correct
57 Correct 698 ms 27216 KB Output is correct
58 Correct 1475 ms 28820 KB Output is correct
59 Correct 1483 ms 28748 KB Output is correct
60 Correct 1466 ms 29048 KB Output is correct
61 Correct 1484 ms 28996 KB Output is correct
62 Correct 1312 ms 28284 KB Output is correct
63 Correct 1253 ms 28248 KB Output is correct
64 Correct 1428 ms 28292 KB Output is correct
65 Correct 798 ms 25032 KB Output is correct
66 Correct 1407 ms 26268 KB Output is correct
67 Correct 1559 ms 28076 KB Output is correct
68 Correct 1298 ms 26072 KB Output is correct
69 Correct 896 ms 25712 KB Output is correct
70 Correct 1490 ms 28172 KB Output is correct
71 Correct 1506 ms 27884 KB Output is correct
72 Correct 1519 ms 28064 KB Output is correct
73 Correct 1265 ms 26072 KB Output is correct
74 Correct 1275 ms 26032 KB Output is correct
75 Correct 1302 ms 26252 KB Output is correct
76 Correct 971 ms 25812 KB Output is correct
77 Correct 935 ms 25828 KB Output is correct
78 Correct 927 ms 25864 KB Output is correct
79 Correct 766 ms 24288 KB Output is correct
80 Correct 763 ms 24344 KB Output is correct
81 Correct 757 ms 24428 KB Output is correct
82 Correct 760 ms 26508 KB Output is correct
83 Correct 753 ms 26408 KB Output is correct
84 Correct 745 ms 26152 KB Output is correct
85 Correct 1790 ms 30984 KB Output is correct
86 Correct 181 ms 6584 KB Output is correct
87 Correct 113 ms 8008 KB Output is correct
88 Correct 1077 ms 31200 KB Output is correct
89 Correct 1767 ms 30956 KB Output is correct
90 Correct 1088 ms 31248 KB Output is correct
91 Correct 1318 ms 28888 KB Output is correct
92 Correct 1309 ms 28800 KB Output is correct
93 Correct 1904 ms 30312 KB Output is correct
94 Correct 1516 ms 30392 KB Output is correct
95 Correct 1541 ms 30480 KB Output is correct
96 Correct 1825 ms 32224 KB Output is correct
97 Correct 847 ms 27904 KB Output is correct
98 Correct 870 ms 31040 KB Output is correct
99 Correct 1821 ms 31360 KB Output is correct
100 Correct 1817 ms 31120 KB Output is correct
101 Correct 1857 ms 31408 KB Output is correct
102 Correct 1857 ms 31496 KB Output is correct
103 Correct 2001 ms 32460 KB Output is correct
104 Correct 1985 ms 32236 KB Output is correct
105 Correct 1484 ms 32168 KB Output is correct
106 Correct 1227 ms 31492 KB Output is correct
107 Correct 1357 ms 28808 KB Output is correct
108 Correct 1843 ms 31224 KB Output is correct
109 Correct 1320 ms 28896 KB Output is correct