oj.uz

Submission #896627

# Submission time Handle Problem Language Result Execution time Memory
896627 2024-01-01T19:21:45 Z MarwenElarbi Bridges (APIO19_bridges) C++17
100 / 100
 1425 ms 32460 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 2396 KB Output is correct
3 Correct 24 ms 4700 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 25 ms 4956 KB Output is correct
6 Correct 17 ms 4696 KB Output is correct
7 Correct 21 ms 5468 KB Output is correct
8 Correct 27 ms 4728 KB Output is correct
9 Correct 24 ms 6228 KB Output is correct
10 Correct 27 ms 4956 KB Output is correct
11 Correct 27 ms 4696 KB Output is correct
12 Correct 33 ms 4944 KB Output is correct
13 Correct 31 ms 4912 KB Output is correct
14 Correct 31 ms 4700 KB Output is correct
15 Correct 38 ms 4636 KB Output is correct
16 Correct 24 ms 6092 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 815 ms 29036 KB Output is correct
2 Correct 817 ms 29228 KB Output is correct
3 Correct 826 ms 29428 KB Output is correct
4 Correct 842 ms 29380 KB Output is correct
5 Correct 835 ms 29360 KB Output is correct
6 Correct 992 ms 30872 KB Output is correct
7 Correct 976 ms 30716 KB Output is correct
8 Correct 978 ms 31152 KB Output is correct
9 Correct 26 ms 4156 KB Output is correct
10 Correct 514 ms 29920 KB Output is correct
11 Correct 483 ms 29996 KB Output is correct
12 Correct 696 ms 27420 KB Output is correct
13 Correct 688 ms 30504 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 21484 KB Output is correct
2 Correct 384 ms 11748 KB Output is correct
3 Correct 659 ms 23008 KB Output is correct
4 Correct 622 ms 22116 KB Output is correct
5 Correct 26 ms 4156 KB Output is correct
6 Correct 679 ms 21444 KB Output is correct
7 Correct 599 ms 21120 KB Output is correct
8 Correct 537 ms 21096 KB Output is correct
9 Correct 472 ms 19692 KB Output is correct
10 Correct 428 ms 19772 KB Output is correct
11 Correct 489 ms 22400 KB Output is correct
12 Correct 482 ms 22472 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1182 ms 29032 KB Output is correct
2 Correct 26 ms 4196 KB Output is correct
3 Correct 124 ms 6244 KB Output is correct
4 Correct 56 ms 5972 KB Output is correct
5 Correct 578 ms 27356 KB Output is correct
6 Correct 1127 ms 28728 KB Output is correct
7 Correct 571 ms 27456 KB Output is correct
8 Correct 544 ms 26744 KB Output is correct
9 Correct 548 ms 27004 KB Output is correct
10 Correct 546 ms 26956 KB Output is correct
11 Correct 871 ms 27936 KB Output is correct
12 Correct 846 ms 28272 KB Output is correct
13 Correct 872 ms 28424 KB Output is correct
14 Correct 517 ms 27244 KB Output is correct
15 Correct 544 ms 27316 KB Output is correct
16 Correct 1159 ms 28836 KB Output is correct
17 Correct 1175 ms 28812 KB Output is correct
18 Correct 1152 ms 29208 KB Output is correct
19 Correct 1166 ms 29232 KB Output is correct
20 Correct 985 ms 28320 KB Output is correct
21 Correct 978 ms 28448 KB Output is correct
22 Correct 1119 ms 28320 KB Output is correct
23 Correct 651 ms 25304 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 815 ms 29036 KB Output is correct
2 Correct 817 ms 29228 KB Output is correct
3 Correct 826 ms 29428 KB Output is correct
4 Correct 842 ms 29380 KB Output is correct
5 Correct 835 ms 29360 KB Output is correct
6 Correct 992 ms 30872 KB Output is correct
7 Correct 976 ms 30716 KB Output is correct
8 Correct 978 ms 31152 KB Output is correct
9 Correct 26 ms 4156 KB Output is correct
10 Correct 514 ms 29920 KB Output is correct
11 Correct 483 ms 29996 KB Output is correct
12 Correct 696 ms 27420 KB Output is correct
13 Correct 688 ms 30504 KB Output is correct
14 Correct 622 ms 21484 KB Output is correct
15 Correct 384 ms 11748 KB Output is correct
16 Correct 659 ms 23008 KB Output is correct
17 Correct 622 ms 22116 KB Output is correct
18 Correct 26 ms 4156 KB Output is correct
19 Correct 679 ms 21444 KB Output is correct
20 Correct 599 ms 21120 KB Output is correct
21 Correct 537 ms 21096 KB Output is correct
22 Correct 472 ms 19692 KB Output is correct
23 Correct 428 ms 19772 KB Output is correct
24 Correct 489 ms 22400 KB Output is correct
25 Correct 482 ms 22472 KB Output is correct
26 Correct 860 ms 29488 KB Output is correct
27 Correct 933 ms 31004 KB Output is correct
28 Correct 858 ms 29224 KB Output is correct
29 Correct 686 ms 28792 KB Output is correct
30 Correct 925 ms 30924 KB Output is correct
31 Correct 929 ms 30892 KB Output is correct
32 Correct 951 ms 30840 KB Output is correct
33 Correct 848 ms 29036 KB Output is correct
34 Correct 850 ms 29328 KB Output is correct
35 Correct 850 ms 29228 KB Output is correct
36 Correct 701 ms 28856 KB Output is correct
37 Correct 696 ms 28872 KB Output is correct
38 Correct 694 ms 28712 KB Output is correct
39 Correct 600 ms 27276 KB Output is correct
40 Correct 596 ms 27424 KB Output is correct
41 Correct 598 ms 27484 KB Output is correct
42 Correct 590 ms 29452 KB Output is correct
43 Correct 592 ms 29456 KB Output is correct
44 Correct 591 ms 29076 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 24 ms 4700 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 25 ms 4956 KB Output is correct
6 Correct 17 ms 4696 KB Output is correct
7 Correct 21 ms 5468 KB Output is correct
8 Correct 27 ms 4728 KB Output is correct
9 Correct 24 ms 6228 KB Output is correct
10 Correct 27 ms 4956 KB Output is correct
11 Correct 27 ms 4696 KB Output is correct
12 Correct 33 ms 4944 KB Output is correct
13 Correct 31 ms 4912 KB Output is correct
14 Correct 31 ms 4700 KB Output is correct
15 Correct 38 ms 4636 KB Output is correct
16 Correct 24 ms 6092 KB Output is correct
17 Correct 25 ms 5468 KB Output is correct
18 Correct 815 ms 29036 KB Output is correct
19 Correct 817 ms 29228 KB Output is correct
20 Correct 826 ms 29428 KB Output is correct
21 Correct 842 ms 29380 KB Output is correct
22 Correct 835 ms 29360 KB Output is correct
23 Correct 992 ms 30872 KB Output is correct
24 Correct 976 ms 30716 KB Output is correct
25 Correct 978 ms 31152 KB Output is correct
26 Correct 26 ms 4156 KB Output is correct
27 Correct 514 ms 29920 KB Output is correct
28 Correct 483 ms 29996 KB Output is correct
29 Correct 696 ms 27420 KB Output is correct
30 Correct 688 ms 30504 KB Output is correct
31 Correct 622 ms 21484 KB Output is correct
32 Correct 384 ms 11748 KB Output is correct
33 Correct 659 ms 23008 KB Output is correct
34 Correct 622 ms 22116 KB Output is correct
35 Correct 26 ms 4156 KB Output is correct
36 Correct 679 ms 21444 KB Output is correct
37 Correct 599 ms 21120 KB Output is correct
38 Correct 537 ms 21096 KB Output is correct
39 Correct 472 ms 19692 KB Output is correct
40 Correct 428 ms 19772 KB Output is correct
41 Correct 489 ms 22400 KB Output is correct
42 Correct 482 ms 22472 KB Output is correct
43 Correct 1182 ms 29032 KB Output is correct
44 Correct 26 ms 4196 KB Output is correct
45 Correct 124 ms 6244 KB Output is correct
46 Correct 56 ms 5972 KB Output is correct
47 Correct 578 ms 27356 KB Output is correct
48 Correct 1127 ms 28728 KB Output is correct
49 Correct 571 ms 27456 KB Output is correct
50 Correct 544 ms 26744 KB Output is correct
51 Correct 548 ms 27004 KB Output is correct
52 Correct 546 ms 26956 KB Output is correct
53 Correct 871 ms 27936 KB Output is correct
54 Correct 846 ms 28272 KB Output is correct
55 Correct 872 ms 28424 KB Output is correct
56 Correct 517 ms 27244 KB Output is correct
57 Correct 544 ms 27316 KB Output is correct
58 Correct 1159 ms 28836 KB Output is correct
59 Correct 1175 ms 28812 KB Output is correct
60 Correct 1152 ms 29208 KB Output is correct
61 Correct 1166 ms 29232 KB Output is correct
62 Correct 985 ms 28320 KB Output is correct
63 Correct 978 ms 28448 KB Output is correct
64 Correct 1119 ms 28320 KB Output is correct
65 Correct 651 ms 25304 KB Output is correct
66 Correct 860 ms 29488 KB Output is correct
67 Correct 933 ms 31004 KB Output is correct
68 Correct 858 ms 29224 KB Output is correct
69 Correct 686 ms 28792 KB Output is correct
70 Correct 925 ms 30924 KB Output is correct
71 Correct 929 ms 30892 KB Output is correct
72 Correct 951 ms 30840 KB Output is correct
73 Correct 848 ms 29036 KB Output is correct
74 Correct 850 ms 29328 KB Output is correct
75 Correct 850 ms 29228 KB Output is correct
76 Correct 701 ms 28856 KB Output is correct
77 Correct 696 ms 28872 KB Output is correct
78 Correct 694 ms 28712 KB Output is correct
79 Correct 600 ms 27276 KB Output is correct
80 Correct 596 ms 27424 KB Output is correct
81 Correct 598 ms 27484 KB Output is correct
82 Correct 590 ms 29452 KB Output is correct
83 Correct 592 ms 29456 KB Output is correct
84 Correct 591 ms 29076 KB Output is correct
85 Correct 1414 ms 30832 KB Output is correct
86 Correct 142 ms 7916 KB Output is correct
87 Correct 79 ms 9608 KB Output is correct
88 Correct 761 ms 31104 KB Output is correct
89 Correct 1394 ms 31220 KB Output is correct
90 Correct 776 ms 31260 KB Output is correct
91 Correct 876 ms 29232 KB Output is correct
92 Correct 868 ms 29220 KB Output is correct
93 Correct 1043 ms 30608 KB Output is correct
94 Correct 1155 ms 30660 KB Output is correct
95 Correct 1149 ms 30512 KB Output is correct
96 Correct 1199 ms 32272 KB Output is correct
97 Correct 652 ms 27676 KB Output is correct
98 Correct 658 ms 31024 KB Output is correct
99 Correct 1419 ms 31344 KB Output is correct
100 Correct 1421 ms 31336 KB Output is correct
101 Correct 1425 ms 31328 KB Output is correct
102 Correct 1420 ms 31548 KB Output is correct
103 Correct 1315 ms 32460 KB Output is correct
104 Correct 1311 ms 32428 KB Output is correct
105 Correct 1104 ms 32072 KB Output is correct
106 Correct 936 ms 31904 KB Output is correct
107 Correct 1105 ms 29028 KB Output is correct
108 Correct 1396 ms 31136 KB Output is correct
109 Correct 895 ms 29020 KB Output is correct