oj.uz

Submission #774604

# Submission time Handle Problem Language Result Execution time Memory
774604 2023-07-05T21:51:32 Z boyliguanhan Bridges (APIO19_bridges) C++17
100 / 100
 1495 ms 32236 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 24 ms 2856 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 25 ms 2984 KB Output is correct
6 Correct 17 ms 2672 KB Output is correct
7 Correct 20 ms 3488 KB Output is correct
8 Correct 28 ms 2800 KB Output is correct
9 Correct 23 ms 4308 KB Output is correct
10 Correct 27 ms 2936 KB Output is correct
11 Correct 27 ms 2768 KB Output is correct
12 Correct 33 ms 2968 KB Output is correct
13 Correct 31 ms 2860 KB Output is correct
14 Correct 29 ms 2776 KB Output is correct
15 Correct 33 ms 2772 KB Output is correct
16 Correct 23 ms 4044 KB Output is correct
17 Correct 25 ms 3404 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 815 ms 28848 KB Output is correct
2 Correct 816 ms 28772 KB Output is correct
3 Correct 819 ms 28852 KB Output is correct
4 Correct 836 ms 28832 KB Output is correct
5 Correct 853 ms 29024 KB Output is correct
6 Correct 965 ms 30420 KB Output is correct
7 Correct 1008 ms 30480 KB Output is correct
8 Correct 1012 ms 30504 KB Output is correct
9 Correct 26 ms 3404 KB Output is correct
10 Correct 496 ms 29552 KB Output is correct
11 Correct 494 ms 29492 KB Output is correct
12 Correct 704 ms 27168 KB Output is correct
13 Correct 708 ms 30156 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 656 ms 20952 KB Output is correct
2 Correct 391 ms 11156 KB Output is correct
3 Correct 669 ms 22608 KB Output is correct
4 Correct 622 ms 21156 KB Output is correct
5 Correct 26 ms 3380 KB Output is correct
6 Correct 658 ms 21072 KB Output is correct
7 Correct 604 ms 20732 KB Output is correct
8 Correct 536 ms 20560 KB Output is correct
9 Correct 446 ms 19304 KB Output is correct
10 Correct 428 ms 19284 KB Output is correct
11 Correct 486 ms 22076 KB Output is correct
12 Correct 438 ms 22064 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1210 ms 28720 KB Output is correct
2 Correct 31 ms 3396 KB Output is correct
3 Correct 125 ms 4564 KB Output is correct
4 Correct 57 ms 4696 KB Output is correct
5 Correct 588 ms 27172 KB Output is correct
6 Correct 1178 ms 28600 KB Output is correct
7 Correct 573 ms 27088 KB Output is correct
8 Correct 578 ms 26632 KB Output is correct
9 Correct 543 ms 26736 KB Output is correct
10 Correct 556 ms 26664 KB Output is correct
11 Correct 876 ms 27920 KB Output is correct
12 Correct 855 ms 28064 KB Output is correct
13 Correct 879 ms 27988 KB Output is correct
14 Correct 558 ms 27208 KB Output is correct
15 Correct 547 ms 27152 KB Output is correct
16 Correct 1192 ms 28984 KB Output is correct
17 Correct 1211 ms 28800 KB Output is correct
18 Correct 1206 ms 29156 KB Output is correct
19 Correct 1179 ms 29120 KB Output is correct
20 Correct 1004 ms 28340 KB Output is correct
21 Correct 988 ms 28304 KB Output is correct
22 Correct 1147 ms 28300 KB Output is correct
23 Correct 681 ms 24888 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 815 ms 28848 KB Output is correct
2 Correct 816 ms 28772 KB Output is correct
3 Correct 819 ms 28852 KB Output is correct
4 Correct 836 ms 28832 KB Output is correct
5 Correct 853 ms 29024 KB Output is correct
6 Correct 965 ms 30420 KB Output is correct
7 Correct 1008 ms 30480 KB Output is correct
8 Correct 1012 ms 30504 KB Output is correct
9 Correct 26 ms 3404 KB Output is correct
10 Correct 496 ms 29552 KB Output is correct
11 Correct 494 ms 29492 KB Output is correct
12 Correct 704 ms 27168 KB Output is correct
13 Correct 708 ms 30156 KB Output is correct
14 Correct 656 ms 20952 KB Output is correct
15 Correct 391 ms 11156 KB Output is correct
16 Correct 669 ms 22608 KB Output is correct
17 Correct 622 ms 21156 KB Output is correct
18 Correct 26 ms 3380 KB Output is correct
19 Correct 658 ms 21072 KB Output is correct
20 Correct 604 ms 20732 KB Output is correct
21 Correct 536 ms 20560 KB Output is correct
22 Correct 446 ms 19304 KB Output is correct
23 Correct 428 ms 19284 KB Output is correct
24 Correct 486 ms 22076 KB Output is correct
25 Correct 438 ms 22064 KB Output is correct
26 Correct 874 ms 28948 KB Output is correct
27 Correct 938 ms 30496 KB Output is correct
28 Correct 884 ms 28964 KB Output is correct
29 Correct 680 ms 28420 KB Output is correct
30 Correct 929 ms 30460 KB Output is correct
31 Correct 933 ms 30460 KB Output is correct
32 Correct 943 ms 30400 KB Output is correct
33 Correct 858 ms 28768 KB Output is correct
34 Correct 864 ms 28752 KB Output is correct
35 Correct 860 ms 28868 KB Output is correct
36 Correct 706 ms 28480 KB Output is correct
37 Correct 722 ms 28504 KB Output is correct
38 Correct 700 ms 28364 KB Output is correct
39 Correct 610 ms 27048 KB Output is correct
40 Correct 597 ms 27144 KB Output is correct
41 Correct 607 ms 27152 KB Output is correct
42 Correct 602 ms 29104 KB Output is correct
43 Correct 602 ms 29044 KB Output is correct
44 Correct 595 ms 28872 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 340 KB Output is correct
3 Correct 24 ms 2856 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 25 ms 2984 KB Output is correct
6 Correct 17 ms 2672 KB Output is correct
7 Correct 20 ms 3488 KB Output is correct
8 Correct 28 ms 2800 KB Output is correct
9 Correct 23 ms 4308 KB Output is correct
10 Correct 27 ms 2936 KB Output is correct
11 Correct 27 ms 2768 KB Output is correct
12 Correct 33 ms 2968 KB Output is correct
13 Correct 31 ms 2860 KB Output is correct
14 Correct 29 ms 2776 KB Output is correct
15 Correct 33 ms 2772 KB Output is correct
16 Correct 23 ms 4044 KB Output is correct
17 Correct 25 ms 3404 KB Output is correct
18 Correct 815 ms 28848 KB Output is correct
19 Correct 816 ms 28772 KB Output is correct
20 Correct 819 ms 28852 KB Output is correct
21 Correct 836 ms 28832 KB Output is correct
22 Correct 853 ms 29024 KB Output is correct
23 Correct 965 ms 30420 KB Output is correct
24 Correct 1008 ms 30480 KB Output is correct
25 Correct 1012 ms 30504 KB Output is correct
26 Correct 26 ms 3404 KB Output is correct
27 Correct 496 ms 29552 KB Output is correct
28 Correct 494 ms 29492 KB Output is correct
29 Correct 704 ms 27168 KB Output is correct
30 Correct 708 ms 30156 KB Output is correct
31 Correct 656 ms 20952 KB Output is correct
32 Correct 391 ms 11156 KB Output is correct
33 Correct 669 ms 22608 KB Output is correct
34 Correct 622 ms 21156 KB Output is correct
35 Correct 26 ms 3380 KB Output is correct
36 Correct 658 ms 21072 KB Output is correct
37 Correct 604 ms 20732 KB Output is correct
38 Correct 536 ms 20560 KB Output is correct
39 Correct 446 ms 19304 KB Output is correct
40 Correct 428 ms 19284 KB Output is correct
41 Correct 486 ms 22076 KB Output is correct
42 Correct 438 ms 22064 KB Output is correct
43 Correct 1210 ms 28720 KB Output is correct
44 Correct 31 ms 3396 KB Output is correct
45 Correct 125 ms 4564 KB Output is correct
46 Correct 57 ms 4696 KB Output is correct
47 Correct 588 ms 27172 KB Output is correct
48 Correct 1178 ms 28600 KB Output is correct
49 Correct 573 ms 27088 KB Output is correct
50 Correct 578 ms 26632 KB Output is correct
51 Correct 543 ms 26736 KB Output is correct
52 Correct 556 ms 26664 KB Output is correct
53 Correct 876 ms 27920 KB Output is correct
54 Correct 855 ms 28064 KB Output is correct
55 Correct 879 ms 27988 KB Output is correct
56 Correct 558 ms 27208 KB Output is correct
57 Correct 547 ms 27152 KB Output is correct
58 Correct 1192 ms 28984 KB Output is correct
59 Correct 1211 ms 28800 KB Output is correct
60 Correct 1206 ms 29156 KB Output is correct
61 Correct 1179 ms 29120 KB Output is correct
62 Correct 1004 ms 28340 KB Output is correct
63 Correct 988 ms 28304 KB Output is correct
64 Correct 1147 ms 28300 KB Output is correct
65 Correct 681 ms 24888 KB Output is correct
66 Correct 874 ms 28948 KB Output is correct
67 Correct 938 ms 30496 KB Output is correct
68 Correct 884 ms 28964 KB Output is correct
69 Correct 680 ms 28420 KB Output is correct
70 Correct 929 ms 30460 KB Output is correct
71 Correct 933 ms 30460 KB Output is correct
72 Correct 943 ms 30400 KB Output is correct
73 Correct 858 ms 28768 KB Output is correct
74 Correct 864 ms 28752 KB Output is correct
75 Correct 860 ms 28868 KB Output is correct
76 Correct 706 ms 28480 KB Output is correct
77 Correct 722 ms 28504 KB Output is correct
78 Correct 700 ms 28364 KB Output is correct
79 Correct 610 ms 27048 KB Output is correct
80 Correct 597 ms 27144 KB Output is correct
81 Correct 607 ms 27152 KB Output is correct
82 Correct 602 ms 29104 KB Output is correct
83 Correct 602 ms 29044 KB Output is correct
84 Correct 595 ms 28872 KB Output is correct
85 Correct 1484 ms 30804 KB Output is correct
86 Correct 146 ms 6620 KB Output is correct
87 Correct 79 ms 8132 KB Output is correct
88 Correct 775 ms 31168 KB Output is correct
89 Correct 1454 ms 30980 KB Output is correct
90 Correct 798 ms 31172 KB Output is correct
91 Correct 886 ms 28708 KB Output is correct
92 Correct 886 ms 28740 KB Output is correct
93 Correct 1074 ms 30312 KB Output is correct
94 Correct 1217 ms 30296 KB Output is correct
95 Correct 1169 ms 30412 KB Output is correct
96 Correct 1240 ms 31968 KB Output is correct
97 Correct 651 ms 27656 KB Output is correct
98 Correct 673 ms 30896 KB Output is correct
99 Correct 1492 ms 31384 KB Output is correct
100 Correct 1495 ms 31056 KB Output is correct
101 Correct 1478 ms 31248 KB Output is correct
102 Correct 1458 ms 31348 KB Output is correct
103 Correct 1350 ms 32236 KB Output is correct
104 Correct 1330 ms 32156 KB Output is correct
105 Correct 1216 ms 32148 KB Output is correct
106 Correct 953 ms 31508 KB Output is correct
107 Correct 1116 ms 28796 KB Output is correct
108 Correct 1429 ms 31104 KB Output is correct
109 Correct 903 ms 28896 KB Output is correct