oj.uz

Submission #204417

# Submission time Handle Problem Language Result Execution time Memory
204417 2020-02-25T17:31:29 Z dolphingarlic Bridges (APIO19_bridges) C++14
100 / 100
 2444 ms 29352 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
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:32:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (stck.size() > x) {
         ~~~~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:81:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while (ptr < unchanged.size() && w[unchanged[ptr]] >= y[i]) {
           ~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 43 ms 2808 KB Output is correct
4 Correct 9 ms 632 KB Output is correct
5 Correct 43 ms 2936 KB Output is correct
6 Correct 34 ms 2680 KB Output is correct
7 Correct 41 ms 3576 KB Output is correct
8 Correct 46 ms 2680 KB Output is correct
9 Correct 52 ms 4344 KB Output is correct
10 Correct 45 ms 2808 KB Output is correct
11 Correct 45 ms 2680 KB Output is correct
12 Correct 54 ms 2808 KB Output is correct
13 Correct 52 ms 2808 KB Output is correct
14 Correct 48 ms 2680 KB Output is correct
15 Correct 54 ms 2684 KB Output is correct
16 Correct 48 ms 3960 KB Output is correct
17 Correct 47 ms 3448 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1451 ms 26204 KB Output is correct
2 Correct 1463 ms 26248 KB Output is correct
3 Correct 1482 ms 26288 KB Output is correct
4 Correct 1540 ms 26212 KB Output is correct
5 Correct 1529 ms 26452 KB Output is correct
6 Correct 2255 ms 28368 KB Output is correct
7 Correct 2229 ms 28104 KB Output is correct
8 Correct 2241 ms 28376 KB Output is correct
9 Correct 48 ms 2168 KB Output is correct
10 Correct 1274 ms 28120 KB Output is correct
11 Correct 1154 ms 28104 KB Output is correct
12 Correct 1282 ms 24864 KB Output is correct
13 Correct 1296 ms 27472 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1196 ms 18708 KB Output is correct
2 Correct 918 ms 10104 KB Output is correct
3 Correct 1466 ms 20612 KB Output is correct
4 Correct 1178 ms 18792 KB Output is correct
5 Correct 46 ms 2172 KB Output is correct
6 Correct 1359 ms 19000 KB Output is correct
7 Correct 1089 ms 18588 KB Output is correct
8 Correct 932 ms 18472 KB Output is correct
9 Correct 778 ms 17144 KB Output is correct
10 Correct 707 ms 17124 KB Output is correct
11 Correct 843 ms 20092 KB Output is correct
12 Correct 721 ms 19964 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1709 ms 24960 KB Output is correct
2 Correct 47 ms 2296 KB Output is correct
3 Correct 186 ms 2888 KB Output is correct
4 Correct 92 ms 2908 KB Output is correct
5 Correct 852 ms 25360 KB Output is correct
6 Correct 1663 ms 25256 KB Output is correct
7 Correct 841 ms 25232 KB Output is correct
8 Correct 826 ms 24224 KB Output is correct
9 Correct 819 ms 24108 KB Output is correct
10 Correct 832 ms 24272 KB Output is correct
11 Correct 1263 ms 25024 KB Output is correct
12 Correct 1254 ms 24900 KB Output is correct
13 Correct 1310 ms 25284 KB Output is correct
14 Correct 741 ms 25240 KB Output is correct
15 Correct 794 ms 25220 KB Output is correct
16 Correct 1703 ms 25496 KB Output is correct
17 Correct 1707 ms 25376 KB Output is correct
18 Correct 1679 ms 25444 KB Output is correct
19 Correct 1675 ms 25548 KB Output is correct
20 Correct 1416 ms 25388 KB Output is correct
21 Correct 1419 ms 25380 KB Output is correct
22 Correct 1634 ms 25208 KB Output is correct
23 Correct 935 ms 23172 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1451 ms 26204 KB Output is correct
2 Correct 1463 ms 26248 KB Output is correct
3 Correct 1482 ms 26288 KB Output is correct
4 Correct 1540 ms 26212 KB Output is correct
5 Correct 1529 ms 26452 KB Output is correct
6 Correct 2255 ms 28368 KB Output is correct
7 Correct 2229 ms 28104 KB Output is correct
8 Correct 2241 ms 28376 KB Output is correct
9 Correct 48 ms 2168 KB Output is correct
10 Correct 1274 ms 28120 KB Output is correct
11 Correct 1154 ms 28104 KB Output is correct
12 Correct 1282 ms 24864 KB Output is correct
13 Correct 1296 ms 27472 KB Output is correct
14 Correct 1196 ms 18708 KB Output is correct
15 Correct 918 ms 10104 KB Output is correct
16 Correct 1466 ms 20612 KB Output is correct
17 Correct 1178 ms 18792 KB Output is correct
18 Correct 46 ms 2172 KB Output is correct
19 Correct 1359 ms 19000 KB Output is correct
20 Correct 1089 ms 18588 KB Output is correct
21 Correct 932 ms 18472 KB Output is correct
22 Correct 778 ms 17144 KB Output is correct
23 Correct 707 ms 17124 KB Output is correct
24 Correct 843 ms 20092 KB Output is correct
25 Correct 721 ms 19964 KB Output is correct
26 Correct 1592 ms 26624 KB Output is correct
27 Correct 1911 ms 28236 KB Output is correct
28 Correct 1558 ms 26452 KB Output is correct
29 Correct 1117 ms 26044 KB Output is correct
30 Correct 1804 ms 27832 KB Output is correct
31 Correct 1843 ms 28060 KB Output is correct
32 Correct 1866 ms 27976 KB Output is correct
33 Correct 1557 ms 26228 KB Output is correct
34 Correct 1572 ms 26204 KB Output is correct
35 Correct 1559 ms 26324 KB Output is correct
36 Correct 1156 ms 25896 KB Output is correct
37 Correct 1139 ms 25932 KB Output is correct
38 Correct 1138 ms 26064 KB Output is correct
39 Correct 941 ms 24496 KB Output is correct
40 Correct 934 ms 24580 KB Output is correct
41 Correct 926 ms 24624 KB Output is correct
42 Correct 930 ms 26576 KB Output is correct
43 Correct 920 ms 26448 KB Output is correct
44 Correct 916 ms 26464 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 43 ms 2808 KB Output is correct
4 Correct 9 ms 632 KB Output is correct
5 Correct 43 ms 2936 KB Output is correct
6 Correct 34 ms 2680 KB Output is correct
7 Correct 41 ms 3576 KB Output is correct
8 Correct 46 ms 2680 KB Output is correct
9 Correct 52 ms 4344 KB Output is correct
10 Correct 45 ms 2808 KB Output is correct
11 Correct 45 ms 2680 KB Output is correct
12 Correct 54 ms 2808 KB Output is correct
13 Correct 52 ms 2808 KB Output is correct
14 Correct 48 ms 2680 KB Output is correct
15 Correct 54 ms 2684 KB Output is correct
16 Correct 48 ms 3960 KB Output is correct
17 Correct 47 ms 3448 KB Output is correct
18 Correct 1451 ms 26204 KB Output is correct
19 Correct 1463 ms 26248 KB Output is correct
20 Correct 1482 ms 26288 KB Output is correct
21 Correct 1540 ms 26212 KB Output is correct
22 Correct 1529 ms 26452 KB Output is correct
23 Correct 2255 ms 28368 KB Output is correct
24 Correct 2229 ms 28104 KB Output is correct
25 Correct 2241 ms 28376 KB Output is correct
26 Correct 48 ms 2168 KB Output is correct
27 Correct 1274 ms 28120 KB Output is correct
28 Correct 1154 ms 28104 KB Output is correct
29 Correct 1282 ms 24864 KB Output is correct
30 Correct 1296 ms 27472 KB Output is correct
31 Correct 1196 ms 18708 KB Output is correct
32 Correct 918 ms 10104 KB Output is correct
33 Correct 1466 ms 20612 KB Output is correct
34 Correct 1178 ms 18792 KB Output is correct
35 Correct 46 ms 2172 KB Output is correct
36 Correct 1359 ms 19000 KB Output is correct
37 Correct 1089 ms 18588 KB Output is correct
38 Correct 932 ms 18472 KB Output is correct
39 Correct 778 ms 17144 KB Output is correct
40 Correct 707 ms 17124 KB Output is correct
41 Correct 843 ms 20092 KB Output is correct
42 Correct 721 ms 19964 KB Output is correct
43 Correct 1709 ms 24960 KB Output is correct
44 Correct 47 ms 2296 KB Output is correct
45 Correct 186 ms 2888 KB Output is correct
46 Correct 92 ms 2908 KB Output is correct
47 Correct 852 ms 25360 KB Output is correct
48 Correct 1663 ms 25256 KB Output is correct
49 Correct 841 ms 25232 KB Output is correct
50 Correct 826 ms 24224 KB Output is correct
51 Correct 819 ms 24108 KB Output is correct
52 Correct 832 ms 24272 KB Output is correct
53 Correct 1263 ms 25024 KB Output is correct
54 Correct 1254 ms 24900 KB Output is correct
55 Correct 1310 ms 25284 KB Output is correct
56 Correct 741 ms 25240 KB Output is correct
57 Correct 794 ms 25220 KB Output is correct
58 Correct 1703 ms 25496 KB Output is correct
59 Correct 1707 ms 25376 KB Output is correct
60 Correct 1679 ms 25444 KB Output is correct
61 Correct 1675 ms 25548 KB Output is correct
62 Correct 1416 ms 25388 KB Output is correct
63 Correct 1419 ms 25380 KB Output is correct
64 Correct 1634 ms 25208 KB Output is correct
65 Correct 935 ms 23172 KB Output is correct
66 Correct 1592 ms 26624 KB Output is correct
67 Correct 1911 ms 28236 KB Output is correct
68 Correct 1558 ms 26452 KB Output is correct
69 Correct 1117 ms 26044 KB Output is correct
70 Correct 1804 ms 27832 KB Output is correct
71 Correct 1843 ms 28060 KB Output is correct
72 Correct 1866 ms 27976 KB Output is correct
73 Correct 1557 ms 26228 KB Output is correct
74 Correct 1572 ms 26204 KB Output is correct
75 Correct 1559 ms 26324 KB Output is correct
76 Correct 1156 ms 25896 KB Output is correct
77 Correct 1139 ms 25932 KB Output is correct
78 Correct 1138 ms 26064 KB Output is correct
79 Correct 941 ms 24496 KB Output is correct
80 Correct 934 ms 24580 KB Output is correct
81 Correct 926 ms 24624 KB Output is correct
82 Correct 930 ms 26576 KB Output is correct
83 Correct 920 ms 26448 KB Output is correct
84 Correct 916 ms 26464 KB Output is correct
85 Correct 2200 ms 27392 KB Output is correct
86 Correct 220 ms 4928 KB Output is correct
87 Correct 142 ms 6204 KB Output is correct
88 Correct 1322 ms 29212 KB Output is correct
89 Correct 2182 ms 27552 KB Output is correct
90 Correct 1311 ms 29072 KB Output is correct
91 Correct 1605 ms 26424 KB Output is correct
92 Correct 1583 ms 26164 KB Output is correct
93 Correct 2334 ms 27860 KB Output is correct
94 Correct 1868 ms 27588 KB Output is correct
95 Correct 1859 ms 27464 KB Output is correct
96 Correct 2229 ms 29276 KB Output is correct
97 Correct 976 ms 25740 KB Output is correct
98 Correct 1055 ms 28824 KB Output is correct
99 Correct 2222 ms 28036 KB Output is correct
100 Correct 2192 ms 27576 KB Output is correct
101 Correct 2285 ms 28004 KB Output is correct
102 Correct 2258 ms 28140 KB Output is correct
103 Correct 2444 ms 29352 KB Output is correct
104 Correct 2440 ms 29352 KB Output is correct
105 Correct 1803 ms 28836 KB Output is correct
106 Correct 1462 ms 28740 KB Output is correct
107 Correct 1692 ms 25628 KB Output is correct
108 Correct 2282 ms 27636 KB Output is correct
109 Correct 1638 ms 27204 KB Output is correct