oj.uz

Submission #940386

# Submission time Handle Problem Language Result Execution time Memory
940386 2024-03-07T08:47:34 Z MMihalev Bridges (APIO19_bridges) C++14
100 / 100
 1461 ms 32672 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] = 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 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 23 ms 4692 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 25 ms 4696 KB Output is correct
6 Correct 18 ms 4444 KB Output is correct
7 Correct 20 ms 5464 KB Output is correct
8 Correct 27 ms 4444 KB Output is correct
9 Correct 33 ms 6360 KB Output is correct
10 Correct 33 ms 4692 KB Output is correct
11 Correct 27 ms 4688 KB Output is correct
12 Correct 33 ms 4700 KB Output is correct
13 Correct 33 ms 4788 KB Output is correct
14 Correct 31 ms 4696 KB Output is correct
15 Correct 33 ms 4700 KB Output is correct
16 Correct 29 ms 6020 KB Output is correct
17 Correct 26 ms 5464 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 807 ms 26424 KB Output is correct
2 Correct 846 ms 26396 KB Output is correct
3 Correct 867 ms 26480 KB Output is correct
4 Correct 888 ms 26400 KB Output is correct
5 Correct 857 ms 26648 KB Output is correct
6 Correct 1012 ms 28328 KB Output is correct
7 Correct 1065 ms 28272 KB Output is correct
8 Correct 1012 ms 28160 KB Output is correct
9 Correct 39 ms 2640 KB Output is correct
10 Correct 507 ms 28424 KB Output is correct
11 Correct 488 ms 28176 KB Output is correct
12 Correct 772 ms 25100 KB Output is correct
13 Correct 705 ms 27688 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 637 ms 19036 KB Output is correct
2 Correct 397 ms 10324 KB Output is correct
3 Correct 697 ms 20840 KB Output is correct
4 Correct 625 ms 19100 KB Output is correct
5 Correct 34 ms 2652 KB Output is correct
6 Correct 665 ms 19128 KB Output is correct
7 Correct 576 ms 18908 KB Output is correct
8 Correct 524 ms 18564 KB Output is correct
9 Correct 459 ms 17412 KB Output is correct
10 Correct 426 ms 17392 KB Output is correct
11 Correct 494 ms 20164 KB Output is correct
12 Correct 465 ms 20436 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1191 ms 24936 KB Output is correct
2 Correct 26 ms 2648 KB Output is correct
3 Correct 128 ms 4232 KB Output is correct
4 Correct 57 ms 4052 KB Output is correct
5 Correct 573 ms 24932 KB Output is correct
6 Correct 1153 ms 24992 KB Output is correct
7 Correct 579 ms 25084 KB Output is correct
8 Correct 551 ms 24188 KB Output is correct
9 Correct 539 ms 24144 KB Output is correct
10 Correct 560 ms 24436 KB Output is correct
11 Correct 869 ms 24972 KB Output is correct
12 Correct 851 ms 24988 KB Output is correct
13 Correct 877 ms 25044 KB Output is correct
14 Correct 513 ms 25048 KB Output is correct
15 Correct 543 ms 24868 KB Output is correct
16 Correct 1193 ms 25360 KB Output is correct
17 Correct 1197 ms 25172 KB Output is correct
18 Correct 1159 ms 25404 KB Output is correct
19 Correct 1176 ms 25528 KB Output is correct
20 Correct 990 ms 25216 KB Output is correct
21 Correct 988 ms 25316 KB Output is correct
22 Correct 1146 ms 24960 KB Output is correct
23 Correct 659 ms 23052 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 807 ms 26424 KB Output is correct
2 Correct 846 ms 26396 KB Output is correct
3 Correct 867 ms 26480 KB Output is correct
4 Correct 888 ms 26400 KB Output is correct
5 Correct 857 ms 26648 KB Output is correct
6 Correct 1012 ms 28328 KB Output is correct
7 Correct 1065 ms 28272 KB Output is correct
8 Correct 1012 ms 28160 KB Output is correct
9 Correct 39 ms 2640 KB Output is correct
10 Correct 507 ms 28424 KB Output is correct
11 Correct 488 ms 28176 KB Output is correct
12 Correct 772 ms 25100 KB Output is correct
13 Correct 705 ms 27688 KB Output is correct
14 Correct 637 ms 19036 KB Output is correct
15 Correct 397 ms 10324 KB Output is correct
16 Correct 697 ms 20840 KB Output is correct
17 Correct 625 ms 19100 KB Output is correct
18 Correct 34 ms 2652 KB Output is correct
19 Correct 665 ms 19128 KB Output is correct
20 Correct 576 ms 18908 KB Output is correct
21 Correct 524 ms 18564 KB Output is correct
22 Correct 459 ms 17412 KB Output is correct
23 Correct 426 ms 17392 KB Output is correct
24 Correct 494 ms 20164 KB Output is correct
25 Correct 465 ms 20436 KB Output is correct
26 Correct 884 ms 26540 KB Output is correct
27 Correct 1036 ms 28204 KB Output is correct
28 Correct 854 ms 26504 KB Output is correct
29 Correct 679 ms 25896 KB Output is correct
30 Correct 914 ms 28068 KB Output is correct
31 Correct 975 ms 28184 KB Output is correct
32 Correct 981 ms 28388 KB Output is correct
33 Correct 892 ms 26316 KB Output is correct
34 Correct 896 ms 26404 KB Output is correct
35 Correct 901 ms 26404 KB Output is correct
36 Correct 749 ms 25964 KB Output is correct
37 Correct 766 ms 28932 KB Output is correct
38 Correct 693 ms 28720 KB Output is correct
39 Correct 609 ms 27484 KB Output is correct
40 Correct 603 ms 27536 KB Output is correct
41 Correct 609 ms 27692 KB Output is correct
42 Correct 599 ms 29228 KB Output is correct
43 Correct 595 ms 29224 KB Output is correct
44 Correct 596 ms 29260 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 23 ms 4692 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 25 ms 4696 KB Output is correct
6 Correct 18 ms 4444 KB Output is correct
7 Correct 20 ms 5464 KB Output is correct
8 Correct 27 ms 4444 KB Output is correct
9 Correct 33 ms 6360 KB Output is correct
10 Correct 33 ms 4692 KB Output is correct
11 Correct 27 ms 4688 KB Output is correct
12 Correct 33 ms 4700 KB Output is correct
13 Correct 33 ms 4788 KB Output is correct
14 Correct 31 ms 4696 KB Output is correct
15 Correct 33 ms 4700 KB Output is correct
16 Correct 29 ms 6020 KB Output is correct
17 Correct 26 ms 5464 KB Output is correct
18 Correct 807 ms 26424 KB Output is correct
19 Correct 846 ms 26396 KB Output is correct
20 Correct 867 ms 26480 KB Output is correct
21 Correct 888 ms 26400 KB Output is correct
22 Correct 857 ms 26648 KB Output is correct
23 Correct 1012 ms 28328 KB Output is correct
24 Correct 1065 ms 28272 KB Output is correct
25 Correct 1012 ms 28160 KB Output is correct
26 Correct 39 ms 2640 KB Output is correct
27 Correct 507 ms 28424 KB Output is correct
28 Correct 488 ms 28176 KB Output is correct
29 Correct 772 ms 25100 KB Output is correct
30 Correct 705 ms 27688 KB Output is correct
31 Correct 637 ms 19036 KB Output is correct
32 Correct 397 ms 10324 KB Output is correct
33 Correct 697 ms 20840 KB Output is correct
34 Correct 625 ms 19100 KB Output is correct
35 Correct 34 ms 2652 KB Output is correct
36 Correct 665 ms 19128 KB Output is correct
37 Correct 576 ms 18908 KB Output is correct
38 Correct 524 ms 18564 KB Output is correct
39 Correct 459 ms 17412 KB Output is correct
40 Correct 426 ms 17392 KB Output is correct
41 Correct 494 ms 20164 KB Output is correct
42 Correct 465 ms 20436 KB Output is correct
43 Correct 1191 ms 24936 KB Output is correct
44 Correct 26 ms 2648 KB Output is correct
45 Correct 128 ms 4232 KB Output is correct
46 Correct 57 ms 4052 KB Output is correct
47 Correct 573 ms 24932 KB Output is correct
48 Correct 1153 ms 24992 KB Output is correct
49 Correct 579 ms 25084 KB Output is correct
50 Correct 551 ms 24188 KB Output is correct
51 Correct 539 ms 24144 KB Output is correct
52 Correct 560 ms 24436 KB Output is correct
53 Correct 869 ms 24972 KB Output is correct
54 Correct 851 ms 24988 KB Output is correct
55 Correct 877 ms 25044 KB Output is correct
56 Correct 513 ms 25048 KB Output is correct
57 Correct 543 ms 24868 KB Output is correct
58 Correct 1193 ms 25360 KB Output is correct
59 Correct 1197 ms 25172 KB Output is correct
60 Correct 1159 ms 25404 KB Output is correct
61 Correct 1176 ms 25528 KB Output is correct
62 Correct 990 ms 25216 KB Output is correct
63 Correct 988 ms 25316 KB Output is correct
64 Correct 1146 ms 24960 KB Output is correct
65 Correct 659 ms 23052 KB Output is correct
66 Correct 884 ms 26540 KB Output is correct
67 Correct 1036 ms 28204 KB Output is correct
68 Correct 854 ms 26504 KB Output is correct
69 Correct 679 ms 25896 KB Output is correct
70 Correct 914 ms 28068 KB Output is correct
71 Correct 975 ms 28184 KB Output is correct
72 Correct 981 ms 28388 KB Output is correct
73 Correct 892 ms 26316 KB Output is correct
74 Correct 896 ms 26404 KB Output is correct
75 Correct 901 ms 26404 KB Output is correct
76 Correct 749 ms 25964 KB Output is correct
77 Correct 766 ms 28932 KB Output is correct
78 Correct 693 ms 28720 KB Output is correct
79 Correct 609 ms 27484 KB Output is correct
80 Correct 603 ms 27536 KB Output is correct
81 Correct 609 ms 27692 KB Output is correct
82 Correct 599 ms 29228 KB Output is correct
83 Correct 595 ms 29224 KB Output is correct
84 Correct 596 ms 29260 KB Output is correct
85 Correct 1429 ms 31240 KB Output is correct
86 Correct 143 ms 7956 KB Output is correct
87 Correct 77 ms 9372 KB Output is correct
88 Correct 781 ms 31360 KB Output is correct
89 Correct 1417 ms 31576 KB Output is correct
90 Correct 781 ms 31096 KB Output is correct
91 Correct 900 ms 29208 KB Output is correct
92 Correct 893 ms 29228 KB Output is correct
93 Correct 1049 ms 30520 KB Output is correct
94 Correct 1172 ms 30416 KB Output is correct
95 Correct 1168 ms 30580 KB Output is correct
96 Correct 1218 ms 32112 KB Output is correct
97 Correct 663 ms 27744 KB Output is correct
98 Correct 665 ms 31096 KB Output is correct
99 Correct 1458 ms 31668 KB Output is correct
100 Correct 1455 ms 31072 KB Output is correct
101 Correct 1461 ms 31372 KB Output is correct
102 Correct 1461 ms 31484 KB Output is correct
103 Correct 1331 ms 32672 KB Output is correct
104 Correct 1321 ms 32568 KB Output is correct
105 Correct 1129 ms 32104 KB Output is correct
106 Correct 949 ms 31916 KB Output is correct
107 Correct 1081 ms 28888 KB Output is correct
108 Correct 1399 ms 31176 KB Output is correct
109 Correct 902 ms 29348 KB Output is correct