oj.uz

Submission #393625

# Submission time Handle Problem Language Result Execution time Memory
393625 2021-04-24T06:32:32 Z Jairf__Rahman Bridges (APIO19_bridges) C++17
100 / 100
 2458 ms 32232 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:82:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |    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 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 38 ms 2672 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 40 ms 2880 KB Output is correct
6 Correct 29 ms 2500 KB Output is correct
7 Correct 35 ms 3436 KB Output is correct
8 Correct 40 ms 2632 KB Output is correct
9 Correct 49 ms 4212 KB Output is correct
10 Correct 42 ms 2752 KB Output is correct
11 Correct 41 ms 2632 KB Output is correct
12 Correct 53 ms 2752 KB Output is correct
13 Correct 49 ms 2808 KB Output is correct
14 Correct 44 ms 2560 KB Output is correct
15 Correct 50 ms 2632 KB Output is correct
16 Correct 43 ms 3940 KB Output is correct
17 Correct 43 ms 3424 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1441 ms 26104 KB Output is correct
2 Correct 1475 ms 28788 KB Output is correct
3 Correct 1470 ms 28860 KB Output is correct
4 Correct 1500 ms 29044 KB Output is correct
5 Correct 1507 ms 29112 KB Output is correct
6 Correct 2226 ms 30616 KB Output is correct
7 Correct 2222 ms 30444 KB Output is correct
8 Correct 2192 ms 30508 KB Output is correct
9 Correct 43 ms 3464 KB Output is correct
10 Correct 1239 ms 29584 KB Output is correct
11 Correct 1144 ms 29604 KB Output is correct
12 Correct 1277 ms 27184 KB Output is correct
13 Correct 1302 ms 30240 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1209 ms 18608 KB Output is correct
2 Correct 954 ms 9708 KB Output is correct
3 Correct 1433 ms 20496 KB Output is correct
4 Correct 1178 ms 18872 KB Output is correct
5 Correct 43 ms 2004 KB Output is correct
6 Correct 1361 ms 18812 KB Output is correct
7 Correct 1073 ms 18500 KB Output is correct
8 Correct 937 ms 18308 KB Output is correct
9 Correct 792 ms 17100 KB Output is correct
10 Correct 705 ms 17160 KB Output is correct
11 Correct 817 ms 19764 KB Output is correct
12 Correct 719 ms 19816 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1689 ms 24764 KB Output is correct
2 Correct 46 ms 3404 KB Output is correct
3 Correct 171 ms 4516 KB Output is correct
4 Correct 86 ms 4664 KB Output is correct
5 Correct 868 ms 27304 KB Output is correct
6 Correct 1641 ms 28668 KB Output is correct
7 Correct 842 ms 27204 KB Output is correct
8 Correct 813 ms 26528 KB Output is correct
9 Correct 802 ms 26684 KB Output is correct
10 Correct 806 ms 26556 KB Output is correct
11 Correct 1240 ms 27888 KB Output is correct
12 Correct 1228 ms 28300 KB Output is correct
13 Correct 1276 ms 28004 KB Output is correct
14 Correct 765 ms 27232 KB Output is correct
15 Correct 818 ms 27216 KB Output is correct
16 Correct 1684 ms 28856 KB Output is correct
17 Correct 1651 ms 28804 KB Output is correct
18 Correct 1668 ms 29488 KB Output is correct
19 Correct 1657 ms 29096 KB Output is correct
20 Correct 1405 ms 28264 KB Output is correct
21 Correct 1416 ms 28264 KB Output is correct
22 Correct 1611 ms 28300 KB Output is correct
23 Correct 949 ms 25048 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1441 ms 26104 KB Output is correct
2 Correct 1475 ms 28788 KB Output is correct
3 Correct 1470 ms 28860 KB Output is correct
4 Correct 1500 ms 29044 KB Output is correct
5 Correct 1507 ms 29112 KB Output is correct
6 Correct 2226 ms 30616 KB Output is correct
7 Correct 2222 ms 30444 KB Output is correct
8 Correct 2192 ms 30508 KB Output is correct
9 Correct 43 ms 3464 KB Output is correct
10 Correct 1239 ms 29584 KB Output is correct
11 Correct 1144 ms 29604 KB Output is correct
12 Correct 1277 ms 27184 KB Output is correct
13 Correct 1302 ms 30240 KB Output is correct
14 Correct 1209 ms 18608 KB Output is correct
15 Correct 954 ms 9708 KB Output is correct
16 Correct 1433 ms 20496 KB Output is correct
17 Correct 1178 ms 18872 KB Output is correct
18 Correct 43 ms 2004 KB Output is correct
19 Correct 1361 ms 18812 KB Output is correct
20 Correct 1073 ms 18500 KB Output is correct
21 Correct 937 ms 18308 KB Output is correct
22 Correct 792 ms 17100 KB Output is correct
23 Correct 705 ms 17160 KB Output is correct
24 Correct 817 ms 19764 KB Output is correct
25 Correct 719 ms 19816 KB Output is correct
26 Correct 1568 ms 28972 KB Output is correct
27 Correct 1904 ms 30700 KB Output is correct
28 Correct 1559 ms 29068 KB Output is correct
29 Correct 1098 ms 28444 KB Output is correct
30 Correct 1794 ms 30648 KB Output is correct
31 Correct 1800 ms 30552 KB Output is correct
32 Correct 1812 ms 30440 KB Output is correct
33 Correct 1470 ms 28816 KB Output is correct
34 Correct 1523 ms 28700 KB Output is correct
35 Correct 1546 ms 29024 KB Output is correct
36 Correct 1137 ms 28492 KB Output is correct
37 Correct 1137 ms 28568 KB Output is correct
38 Correct 1136 ms 28564 KB Output is correct
39 Correct 925 ms 27036 KB Output is correct
40 Correct 918 ms 27136 KB Output is correct
41 Correct 923 ms 27048 KB Output is correct
42 Correct 913 ms 29076 KB Output is correct
43 Correct 903 ms 28932 KB Output is correct
44 Correct 907 ms 28940 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 38 ms 2672 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 40 ms 2880 KB Output is correct
6 Correct 29 ms 2500 KB Output is correct
7 Correct 35 ms 3436 KB Output is correct
8 Correct 40 ms 2632 KB Output is correct
9 Correct 49 ms 4212 KB Output is correct
10 Correct 42 ms 2752 KB Output is correct
11 Correct 41 ms 2632 KB Output is correct
12 Correct 53 ms 2752 KB Output is correct
13 Correct 49 ms 2808 KB Output is correct
14 Correct 44 ms 2560 KB Output is correct
15 Correct 50 ms 2632 KB Output is correct
16 Correct 43 ms 3940 KB Output is correct
17 Correct 43 ms 3424 KB Output is correct
18 Correct 1441 ms 26104 KB Output is correct
19 Correct 1475 ms 28788 KB Output is correct
20 Correct 1470 ms 28860 KB Output is correct
21 Correct 1500 ms 29044 KB Output is correct
22 Correct 1507 ms 29112 KB Output is correct
23 Correct 2226 ms 30616 KB Output is correct
24 Correct 2222 ms 30444 KB Output is correct
25 Correct 2192 ms 30508 KB Output is correct
26 Correct 43 ms 3464 KB Output is correct
27 Correct 1239 ms 29584 KB Output is correct
28 Correct 1144 ms 29604 KB Output is correct
29 Correct 1277 ms 27184 KB Output is correct
30 Correct 1302 ms 30240 KB Output is correct
31 Correct 1209 ms 18608 KB Output is correct
32 Correct 954 ms 9708 KB Output is correct
33 Correct 1433 ms 20496 KB Output is correct
34 Correct 1178 ms 18872 KB Output is correct
35 Correct 43 ms 2004 KB Output is correct
36 Correct 1361 ms 18812 KB Output is correct
37 Correct 1073 ms 18500 KB Output is correct
38 Correct 937 ms 18308 KB Output is correct
39 Correct 792 ms 17100 KB Output is correct
40 Correct 705 ms 17160 KB Output is correct
41 Correct 817 ms 19764 KB Output is correct
42 Correct 719 ms 19816 KB Output is correct
43 Correct 1689 ms 24764 KB Output is correct
44 Correct 46 ms 3404 KB Output is correct
45 Correct 171 ms 4516 KB Output is correct
46 Correct 86 ms 4664 KB Output is correct
47 Correct 868 ms 27304 KB Output is correct
48 Correct 1641 ms 28668 KB Output is correct
49 Correct 842 ms 27204 KB Output is correct
50 Correct 813 ms 26528 KB Output is correct
51 Correct 802 ms 26684 KB Output is correct
52 Correct 806 ms 26556 KB Output is correct
53 Correct 1240 ms 27888 KB Output is correct
54 Correct 1228 ms 28300 KB Output is correct
55 Correct 1276 ms 28004 KB Output is correct
56 Correct 765 ms 27232 KB Output is correct
57 Correct 818 ms 27216 KB Output is correct
58 Correct 1684 ms 28856 KB Output is correct
59 Correct 1651 ms 28804 KB Output is correct
60 Correct 1668 ms 29488 KB Output is correct
61 Correct 1657 ms 29096 KB Output is correct
62 Correct 1405 ms 28264 KB Output is correct
63 Correct 1416 ms 28264 KB Output is correct
64 Correct 1611 ms 28300 KB Output is correct
65 Correct 949 ms 25048 KB Output is correct
66 Correct 1568 ms 28972 KB Output is correct
67 Correct 1904 ms 30700 KB Output is correct
68 Correct 1559 ms 29068 KB Output is correct
69 Correct 1098 ms 28444 KB Output is correct
70 Correct 1794 ms 30648 KB Output is correct
71 Correct 1800 ms 30552 KB Output is correct
72 Correct 1812 ms 30440 KB Output is correct
73 Correct 1470 ms 28816 KB Output is correct
74 Correct 1523 ms 28700 KB Output is correct
75 Correct 1546 ms 29024 KB Output is correct
76 Correct 1137 ms 28492 KB Output is correct
77 Correct 1137 ms 28568 KB Output is correct
78 Correct 1136 ms 28564 KB Output is correct
79 Correct 925 ms 27036 KB Output is correct
80 Correct 918 ms 27136 KB Output is correct
81 Correct 923 ms 27048 KB Output is correct
82 Correct 913 ms 29076 KB Output is correct
83 Correct 903 ms 28932 KB Output is correct
84 Correct 907 ms 28940 KB Output is correct
85 Correct 2175 ms 30900 KB Output is correct
86 Correct 208 ms 6612 KB Output is correct
87 Correct 134 ms 7948 KB Output is correct
88 Correct 1320 ms 31168 KB Output is correct
89 Correct 2143 ms 31040 KB Output is correct
90 Correct 1336 ms 31080 KB Output is correct
91 Correct 1602 ms 28692 KB Output is correct
92 Correct 1585 ms 28776 KB Output is correct
93 Correct 2301 ms 30160 KB Output is correct
94 Correct 1857 ms 30384 KB Output is correct
95 Correct 1846 ms 30632 KB Output is correct
96 Correct 2245 ms 31944 KB Output is correct
97 Correct 1016 ms 27720 KB Output is correct
98 Correct 1063 ms 30828 KB Output is correct
99 Correct 2184 ms 31272 KB Output is correct
100 Correct 2163 ms 31176 KB Output is correct
101 Correct 2252 ms 31264 KB Output is correct
102 Correct 2228 ms 31368 KB Output is correct
103 Correct 2458 ms 32228 KB Output is correct
104 Correct 2429 ms 32232 KB Output is correct
105 Correct 1807 ms 32004 KB Output is correct
106 Correct 1432 ms 31668 KB Output is correct
107 Correct 1678 ms 28928 KB Output is correct
108 Correct 2271 ms 31024 KB Output is correct
109 Correct 1632 ms 29008 KB Output is correct