oj.uz

Submission #636596

# Submission time Handle Problem Language Result Execution time Memory
636596 2022-08-29T16:32:53 Z usaco Bridges (APIO19_bridges) C++14
100 / 100
 1993 ms 32304 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 32 ms 2708 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 35 ms 3020 KB Output is correct
6 Correct 26 ms 2764 KB Output is correct
7 Correct 31 ms 3544 KB Output is correct
8 Correct 34 ms 2696 KB Output is correct
9 Correct 41 ms 4300 KB Output is correct
10 Correct 36 ms 2840 KB Output is correct
11 Correct 36 ms 2764 KB Output is correct
12 Correct 42 ms 2924 KB Output is correct
13 Correct 41 ms 2796 KB Output is correct
14 Correct 37 ms 2704 KB Output is correct
15 Correct 42 ms 2736 KB Output is correct
16 Correct 37 ms 4024 KB Output is correct
17 Correct 37 ms 3460 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1199 ms 26176 KB Output is correct
2 Correct 1187 ms 26296 KB Output is correct
3 Correct 1203 ms 26292 KB Output is correct
4 Correct 1233 ms 26292 KB Output is correct
5 Correct 1242 ms 26416 KB Output is correct
6 Correct 1825 ms 29268 KB Output is correct
7 Correct 1834 ms 30376 KB Output is correct
8 Correct 1809 ms 30764 KB Output is correct
9 Correct 33 ms 3384 KB Output is correct
10 Correct 1018 ms 29576 KB Output is correct
11 Correct 932 ms 29744 KB Output is correct
12 Correct 1047 ms 27164 KB Output is correct
13 Correct 1057 ms 30160 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 987 ms 18648 KB Output is correct
2 Correct 787 ms 11356 KB Output is correct
3 Correct 1196 ms 22772 KB Output is correct
4 Correct 966 ms 21236 KB Output is correct
5 Correct 33 ms 3404 KB Output is correct
6 Correct 1155 ms 21200 KB Output is correct
7 Correct 887 ms 20644 KB Output is correct
8 Correct 781 ms 20528 KB Output is correct
9 Correct 653 ms 19520 KB Output is correct
10 Correct 576 ms 19252 KB Output is correct
11 Correct 687 ms 22116 KB Output is correct
12 Correct 605 ms 22120 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1389 ms 24836 KB Output is correct
2 Correct 31 ms 2044 KB Output is correct
3 Correct 143 ms 2668 KB Output is correct
4 Correct 67 ms 2708 KB Output is correct
5 Correct 704 ms 24844 KB Output is correct
6 Correct 1324 ms 24980 KB Output is correct
7 Correct 681 ms 24896 KB Output is correct
8 Correct 661 ms 23968 KB Output is correct
9 Correct 655 ms 23960 KB Output is correct
10 Correct 662 ms 24216 KB Output is correct
11 Correct 1002 ms 24744 KB Output is correct
12 Correct 1000 ms 24876 KB Output is correct
13 Correct 1067 ms 24952 KB Output is correct
14 Correct 613 ms 24940 KB Output is correct
15 Correct 665 ms 24968 KB Output is correct
16 Correct 1353 ms 25260 KB Output is correct
17 Correct 1372 ms 25300 KB Output is correct
18 Correct 1347 ms 25304 KB Output is correct
19 Correct 1356 ms 25236 KB Output is correct
20 Correct 1126 ms 25136 KB Output is correct
21 Correct 1125 ms 25140 KB Output is correct
22 Correct 1295 ms 24820 KB Output is correct
23 Correct 743 ms 22836 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1199 ms 26176 KB Output is correct
2 Correct 1187 ms 26296 KB Output is correct
3 Correct 1203 ms 26292 KB Output is correct
4 Correct 1233 ms 26292 KB Output is correct
5 Correct 1242 ms 26416 KB Output is correct
6 Correct 1825 ms 29268 KB Output is correct
7 Correct 1834 ms 30376 KB Output is correct
8 Correct 1809 ms 30764 KB Output is correct
9 Correct 33 ms 3384 KB Output is correct
10 Correct 1018 ms 29576 KB Output is correct
11 Correct 932 ms 29744 KB Output is correct
12 Correct 1047 ms 27164 KB Output is correct
13 Correct 1057 ms 30160 KB Output is correct
14 Correct 987 ms 18648 KB Output is correct
15 Correct 787 ms 11356 KB Output is correct
16 Correct 1196 ms 22772 KB Output is correct
17 Correct 966 ms 21236 KB Output is correct
18 Correct 33 ms 3404 KB Output is correct
19 Correct 1155 ms 21200 KB Output is correct
20 Correct 887 ms 20644 KB Output is correct
21 Correct 781 ms 20528 KB Output is correct
22 Correct 653 ms 19520 KB Output is correct
23 Correct 576 ms 19252 KB Output is correct
24 Correct 687 ms 22116 KB Output is correct
25 Correct 605 ms 22120 KB Output is correct
26 Correct 1281 ms 29096 KB Output is correct
27 Correct 1524 ms 30492 KB Output is correct
28 Correct 1285 ms 28896 KB Output is correct
29 Correct 901 ms 28412 KB Output is correct
30 Correct 1447 ms 30620 KB Output is correct
31 Correct 1485 ms 30520 KB Output is correct
32 Correct 1505 ms 30512 KB Output is correct
33 Correct 1274 ms 28896 KB Output is correct
34 Correct 1253 ms 28888 KB Output is correct
35 Correct 1257 ms 28924 KB Output is correct
36 Correct 943 ms 28544 KB Output is correct
37 Correct 929 ms 28460 KB Output is correct
38 Correct 919 ms 28588 KB Output is correct
39 Correct 761 ms 27140 KB Output is correct
40 Correct 760 ms 27072 KB Output is correct
41 Correct 751 ms 27292 KB Output is correct
42 Correct 754 ms 29196 KB Output is correct
43 Correct 747 ms 29128 KB Output is correct
44 Correct 740 ms 29016 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 32 ms 2708 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 35 ms 3020 KB Output is correct
6 Correct 26 ms 2764 KB Output is correct
7 Correct 31 ms 3544 KB Output is correct
8 Correct 34 ms 2696 KB Output is correct
9 Correct 41 ms 4300 KB Output is correct
10 Correct 36 ms 2840 KB Output is correct
11 Correct 36 ms 2764 KB Output is correct
12 Correct 42 ms 2924 KB Output is correct
13 Correct 41 ms 2796 KB Output is correct
14 Correct 37 ms 2704 KB Output is correct
15 Correct 42 ms 2736 KB Output is correct
16 Correct 37 ms 4024 KB Output is correct
17 Correct 37 ms 3460 KB Output is correct
18 Correct 1199 ms 26176 KB Output is correct
19 Correct 1187 ms 26296 KB Output is correct
20 Correct 1203 ms 26292 KB Output is correct
21 Correct 1233 ms 26292 KB Output is correct
22 Correct 1242 ms 26416 KB Output is correct
23 Correct 1825 ms 29268 KB Output is correct
24 Correct 1834 ms 30376 KB Output is correct
25 Correct 1809 ms 30764 KB Output is correct
26 Correct 33 ms 3384 KB Output is correct
27 Correct 1018 ms 29576 KB Output is correct
28 Correct 932 ms 29744 KB Output is correct
29 Correct 1047 ms 27164 KB Output is correct
30 Correct 1057 ms 30160 KB Output is correct
31 Correct 987 ms 18648 KB Output is correct
32 Correct 787 ms 11356 KB Output is correct
33 Correct 1196 ms 22772 KB Output is correct
34 Correct 966 ms 21236 KB Output is correct
35 Correct 33 ms 3404 KB Output is correct
36 Correct 1155 ms 21200 KB Output is correct
37 Correct 887 ms 20644 KB Output is correct
38 Correct 781 ms 20528 KB Output is correct
39 Correct 653 ms 19520 KB Output is correct
40 Correct 576 ms 19252 KB Output is correct
41 Correct 687 ms 22116 KB Output is correct
42 Correct 605 ms 22120 KB Output is correct
43 Correct 1389 ms 24836 KB Output is correct
44 Correct 31 ms 2044 KB Output is correct
45 Correct 143 ms 2668 KB Output is correct
46 Correct 67 ms 2708 KB Output is correct
47 Correct 704 ms 24844 KB Output is correct
48 Correct 1324 ms 24980 KB Output is correct
49 Correct 681 ms 24896 KB Output is correct
50 Correct 661 ms 23968 KB Output is correct
51 Correct 655 ms 23960 KB Output is correct
52 Correct 662 ms 24216 KB Output is correct
53 Correct 1002 ms 24744 KB Output is correct
54 Correct 1000 ms 24876 KB Output is correct
55 Correct 1067 ms 24952 KB Output is correct
56 Correct 613 ms 24940 KB Output is correct
57 Correct 665 ms 24968 KB Output is correct
58 Correct 1353 ms 25260 KB Output is correct
59 Correct 1372 ms 25300 KB Output is correct
60 Correct 1347 ms 25304 KB Output is correct
61 Correct 1356 ms 25236 KB Output is correct
62 Correct 1126 ms 25136 KB Output is correct
63 Correct 1125 ms 25140 KB Output is correct
64 Correct 1295 ms 24820 KB Output is correct
65 Correct 743 ms 22836 KB Output is correct
66 Correct 1281 ms 29096 KB Output is correct
67 Correct 1524 ms 30492 KB Output is correct
68 Correct 1285 ms 28896 KB Output is correct
69 Correct 901 ms 28412 KB Output is correct
70 Correct 1447 ms 30620 KB Output is correct
71 Correct 1485 ms 30520 KB Output is correct
72 Correct 1505 ms 30512 KB Output is correct
73 Correct 1274 ms 28896 KB Output is correct
74 Correct 1253 ms 28888 KB Output is correct
75 Correct 1257 ms 28924 KB Output is correct
76 Correct 943 ms 28544 KB Output is correct
77 Correct 929 ms 28460 KB Output is correct
78 Correct 919 ms 28588 KB Output is correct
79 Correct 761 ms 27140 KB Output is correct
80 Correct 760 ms 27072 KB Output is correct
81 Correct 751 ms 27292 KB Output is correct
82 Correct 754 ms 29196 KB Output is correct
83 Correct 747 ms 29128 KB Output is correct
84 Correct 740 ms 29016 KB Output is correct
85 Correct 1783 ms 30976 KB Output is correct
86 Correct 175 ms 6588 KB Output is correct
87 Correct 111 ms 7940 KB Output is correct
88 Correct 1096 ms 31160 KB Output is correct
89 Correct 1761 ms 31216 KB Output is correct
90 Correct 1101 ms 31248 KB Output is correct
91 Correct 1290 ms 28800 KB Output is correct
92 Correct 1287 ms 28800 KB Output is correct
93 Correct 1921 ms 30196 KB Output is correct
94 Correct 1550 ms 30420 KB Output is correct
95 Correct 1568 ms 30360 KB Output is correct
96 Correct 1841 ms 31968 KB Output is correct
97 Correct 817 ms 27736 KB Output is correct
98 Correct 872 ms 30856 KB Output is correct
99 Correct 1814 ms 31384 KB Output is correct
100 Correct 1810 ms 31004 KB Output is correct
101 Correct 1838 ms 31332 KB Output is correct
102 Correct 1832 ms 31364 KB Output is correct
103 Correct 1993 ms 32304 KB Output is correct
104 Correct 1981 ms 32236 KB Output is correct
105 Correct 1467 ms 32040 KB Output is correct
106 Correct 1164 ms 31680 KB Output is correct
107 Correct 1409 ms 28904 KB Output is correct
108 Correct 1925 ms 31064 KB Output is correct
109 Correct 1384 ms 28892 KB Output is correct