oj.uz

Submission #939618

# Submission time Handle Problem Language Result Execution time Memory
939618 2024-03-06T15:15:43 Z HiepVu217 Bridges (APIO19_bridges) C++17
100 / 100
 1466 ms 32544 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';
}

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 2396 KB Output is correct
3 Correct 23 ms 4696 KB Output is correct
4 Correct 4 ms 2652 KB Output is correct
5 Correct 26 ms 4852 KB Output is correct
6 Correct 17 ms 4700 KB Output is correct
7 Correct 20 ms 5416 KB Output is correct
8 Correct 27 ms 4700 KB Output is correct
9 Correct 24 ms 6220 KB Output is correct
10 Correct 27 ms 4924 KB Output is correct
11 Correct 27 ms 4616 KB Output is correct
12 Correct 32 ms 4928 KB Output is correct
13 Correct 31 ms 4840 KB Output is correct
14 Correct 30 ms 4680 KB Output is correct
15 Correct 33 ms 4696 KB Output is correct
16 Correct 24 ms 5968 KB Output is correct
17 Correct 25 ms 5468 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 833 ms 26440 KB Output is correct
2 Correct 813 ms 29168 KB Output is correct
3 Correct 842 ms 29232 KB Output is correct
4 Correct 835 ms 29024 KB Output is correct
5 Correct 836 ms 29492 KB Output is correct
6 Correct 956 ms 30984 KB Output is correct
7 Correct 966 ms 30688 KB Output is correct
8 Correct 977 ms 30756 KB Output is correct
9 Correct 26 ms 4180 KB Output is correct
10 Correct 469 ms 29760 KB Output is correct
11 Correct 481 ms 29808 KB Output is correct
12 Correct 718 ms 27464 KB Output is correct
13 Correct 672 ms 30500 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 615 ms 19000 KB Output is correct
2 Correct 403 ms 12100 KB Output is correct
3 Correct 643 ms 23480 KB Output is correct
4 Correct 621 ms 21476 KB Output is correct
5 Correct 26 ms 4176 KB Output is correct
6 Correct 694 ms 21380 KB Output is correct
7 Correct 575 ms 21112 KB Output is correct
8 Correct 525 ms 21308 KB Output is correct
9 Correct 447 ms 19724 KB Output is correct
10 Correct 420 ms 19768 KB Output is correct
11 Correct 491 ms 22800 KB Output is correct
12 Correct 436 ms 22360 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1188 ms 24880 KB Output is correct
2 Correct 26 ms 4052 KB Output is correct
3 Correct 126 ms 5912 KB Output is correct
4 Correct 57 ms 6040 KB Output is correct
5 Correct 574 ms 27508 KB Output is correct
6 Correct 1164 ms 28776 KB Output is correct
7 Correct 574 ms 27384 KB Output is correct
8 Correct 551 ms 27152 KB Output is correct
9 Correct 540 ms 26988 KB Output is correct
10 Correct 547 ms 26948 KB Output is correct
11 Correct 864 ms 28008 KB Output is correct
12 Correct 849 ms 28288 KB Output is correct
13 Correct 884 ms 28188 KB Output is correct
14 Correct 518 ms 27396 KB Output is correct
15 Correct 555 ms 27348 KB Output is correct
16 Correct 1218 ms 28992 KB Output is correct
17 Correct 1200 ms 28784 KB Output is correct
18 Correct 1153 ms 29312 KB Output is correct
19 Correct 1166 ms 29544 KB Output is correct
20 Correct 978 ms 28568 KB Output is correct
21 Correct 995 ms 28404 KB Output is correct
22 Correct 1147 ms 28776 KB Output is correct
23 Correct 688 ms 25116 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 833 ms 26440 KB Output is correct
2 Correct 813 ms 29168 KB Output is correct
3 Correct 842 ms 29232 KB Output is correct
4 Correct 835 ms 29024 KB Output is correct
5 Correct 836 ms 29492 KB Output is correct
6 Correct 956 ms 30984 KB Output is correct
7 Correct 966 ms 30688 KB Output is correct
8 Correct 977 ms 30756 KB Output is correct
9 Correct 26 ms 4180 KB Output is correct
10 Correct 469 ms 29760 KB Output is correct
11 Correct 481 ms 29808 KB Output is correct
12 Correct 718 ms 27464 KB Output is correct
13 Correct 672 ms 30500 KB Output is correct
14 Correct 615 ms 19000 KB Output is correct
15 Correct 403 ms 12100 KB Output is correct
16 Correct 643 ms 23480 KB Output is correct
17 Correct 621 ms 21476 KB Output is correct
18 Correct 26 ms 4176 KB Output is correct
19 Correct 694 ms 21380 KB Output is correct
20 Correct 575 ms 21112 KB Output is correct
21 Correct 525 ms 21308 KB Output is correct
22 Correct 447 ms 19724 KB Output is correct
23 Correct 420 ms 19768 KB Output is correct
24 Correct 491 ms 22800 KB Output is correct
25 Correct 436 ms 22360 KB Output is correct
26 Correct 894 ms 29448 KB Output is correct
27 Correct 952 ms 30696 KB Output is correct
28 Correct 878 ms 29552 KB Output is correct
29 Correct 695 ms 28600 KB Output is correct
30 Correct 911 ms 31008 KB Output is correct
31 Correct 941 ms 30800 KB Output is correct
32 Correct 971 ms 30848 KB Output is correct
33 Correct 870 ms 29236 KB Output is correct
34 Correct 858 ms 29168 KB Output is correct
35 Correct 861 ms 29172 KB Output is correct
36 Correct 705 ms 28708 KB Output is correct
37 Correct 700 ms 29080 KB Output is correct
38 Correct 697 ms 28684 KB Output is correct
39 Correct 634 ms 27400 KB Output is correct
40 Correct 631 ms 27324 KB Output is correct
41 Correct 602 ms 27492 KB Output is correct
42 Correct 597 ms 29420 KB Output is correct
43 Correct 604 ms 29476 KB Output is correct
44 Correct 618 ms 29068 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 2396 KB Output is correct
3 Correct 23 ms 4696 KB Output is correct
4 Correct 4 ms 2652 KB Output is correct
5 Correct 26 ms 4852 KB Output is correct
6 Correct 17 ms 4700 KB Output is correct
7 Correct 20 ms 5416 KB Output is correct
8 Correct 27 ms 4700 KB Output is correct
9 Correct 24 ms 6220 KB Output is correct
10 Correct 27 ms 4924 KB Output is correct
11 Correct 27 ms 4616 KB Output is correct
12 Correct 32 ms 4928 KB Output is correct
13 Correct 31 ms 4840 KB Output is correct
14 Correct 30 ms 4680 KB Output is correct
15 Correct 33 ms 4696 KB Output is correct
16 Correct 24 ms 5968 KB Output is correct
17 Correct 25 ms 5468 KB Output is correct
18 Correct 833 ms 26440 KB Output is correct
19 Correct 813 ms 29168 KB Output is correct
20 Correct 842 ms 29232 KB Output is correct
21 Correct 835 ms 29024 KB Output is correct
22 Correct 836 ms 29492 KB Output is correct
23 Correct 956 ms 30984 KB Output is correct
24 Correct 966 ms 30688 KB Output is correct
25 Correct 977 ms 30756 KB Output is correct
26 Correct 26 ms 4180 KB Output is correct
27 Correct 469 ms 29760 KB Output is correct
28 Correct 481 ms 29808 KB Output is correct
29 Correct 718 ms 27464 KB Output is correct
30 Correct 672 ms 30500 KB Output is correct
31 Correct 615 ms 19000 KB Output is correct
32 Correct 403 ms 12100 KB Output is correct
33 Correct 643 ms 23480 KB Output is correct
34 Correct 621 ms 21476 KB Output is correct
35 Correct 26 ms 4176 KB Output is correct
36 Correct 694 ms 21380 KB Output is correct
37 Correct 575 ms 21112 KB Output is correct
38 Correct 525 ms 21308 KB Output is correct
39 Correct 447 ms 19724 KB Output is correct
40 Correct 420 ms 19768 KB Output is correct
41 Correct 491 ms 22800 KB Output is correct
42 Correct 436 ms 22360 KB Output is correct
43 Correct 1188 ms 24880 KB Output is correct
44 Correct 26 ms 4052 KB Output is correct
45 Correct 126 ms 5912 KB Output is correct
46 Correct 57 ms 6040 KB Output is correct
47 Correct 574 ms 27508 KB Output is correct
48 Correct 1164 ms 28776 KB Output is correct
49 Correct 574 ms 27384 KB Output is correct
50 Correct 551 ms 27152 KB Output is correct
51 Correct 540 ms 26988 KB Output is correct
52 Correct 547 ms 26948 KB Output is correct
53 Correct 864 ms 28008 KB Output is correct
54 Correct 849 ms 28288 KB Output is correct
55 Correct 884 ms 28188 KB Output is correct
56 Correct 518 ms 27396 KB Output is correct
57 Correct 555 ms 27348 KB Output is correct
58 Correct 1218 ms 28992 KB Output is correct
59 Correct 1200 ms 28784 KB Output is correct
60 Correct 1153 ms 29312 KB Output is correct
61 Correct 1166 ms 29544 KB Output is correct
62 Correct 978 ms 28568 KB Output is correct
63 Correct 995 ms 28404 KB Output is correct
64 Correct 1147 ms 28776 KB Output is correct
65 Correct 688 ms 25116 KB Output is correct
66 Correct 894 ms 29448 KB Output is correct
67 Correct 952 ms 30696 KB Output is correct
68 Correct 878 ms 29552 KB Output is correct
69 Correct 695 ms 28600 KB Output is correct
70 Correct 911 ms 31008 KB Output is correct
71 Correct 941 ms 30800 KB Output is correct
72 Correct 971 ms 30848 KB Output is correct
73 Correct 870 ms 29236 KB Output is correct
74 Correct 858 ms 29168 KB Output is correct
75 Correct 861 ms 29172 KB Output is correct
76 Correct 705 ms 28708 KB Output is correct
77 Correct 700 ms 29080 KB Output is correct
78 Correct 697 ms 28684 KB Output is correct
79 Correct 634 ms 27400 KB Output is correct
80 Correct 631 ms 27324 KB Output is correct
81 Correct 602 ms 27492 KB Output is correct
82 Correct 597 ms 29420 KB Output is correct
83 Correct 604 ms 29476 KB Output is correct
84 Correct 618 ms 29068 KB Output is correct
85 Correct 1433 ms 30836 KB Output is correct
86 Correct 144 ms 7944 KB Output is correct
87 Correct 91 ms 9476 KB Output is correct
88 Correct 765 ms 31352 KB Output is correct
89 Correct 1429 ms 31120 KB Output is correct
90 Correct 771 ms 31060 KB Output is correct
91 Correct 878 ms 29224 KB Output is correct
92 Correct 910 ms 28996 KB Output is correct
93 Correct 1077 ms 30700 KB Output is correct
94 Correct 1194 ms 30620 KB Output is correct
95 Correct 1157 ms 30744 KB Output is correct
96 Correct 1211 ms 32052 KB Output is correct
97 Correct 653 ms 27864 KB Output is correct
98 Correct 681 ms 31000 KB Output is correct
99 Correct 1453 ms 31516 KB Output is correct
100 Correct 1458 ms 31072 KB Output is correct
101 Correct 1466 ms 31292 KB Output is correct
102 Correct 1463 ms 31304 KB Output is correct
103 Correct 1294 ms 32544 KB Output is correct
104 Correct 1312 ms 32516 KB Output is correct
105 Correct 1122 ms 32296 KB Output is correct
106 Correct 942 ms 31900 KB Output is correct
107 Correct 1089 ms 29036 KB Output is correct
108 Correct 1410 ms 31312 KB Output is correct
109 Correct 899 ms 28904 KB Output is correct