oj.uz

Submission #363971

# Submission time Handle Problem Language Result Execution time Memory
363971 2021-02-07T17:39:02 Z penguinhacker Bridges (APIO19_bridges) C++14
100 / 100
 2663 ms 9220 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN = 100000;
const int B = 1000;
int n, m, q, ans[mxN];
int par[mxN], sz[mxN];

ar<int, 3> e[mxN];
ar<int, 3> qry[mxN];

vector<int> rb;

void reset() {
	rb.clear();
	fill(sz, sz + n, 1);
	iota(par, par + n, 0);
}

int find(int i) {
	while(i != par[i]) i = par[i];
	return i;
}

void merge(int a, int b) {
	a = find(a), b = find(b);
	if (a == b) return;
	if (sz[a] < sz[b]) swap(a, b);
	rb.push_back(b);
	sz[a] += sz[b];
	par[b] = a;
}

void rollback(int k) {
	while(rb.size() > k) {
		int b = rb.back();
		rb.pop_back();
		sz[par[b]] -= sz[b];
		par[b] = b;
	}
}

vector<int> to_join[B];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < m; ++i) cin >> e[i][0] >> e[i][1] >> e[i][2], --e[i][0], --e[i][1];
	cin >> q;
	for (int i = 0; i < q; ++i) cin >> qry[i][0] >> qry[i][1] >> qry[i][2], --qry[i][1];

	for (int l = 0; l < q; l += B) {
		reset();
		int r = min(q, l + B);
		vector<bool> changed(m);
		for (int i = l; i < r; ++i) if (qry[i][0] == 1) changed[qry[i][1]] = 1;

		vector<int> upd, unchanged, ask;
		for (int i = 0; i < m; ++i) {
			if (changed[i]) upd.push_back(i);
			if (!changed[i]) unchanged.push_back(i);
		}
		for (int i = l; i < r; ++i) {
			if (qry[i][0] == 1) e[qry[i][1]][2] = qry[i][2];
			else {
				to_join[i - l].clear();
				for (int ind : upd) if (e[ind][2] >= qry[i][2]) to_join[i - l].push_back(ind);
				ask.push_back(i);
			}
		}
		sort(unchanged.begin(), unchanged.end(), [&](int a, int b) {return e[a][2] < e[b][2];});
		sort(ask.begin(), ask.end(), [&](int a, int b) {return qry[a][2] > qry[b][2];});
		for (int i : ask) {
			while(!unchanged.empty()) {
				int x = unchanged.back();
				if (e[x][2] < qry[i][2]) break;
				merge(e[x][0], e[x][1]);
				unchanged.pop_back();
			}
			int prv_sz = rb.size();
			for (int x : to_join[i - l]) merge(e[x][0], e[x][1]);
			ans[i] = sz[find(qry[i][1])];
			rollback(prv_sz);
		}
	}
	for (int i = 0; i < q; ++i) if (qry[i][0] == 2) cout << ans[i] << "\n";
	return 0;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:38:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |  while(rb.size() > k) {
      |        ~~~~~~~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 37 ms 2668 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 12 ms 1132 KB Output is correct
6 Correct 10 ms 1004 KB Output is correct
7 Correct 14 ms 1132 KB Output is correct
8 Correct 14 ms 1132 KB Output is correct
9 Correct 19 ms 1132 KB Output is correct
10 Correct 15 ms 1132 KB Output is correct
11 Correct 15 ms 1132 KB Output is correct
12 Correct 20 ms 1132 KB Output is correct
13 Correct 24 ms 1516 KB Output is correct
14 Correct 20 ms 1408 KB Output is correct
15 Correct 16 ms 1132 KB Output is correct
16 Correct 17 ms 1132 KB Output is correct
17 Correct 15 ms 1132 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1611 ms 6332 KB Output is correct
2 Correct 1587 ms 6404 KB Output is correct
3 Correct 1594 ms 6452 KB Output is correct
4 Correct 1595 ms 6312 KB Output is correct
5 Correct 1562 ms 6408 KB Output is correct
6 Correct 2286 ms 7844 KB Output is correct
7 Correct 2262 ms 8048 KB Output is correct
8 Correct 2285 ms 8128 KB Output is correct
9 Correct 39 ms 2156 KB Output is correct
10 Correct 1352 ms 8124 KB Output is correct
11 Correct 1286 ms 7904 KB Output is correct
12 Correct 1487 ms 4536 KB Output is correct
13 Correct 1352 ms 7672 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1253 ms 5672 KB Output is correct
2 Correct 884 ms 6264 KB Output is correct
3 Correct 1443 ms 7492 KB Output is correct
4 Correct 1248 ms 5696 KB Output is correct
5 Correct 42 ms 2156 KB Output is correct
6 Correct 1386 ms 5836 KB Output is correct
7 Correct 1126 ms 5540 KB Output is correct
8 Correct 984 ms 5472 KB Output is correct
9 Correct 836 ms 4004 KB Output is correct
10 Correct 728 ms 3796 KB Output is correct
11 Correct 822 ms 7376 KB Output is correct
12 Correct 730 ms 7556 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1830 ms 5196 KB Output is correct
2 Correct 42 ms 2156 KB Output is correct
3 Correct 183 ms 2696 KB Output is correct
4 Correct 86 ms 2868 KB Output is correct
5 Correct 920 ms 5112 KB Output is correct
6 Correct 1747 ms 5192 KB Output is correct
7 Correct 922 ms 5220 KB Output is correct
8 Correct 891 ms 3924 KB Output is correct
9 Correct 932 ms 3904 KB Output is correct
10 Correct 902 ms 3848 KB Output is correct
11 Correct 1347 ms 4468 KB Output is correct
12 Correct 1344 ms 4880 KB Output is correct
13 Correct 1350 ms 4904 KB Output is correct
14 Correct 868 ms 5360 KB Output is correct
15 Correct 853 ms 5388 KB Output is correct
16 Correct 1799 ms 5068 KB Output is correct
17 Correct 1797 ms 5184 KB Output is correct
18 Correct 1859 ms 5176 KB Output is correct
19 Correct 1791 ms 5272 KB Output is correct
20 Correct 1530 ms 5080 KB Output is correct
21 Correct 1542 ms 5116 KB Output is correct
22 Correct 1754 ms 5108 KB Output is correct
23 Correct 998 ms 4956 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1611 ms 6332 KB Output is correct
2 Correct 1587 ms 6404 KB Output is correct
3 Correct 1594 ms 6452 KB Output is correct
4 Correct 1595 ms 6312 KB Output is correct
5 Correct 1562 ms 6408 KB Output is correct
6 Correct 2286 ms 7844 KB Output is correct
7 Correct 2262 ms 8048 KB Output is correct
8 Correct 2285 ms 8128 KB Output is correct
9 Correct 39 ms 2156 KB Output is correct
10 Correct 1352 ms 8124 KB Output is correct
11 Correct 1286 ms 7904 KB Output is correct
12 Correct 1487 ms 4536 KB Output is correct
13 Correct 1352 ms 7672 KB Output is correct
14 Correct 1253 ms 5672 KB Output is correct
15 Correct 884 ms 6264 KB Output is correct
16 Correct 1443 ms 7492 KB Output is correct
17 Correct 1248 ms 5696 KB Output is correct
18 Correct 42 ms 2156 KB Output is correct
19 Correct 1386 ms 5836 KB Output is correct
20 Correct 1126 ms 5540 KB Output is correct
21 Correct 984 ms 5472 KB Output is correct
22 Correct 836 ms 4004 KB Output is correct
23 Correct 728 ms 3796 KB Output is correct
24 Correct 822 ms 7376 KB Output is correct
25 Correct 730 ms 7556 KB Output is correct
26 Correct 1655 ms 6408 KB Output is correct
27 Correct 2059 ms 8068 KB Output is correct
28 Correct 1707 ms 6340 KB Output is correct
29 Correct 1235 ms 6160 KB Output is correct
30 Correct 2017 ms 7916 KB Output is correct
31 Correct 1996 ms 8248 KB Output is correct
32 Correct 2019 ms 7956 KB Output is correct
33 Correct 1746 ms 6492 KB Output is correct
34 Correct 1776 ms 6288 KB Output is correct
35 Correct 1733 ms 6312 KB Output is correct
36 Correct 1288 ms 6196 KB Output is correct
37 Correct 1276 ms 6012 KB Output is correct
38 Correct 1286 ms 6016 KB Output is correct
39 Correct 1030 ms 4504 KB Output is correct
40 Correct 1048 ms 4456 KB Output is correct
41 Correct 1041 ms 4504 KB Output is correct
42 Correct 1033 ms 7556 KB Output is correct
43 Correct 1014 ms 7428 KB Output is correct
44 Correct 997 ms 7344 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 37 ms 2668 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 12 ms 1132 KB Output is correct
6 Correct 10 ms 1004 KB Output is correct
7 Correct 14 ms 1132 KB Output is correct
8 Correct 14 ms 1132 KB Output is correct
9 Correct 19 ms 1132 KB Output is correct
10 Correct 15 ms 1132 KB Output is correct
11 Correct 15 ms 1132 KB Output is correct
12 Correct 20 ms 1132 KB Output is correct
13 Correct 24 ms 1516 KB Output is correct
14 Correct 20 ms 1408 KB Output is correct
15 Correct 16 ms 1132 KB Output is correct
16 Correct 17 ms 1132 KB Output is correct
17 Correct 15 ms 1132 KB Output is correct
18 Correct 1611 ms 6332 KB Output is correct
19 Correct 1587 ms 6404 KB Output is correct
20 Correct 1594 ms 6452 KB Output is correct
21 Correct 1595 ms 6312 KB Output is correct
22 Correct 1562 ms 6408 KB Output is correct
23 Correct 2286 ms 7844 KB Output is correct
24 Correct 2262 ms 8048 KB Output is correct
25 Correct 2285 ms 8128 KB Output is correct
26 Correct 39 ms 2156 KB Output is correct
27 Correct 1352 ms 8124 KB Output is correct
28 Correct 1286 ms 7904 KB Output is correct
29 Correct 1487 ms 4536 KB Output is correct
30 Correct 1352 ms 7672 KB Output is correct
31 Correct 1253 ms 5672 KB Output is correct
32 Correct 884 ms 6264 KB Output is correct
33 Correct 1443 ms 7492 KB Output is correct
34 Correct 1248 ms 5696 KB Output is correct
35 Correct 42 ms 2156 KB Output is correct
36 Correct 1386 ms 5836 KB Output is correct
37 Correct 1126 ms 5540 KB Output is correct
38 Correct 984 ms 5472 KB Output is correct
39 Correct 836 ms 4004 KB Output is correct
40 Correct 728 ms 3796 KB Output is correct
41 Correct 822 ms 7376 KB Output is correct
42 Correct 730 ms 7556 KB Output is correct
43 Correct 1830 ms 5196 KB Output is correct
44 Correct 42 ms 2156 KB Output is correct
45 Correct 183 ms 2696 KB Output is correct
46 Correct 86 ms 2868 KB Output is correct
47 Correct 920 ms 5112 KB Output is correct
48 Correct 1747 ms 5192 KB Output is correct
49 Correct 922 ms 5220 KB Output is correct
50 Correct 891 ms 3924 KB Output is correct
51 Correct 932 ms 3904 KB Output is correct
52 Correct 902 ms 3848 KB Output is correct
53 Correct 1347 ms 4468 KB Output is correct
54 Correct 1344 ms 4880 KB Output is correct
55 Correct 1350 ms 4904 KB Output is correct
56 Correct 868 ms 5360 KB Output is correct
57 Correct 853 ms 5388 KB Output is correct
58 Correct 1799 ms 5068 KB Output is correct
59 Correct 1797 ms 5184 KB Output is correct
60 Correct 1859 ms 5176 KB Output is correct
61 Correct 1791 ms 5272 KB Output is correct
62 Correct 1530 ms 5080 KB Output is correct
63 Correct 1542 ms 5116 KB Output is correct
64 Correct 1754 ms 5108 KB Output is correct
65 Correct 998 ms 4956 KB Output is correct
66 Correct 1655 ms 6408 KB Output is correct
67 Correct 2059 ms 8068 KB Output is correct
68 Correct 1707 ms 6340 KB Output is correct
69 Correct 1235 ms 6160 KB Output is correct
70 Correct 2017 ms 7916 KB Output is correct
71 Correct 1996 ms 8248 KB Output is correct
72 Correct 2019 ms 7956 KB Output is correct
73 Correct 1746 ms 6492 KB Output is correct
74 Correct 1776 ms 6288 KB Output is correct
75 Correct 1733 ms 6312 KB Output is correct
76 Correct 1288 ms 6196 KB Output is correct
77 Correct 1276 ms 6012 KB Output is correct
78 Correct 1286 ms 6016 KB Output is correct
79 Correct 1030 ms 4504 KB Output is correct
80 Correct 1048 ms 4456 KB Output is correct
81 Correct 1041 ms 4504 KB Output is correct
82 Correct 1033 ms 7556 KB Output is correct
83 Correct 1014 ms 7428 KB Output is correct
84 Correct 997 ms 7344 KB Output is correct
85 Correct 2398 ms 7244 KB Output is correct
86 Correct 231 ms 4800 KB Output is correct
87 Correct 150 ms 5956 KB Output is correct
88 Correct 1553 ms 9120 KB Output is correct
89 Correct 2421 ms 7740 KB Output is correct
90 Correct 1575 ms 9220 KB Output is correct
91 Correct 1820 ms 6356 KB Output is correct
92 Correct 1757 ms 6452 KB Output is correct
93 Correct 2597 ms 7764 KB Output is correct
94 Correct 2116 ms 7308 KB Output is correct
95 Correct 2070 ms 7012 KB Output is correct
96 Correct 2458 ms 8908 KB Output is correct
97 Correct 1111 ms 5436 KB Output is correct
98 Correct 1185 ms 8952 KB Output is correct
99 Correct 2440 ms 7788 KB Output is correct
100 Correct 2410 ms 7528 KB Output is correct
101 Correct 2482 ms 7352 KB Output is correct
102 Correct 2448 ms 7552 KB Output is correct
103 Correct 2663 ms 8612 KB Output is correct
104 Correct 2636 ms 8672 KB Output is correct
105 Correct 1973 ms 8676 KB Output is correct
106 Correct 1568 ms 8404 KB Output is correct
107 Correct 1836 ms 5756 KB Output is correct
108 Correct 2474 ms 7788 KB Output is correct
109 Correct 1826 ms 8832 KB Output is correct