oj.uz

Submission #865988

# Submission time Handle Problem Language Result Execution time Memory
865988 2023-10-25T09:08:25 Z colegih910 Bridges (APIO19_bridges) C++14
100 / 100
 1441 ms 32500 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:84:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |    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 2396 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 23 ms 4700 KB Output is correct
4 Correct 3 ms 2628 KB Output is correct
5 Correct 25 ms 5296 KB Output is correct
6 Correct 17 ms 4776 KB Output is correct
7 Correct 21 ms 5432 KB Output is correct
8 Correct 28 ms 4700 KB Output is correct
9 Correct 24 ms 6236 KB Output is correct
10 Correct 29 ms 4968 KB Output is correct
11 Correct 29 ms 4696 KB Output is correct
12 Correct 32 ms 4968 KB Output is correct
13 Correct 33 ms 4700 KB Output is correct
14 Correct 29 ms 4804 KB Output is correct
15 Correct 35 ms 4700 KB Output is correct
16 Correct 24 ms 5972 KB Output is correct
17 Correct 24 ms 5464 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 799 ms 29312 KB Output is correct
2 Correct 841 ms 29156 KB Output is correct
3 Correct 826 ms 29036 KB Output is correct
4 Correct 863 ms 29060 KB Output is correct
5 Correct 839 ms 29396 KB Output is correct
6 Correct 952 ms 31032 KB Output is correct
7 Correct 944 ms 30816 KB Output is correct
8 Correct 1008 ms 30668 KB Output is correct
9 Correct 26 ms 4184 KB Output is correct
10 Correct 535 ms 29740 KB Output is correct
11 Correct 470 ms 29824 KB Output is correct
12 Correct 693 ms 27332 KB Output is correct
13 Correct 727 ms 30496 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 21560 KB Output is correct
2 Correct 383 ms 11944 KB Output is correct
3 Correct 684 ms 23100 KB Output is correct
4 Correct 611 ms 21512 KB Output is correct
5 Correct 26 ms 4180 KB Output is correct
6 Correct 698 ms 21640 KB Output is correct
7 Correct 573 ms 21264 KB Output is correct
8 Correct 526 ms 21096 KB Output is correct
9 Correct 445 ms 19772 KB Output is correct
10 Correct 423 ms 19772 KB Output is correct
11 Correct 470 ms 22592 KB Output is correct
12 Correct 430 ms 22492 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1167 ms 28776 KB Output is correct
2 Correct 27 ms 4180 KB Output is correct
3 Correct 128 ms 6248 KB Output is correct
4 Correct 59 ms 6068 KB Output is correct
5 Correct 582 ms 27384 KB Output is correct
6 Correct 1142 ms 28880 KB Output is correct
7 Correct 580 ms 27260 KB Output is correct
8 Correct 576 ms 26964 KB Output is correct
9 Correct 539 ms 27180 KB Output is correct
10 Correct 563 ms 27332 KB Output is correct
11 Correct 870 ms 28064 KB Output is correct
12 Correct 840 ms 28312 KB Output is correct
13 Correct 870 ms 28084 KB Output is correct
14 Correct 513 ms 27248 KB Output is correct
15 Correct 586 ms 27212 KB Output is correct
16 Correct 1181 ms 29024 KB Output is correct
17 Correct 1171 ms 29036 KB Output is correct
18 Correct 1149 ms 29148 KB Output is correct
19 Correct 1206 ms 29440 KB Output is correct
20 Correct 970 ms 28460 KB Output is correct
21 Correct 997 ms 28356 KB Output is correct
22 Correct 1135 ms 28476 KB Output is correct
23 Correct 645 ms 25060 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 799 ms 29312 KB Output is correct
2 Correct 841 ms 29156 KB Output is correct
3 Correct 826 ms 29036 KB Output is correct
4 Correct 863 ms 29060 KB Output is correct
5 Correct 839 ms 29396 KB Output is correct
6 Correct 952 ms 31032 KB Output is correct
7 Correct 944 ms 30816 KB Output is correct
8 Correct 1008 ms 30668 KB Output is correct
9 Correct 26 ms 4184 KB Output is correct
10 Correct 535 ms 29740 KB Output is correct
11 Correct 470 ms 29824 KB Output is correct
12 Correct 693 ms 27332 KB Output is correct
13 Correct 727 ms 30496 KB Output is correct
14 Correct 623 ms 21560 KB Output is correct
15 Correct 383 ms 11944 KB Output is correct
16 Correct 684 ms 23100 KB Output is correct
17 Correct 611 ms 21512 KB Output is correct
18 Correct 26 ms 4180 KB Output is correct
19 Correct 698 ms 21640 KB Output is correct
20 Correct 573 ms 21264 KB Output is correct
21 Correct 526 ms 21096 KB Output is correct
22 Correct 445 ms 19772 KB Output is correct
23 Correct 423 ms 19772 KB Output is correct
24 Correct 470 ms 22592 KB Output is correct
25 Correct 430 ms 22492 KB Output is correct
26 Correct 880 ms 29160 KB Output is correct
27 Correct 889 ms 30672 KB Output is correct
28 Correct 851 ms 29084 KB Output is correct
29 Correct 674 ms 28808 KB Output is correct
30 Correct 882 ms 30864 KB Output is correct
31 Correct 935 ms 30712 KB Output is correct
32 Correct 958 ms 30652 KB Output is correct
33 Correct 856 ms 29316 KB Output is correct
34 Correct 837 ms 29128 KB Output is correct
35 Correct 815 ms 29132 KB Output is correct
36 Correct 734 ms 28872 KB Output is correct
37 Correct 685 ms 28728 KB Output is correct
38 Correct 715 ms 28820 KB Output is correct
39 Correct 594 ms 27300 KB Output is correct
40 Correct 602 ms 27652 KB Output is correct
41 Correct 594 ms 27372 KB Output is correct
42 Correct 589 ms 29468 KB Output is correct
43 Correct 607 ms 29640 KB Output is correct
44 Correct 596 ms 29240 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 23 ms 4700 KB Output is correct
4 Correct 3 ms 2628 KB Output is correct
5 Correct 25 ms 5296 KB Output is correct
6 Correct 17 ms 4776 KB Output is correct
7 Correct 21 ms 5432 KB Output is correct
8 Correct 28 ms 4700 KB Output is correct
9 Correct 24 ms 6236 KB Output is correct
10 Correct 29 ms 4968 KB Output is correct
11 Correct 29 ms 4696 KB Output is correct
12 Correct 32 ms 4968 KB Output is correct
13 Correct 33 ms 4700 KB Output is correct
14 Correct 29 ms 4804 KB Output is correct
15 Correct 35 ms 4700 KB Output is correct
16 Correct 24 ms 5972 KB Output is correct
17 Correct 24 ms 5464 KB Output is correct
18 Correct 799 ms 29312 KB Output is correct
19 Correct 841 ms 29156 KB Output is correct
20 Correct 826 ms 29036 KB Output is correct
21 Correct 863 ms 29060 KB Output is correct
22 Correct 839 ms 29396 KB Output is correct
23 Correct 952 ms 31032 KB Output is correct
24 Correct 944 ms 30816 KB Output is correct
25 Correct 1008 ms 30668 KB Output is correct
26 Correct 26 ms 4184 KB Output is correct
27 Correct 535 ms 29740 KB Output is correct
28 Correct 470 ms 29824 KB Output is correct
29 Correct 693 ms 27332 KB Output is correct
30 Correct 727 ms 30496 KB Output is correct
31 Correct 623 ms 21560 KB Output is correct
32 Correct 383 ms 11944 KB Output is correct
33 Correct 684 ms 23100 KB Output is correct
34 Correct 611 ms 21512 KB Output is correct
35 Correct 26 ms 4180 KB Output is correct
36 Correct 698 ms 21640 KB Output is correct
37 Correct 573 ms 21264 KB Output is correct
38 Correct 526 ms 21096 KB Output is correct
39 Correct 445 ms 19772 KB Output is correct
40 Correct 423 ms 19772 KB Output is correct
41 Correct 470 ms 22592 KB Output is correct
42 Correct 430 ms 22492 KB Output is correct
43 Correct 1167 ms 28776 KB Output is correct
44 Correct 27 ms 4180 KB Output is correct
45 Correct 128 ms 6248 KB Output is correct
46 Correct 59 ms 6068 KB Output is correct
47 Correct 582 ms 27384 KB Output is correct
48 Correct 1142 ms 28880 KB Output is correct
49 Correct 580 ms 27260 KB Output is correct
50 Correct 576 ms 26964 KB Output is correct
51 Correct 539 ms 27180 KB Output is correct
52 Correct 563 ms 27332 KB Output is correct
53 Correct 870 ms 28064 KB Output is correct
54 Correct 840 ms 28312 KB Output is correct
55 Correct 870 ms 28084 KB Output is correct
56 Correct 513 ms 27248 KB Output is correct
57 Correct 586 ms 27212 KB Output is correct
58 Correct 1181 ms 29024 KB Output is correct
59 Correct 1171 ms 29036 KB Output is correct
60 Correct 1149 ms 29148 KB Output is correct
61 Correct 1206 ms 29440 KB Output is correct
62 Correct 970 ms 28460 KB Output is correct
63 Correct 997 ms 28356 KB Output is correct
64 Correct 1135 ms 28476 KB Output is correct
65 Correct 645 ms 25060 KB Output is correct
66 Correct 880 ms 29160 KB Output is correct
67 Correct 889 ms 30672 KB Output is correct
68 Correct 851 ms 29084 KB Output is correct
69 Correct 674 ms 28808 KB Output is correct
70 Correct 882 ms 30864 KB Output is correct
71 Correct 935 ms 30712 KB Output is correct
72 Correct 958 ms 30652 KB Output is correct
73 Correct 856 ms 29316 KB Output is correct
74 Correct 837 ms 29128 KB Output is correct
75 Correct 815 ms 29132 KB Output is correct
76 Correct 734 ms 28872 KB Output is correct
77 Correct 685 ms 28728 KB Output is correct
78 Correct 715 ms 28820 KB Output is correct
79 Correct 594 ms 27300 KB Output is correct
80 Correct 602 ms 27652 KB Output is correct
81 Correct 594 ms 27372 KB Output is correct
82 Correct 589 ms 29468 KB Output is correct
83 Correct 607 ms 29640 KB Output is correct
84 Correct 596 ms 29240 KB Output is correct
85 Correct 1398 ms 31076 KB Output is correct
86 Correct 142 ms 7964 KB Output is correct
87 Correct 76 ms 9180 KB Output is correct
88 Correct 791 ms 31284 KB Output is correct
89 Correct 1391 ms 31100 KB Output is correct
90 Correct 773 ms 31208 KB Output is correct
91 Correct 881 ms 28928 KB Output is correct
92 Correct 858 ms 29076 KB Output is correct
93 Correct 1054 ms 30648 KB Output is correct
94 Correct 1195 ms 30592 KB Output is correct
95 Correct 1172 ms 30704 KB Output is correct
96 Correct 1199 ms 32064 KB Output is correct
97 Correct 648 ms 27904 KB Output is correct
98 Correct 657 ms 31008 KB Output is correct
99 Correct 1429 ms 31392 KB Output is correct
100 Correct 1403 ms 31248 KB Output is correct
101 Correct 1441 ms 31304 KB Output is correct
102 Correct 1427 ms 31436 KB Output is correct
103 Correct 1299 ms 32496 KB Output is correct
104 Correct 1337 ms 32500 KB Output is correct
105 Correct 1099 ms 32116 KB Output is correct
106 Correct 932 ms 31660 KB Output is correct
107 Correct 1094 ms 28876 KB Output is correct
108 Correct 1371 ms 31208 KB Output is correct
109 Correct 905 ms 29144 KB Output is correct