oj.uz

Submission #654113

# Submission time Handle Problem Language Result Execution time Memory
654113 2022-10-30T02:55:15 Z LeonaRaging Bridges (APIO19_bridges) C++14
100 / 100
 2029 ms 32224 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 1 ms 340 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 34 ms 2892 KB Output is correct
4 Correct 4 ms 652 KB Output is correct
5 Correct 38 ms 3020 KB Output is correct
6 Correct 27 ms 2740 KB Output is correct
7 Correct 33 ms 3484 KB Output is correct
8 Correct 39 ms 2788 KB Output is correct
9 Correct 46 ms 4400 KB Output is correct
10 Correct 38 ms 2912 KB Output is correct
11 Correct 38 ms 2712 KB Output is correct
12 Correct 47 ms 3004 KB Output is correct
13 Correct 42 ms 2892 KB Output is correct
14 Correct 41 ms 2816 KB Output is correct
15 Correct 49 ms 2816 KB Output is correct
16 Correct 41 ms 4052 KB Output is correct
17 Correct 45 ms 3524 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1254 ms 28876 KB Output is correct
2 Correct 1254 ms 28816 KB Output is correct
3 Correct 1272 ms 28832 KB Output is correct
4 Correct 1304 ms 28856 KB Output is correct
5 Correct 1305 ms 29068 KB Output is correct
6 Correct 1869 ms 30480 KB Output is correct
7 Correct 1913 ms 30432 KB Output is correct
8 Correct 1907 ms 30440 KB Output is correct
9 Correct 40 ms 3404 KB Output is correct
10 Correct 1099 ms 29664 KB Output is correct
11 Correct 999 ms 29568 KB Output is correct
12 Correct 1101 ms 27492 KB Output is correct
13 Correct 1103 ms 30164 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1048 ms 20960 KB Output is correct
2 Correct 819 ms 11272 KB Output is correct
3 Correct 1273 ms 22692 KB Output is correct
4 Correct 1025 ms 21192 KB Output is correct
5 Correct 33 ms 3404 KB Output is correct
6 Correct 1163 ms 21020 KB Output is correct
7 Correct 909 ms 20636 KB Output is correct
8 Correct 790 ms 20796 KB Output is correct
9 Correct 649 ms 19404 KB Output is correct
10 Correct 583 ms 19384 KB Output is correct
11 Correct 697 ms 22240 KB Output is correct
12 Correct 627 ms 22040 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1415 ms 28816 KB Output is correct
2 Correct 38 ms 3568 KB Output is correct
3 Correct 148 ms 4740 KB Output is correct
4 Correct 70 ms 4708 KB Output is correct
5 Correct 719 ms 27212 KB Output is correct
6 Correct 1398 ms 28640 KB Output is correct
7 Correct 722 ms 27128 KB Output is correct
8 Correct 698 ms 26628 KB Output is correct
9 Correct 695 ms 26696 KB Output is correct
10 Correct 676 ms 26704 KB Output is correct
11 Correct 1028 ms 27904 KB Output is correct
12 Correct 1032 ms 28160 KB Output is correct
13 Correct 1037 ms 28080 KB Output is correct
14 Correct 626 ms 27332 KB Output is correct
15 Correct 696 ms 27220 KB Output is correct
16 Correct 1449 ms 28876 KB Output is correct
17 Correct 1442 ms 28896 KB Output is correct
18 Correct 1398 ms 29140 KB Output is correct
19 Correct 1379 ms 29280 KB Output is correct
20 Correct 1164 ms 28336 KB Output is correct
21 Correct 1169 ms 28316 KB Output is correct
22 Correct 1350 ms 28440 KB Output is correct
23 Correct 781 ms 24988 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1254 ms 28876 KB Output is correct
2 Correct 1254 ms 28816 KB Output is correct
3 Correct 1272 ms 28832 KB Output is correct
4 Correct 1304 ms 28856 KB Output is correct
5 Correct 1305 ms 29068 KB Output is correct
6 Correct 1869 ms 30480 KB Output is correct
7 Correct 1913 ms 30432 KB Output is correct
8 Correct 1907 ms 30440 KB Output is correct
9 Correct 40 ms 3404 KB Output is correct
10 Correct 1099 ms 29664 KB Output is correct
11 Correct 999 ms 29568 KB Output is correct
12 Correct 1101 ms 27492 KB Output is correct
13 Correct 1103 ms 30164 KB Output is correct
14 Correct 1048 ms 20960 KB Output is correct
15 Correct 819 ms 11272 KB Output is correct
16 Correct 1273 ms 22692 KB Output is correct
17 Correct 1025 ms 21192 KB Output is correct
18 Correct 33 ms 3404 KB Output is correct
19 Correct 1163 ms 21020 KB Output is correct
20 Correct 909 ms 20636 KB Output is correct
21 Correct 790 ms 20796 KB Output is correct
22 Correct 649 ms 19404 KB Output is correct
23 Correct 583 ms 19384 KB Output is correct
24 Correct 697 ms 22240 KB Output is correct
25 Correct 627 ms 22040 KB Output is correct
26 Correct 1331 ms 28960 KB Output is correct
27 Correct 1588 ms 30500 KB Output is correct
28 Correct 1287 ms 28944 KB Output is correct
29 Correct 910 ms 28612 KB Output is correct
30 Correct 1497 ms 30432 KB Output is correct
31 Correct 1532 ms 30568 KB Output is correct
32 Correct 1515 ms 30492 KB Output is correct
33 Correct 1286 ms 29088 KB Output is correct
34 Correct 1273 ms 28904 KB Output is correct
35 Correct 1278 ms 28880 KB Output is correct
36 Correct 952 ms 28636 KB Output is correct
37 Correct 950 ms 28780 KB Output is correct
38 Correct 940 ms 28452 KB Output is correct
39 Correct 794 ms 27280 KB Output is correct
40 Correct 800 ms 27264 KB Output is correct
41 Correct 756 ms 27108 KB Output is correct
42 Correct 759 ms 29140 KB Output is correct
43 Correct 756 ms 29216 KB Output is correct
44 Correct 755 ms 28940 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 34 ms 2892 KB Output is correct
4 Correct 4 ms 652 KB Output is correct
5 Correct 38 ms 3020 KB Output is correct
6 Correct 27 ms 2740 KB Output is correct
7 Correct 33 ms 3484 KB Output is correct
8 Correct 39 ms 2788 KB Output is correct
9 Correct 46 ms 4400 KB Output is correct
10 Correct 38 ms 2912 KB Output is correct
11 Correct 38 ms 2712 KB Output is correct
12 Correct 47 ms 3004 KB Output is correct
13 Correct 42 ms 2892 KB Output is correct
14 Correct 41 ms 2816 KB Output is correct
15 Correct 49 ms 2816 KB Output is correct
16 Correct 41 ms 4052 KB Output is correct
17 Correct 45 ms 3524 KB Output is correct
18 Correct 1254 ms 28876 KB Output is correct
19 Correct 1254 ms 28816 KB Output is correct
20 Correct 1272 ms 28832 KB Output is correct
21 Correct 1304 ms 28856 KB Output is correct
22 Correct 1305 ms 29068 KB Output is correct
23 Correct 1869 ms 30480 KB Output is correct
24 Correct 1913 ms 30432 KB Output is correct
25 Correct 1907 ms 30440 KB Output is correct
26 Correct 40 ms 3404 KB Output is correct
27 Correct 1099 ms 29664 KB Output is correct
28 Correct 999 ms 29568 KB Output is correct
29 Correct 1101 ms 27492 KB Output is correct
30 Correct 1103 ms 30164 KB Output is correct
31 Correct 1048 ms 20960 KB Output is correct
32 Correct 819 ms 11272 KB Output is correct
33 Correct 1273 ms 22692 KB Output is correct
34 Correct 1025 ms 21192 KB Output is correct
35 Correct 33 ms 3404 KB Output is correct
36 Correct 1163 ms 21020 KB Output is correct
37 Correct 909 ms 20636 KB Output is correct
38 Correct 790 ms 20796 KB Output is correct
39 Correct 649 ms 19404 KB Output is correct
40 Correct 583 ms 19384 KB Output is correct
41 Correct 697 ms 22240 KB Output is correct
42 Correct 627 ms 22040 KB Output is correct
43 Correct 1415 ms 28816 KB Output is correct
44 Correct 38 ms 3568 KB Output is correct
45 Correct 148 ms 4740 KB Output is correct
46 Correct 70 ms 4708 KB Output is correct
47 Correct 719 ms 27212 KB Output is correct
48 Correct 1398 ms 28640 KB Output is correct
49 Correct 722 ms 27128 KB Output is correct
50 Correct 698 ms 26628 KB Output is correct
51 Correct 695 ms 26696 KB Output is correct
52 Correct 676 ms 26704 KB Output is correct
53 Correct 1028 ms 27904 KB Output is correct
54 Correct 1032 ms 28160 KB Output is correct
55 Correct 1037 ms 28080 KB Output is correct
56 Correct 626 ms 27332 KB Output is correct
57 Correct 696 ms 27220 KB Output is correct
58 Correct 1449 ms 28876 KB Output is correct
59 Correct 1442 ms 28896 KB Output is correct
60 Correct 1398 ms 29140 KB Output is correct
61 Correct 1379 ms 29280 KB Output is correct
62 Correct 1164 ms 28336 KB Output is correct
63 Correct 1169 ms 28316 KB Output is correct
64 Correct 1350 ms 28440 KB Output is correct
65 Correct 781 ms 24988 KB Output is correct
66 Correct 1331 ms 28960 KB Output is correct
67 Correct 1588 ms 30500 KB Output is correct
68 Correct 1287 ms 28944 KB Output is correct
69 Correct 910 ms 28612 KB Output is correct
70 Correct 1497 ms 30432 KB Output is correct
71 Correct 1532 ms 30568 KB Output is correct
72 Correct 1515 ms 30492 KB Output is correct
73 Correct 1286 ms 29088 KB Output is correct
74 Correct 1273 ms 28904 KB Output is correct
75 Correct 1278 ms 28880 KB Output is correct
76 Correct 952 ms 28636 KB Output is correct
77 Correct 950 ms 28780 KB Output is correct
78 Correct 940 ms 28452 KB Output is correct
79 Correct 794 ms 27280 KB Output is correct
80 Correct 800 ms 27264 KB Output is correct
81 Correct 756 ms 27108 KB Output is correct
82 Correct 759 ms 29140 KB Output is correct
83 Correct 756 ms 29216 KB Output is correct
84 Correct 755 ms 28940 KB Output is correct
85 Correct 1825 ms 30912 KB Output is correct
86 Correct 183 ms 6848 KB Output is correct
87 Correct 119 ms 8028 KB Output is correct
88 Correct 1145 ms 31252 KB Output is correct
89 Correct 1825 ms 31004 KB Output is correct
90 Correct 1154 ms 31296 KB Output is correct
91 Correct 1346 ms 28860 KB Output is correct
92 Correct 1327 ms 28708 KB Output is correct
93 Correct 1915 ms 30260 KB Output is correct
94 Correct 1530 ms 30424 KB Output is correct
95 Correct 1536 ms 30408 KB Output is correct
96 Correct 1911 ms 32068 KB Output is correct
97 Correct 909 ms 27808 KB Output is correct
98 Correct 948 ms 30800 KB Output is correct
99 Correct 1825 ms 31344 KB Output is correct
100 Correct 1811 ms 31036 KB Output is correct
101 Correct 1880 ms 31352 KB Output is correct
102 Correct 1857 ms 31404 KB Output is correct
103 Correct 2015 ms 32224 KB Output is correct
104 Correct 2029 ms 32204 KB Output is correct
105 Correct 1479 ms 32192 KB Output is correct
106 Correct 1191 ms 31764 KB Output is correct
107 Correct 1397 ms 28872 KB Output is correct
108 Correct 1868 ms 31040 KB Output is correct
109 Correct 1348 ms 28864 KB Output is correct