oj.uz

Submission #559000

# Submission time Handle Problem Language Result Execution time Memory
559000 2022-05-09T07:23:21 Z hollwo_pelw Bridges (APIO19_bridges) C++17
100 / 100
 2273 ms 133012 KB 
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;

void Hollwo_Pelw();

signed main(){
#ifndef hollwo_pelw_local
	if (fopen("A.inp", "r"))
		assert(freopen("A.inp", "r", stdin)), assert(freopen("A.out", "w", stdout));
#else
	auto start = chrono::steady_clock::now();
#endif
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
	int testcases = 1;
	// cin >> testcases;
	for (int test = 1; test <= testcases; test++){
		// cout << "Case #" << test << ": ";
		Hollwo_Pelw();
	}
#ifdef hollwo_pelw_local
	auto end = chrono::steady_clock::now();
	cout << "\nExcution time : " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}

const int N = 5e4 + 5, M = 1e5 + 5, B = 1000;

int n, m, q, u[M], v[M], w[M], t[M], x[M], y[M];
int change[M], par[N], siz[N], res[M];
vector<pair<int*, int>> st;
vector<int> to_upd[M];

inline int find(int u) { return par[u] == u ? u : find(par[u]); }
inline void merge(int u, int v) {
	if ((u = find(u)) != (v = find(v))) {
		if (siz[u] > siz[v])
			swap(u, v);
		st.emplace_back(par + u, par[u]);
		st.emplace_back(siz + v, siz[v]);
		siz[par[u] = v] += siz[u];
	}
}

inline void rollback(int k) {
	for (; (int) st.size() > k; st.pop_back())
		*st.back().first = st.back().second;
}

void Hollwo_Pelw(){
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> u[i] >> v[i] >> w[i];
	}
	cin >> q;
	for (int i = 1; i <= q; i++) {
		cin >> t[i] >> x[i] >> y[i];
	}

	iota(par + 1, par + n + 1, 1);
	fill(siz + 1, siz + n + 1, 1);

	for (int l = 1, r = min(B, q); l <= q; l += B, r = min(r + B, q)) {
		vector<int> ask, upd, lef;
		fill(change + 1, change + m + 1, 0);
		for (int i = l; i <= r; i++) {
			if (t[i] == 1) {
				change[x[i]] = 1;
				upd.push_back(i);
			} else {
				ask.push_back(i);
			}
		}
		for (int i = 1; i <= m; i++) {
			if (!change[i])
				lef.push_back(i);
		}

		for (int i = l; i <= r; i++) {
			if (t[i] == 1) {
				w[x[i]] = y[i];
			} else {
				for (int j : upd) {
					if (w[x[j]] >= y[i])
						to_upd[i].push_back(x[j]);
				}
			}
		}

		sort(ask.begin(), ask.end(), [&](const int &i, const int &j){ return y[i] > y[j]; });
		sort(lef.begin(), lef.end(), [&](const int &i, const int &j){ return w[i] > w[j]; });

		for (int i = 0, j = 0; i < (int) ask.size(); i++) {
			while (j < (int) lef.size() && w[lef[j]] >= y[ask[i]]) {
				merge(u[lef[j]], v[lef[j]]), j ++;
			}

			
			int k = st.size();
			for (int z : to_upd[ask[i]]) {
				merge(u[z], v[z]);
			}
	
			res[ask[i]] = siz[find(x[ask[i]])];
			rollback(k);
		}

		rollback(0);
	}

	for (int i = 1; i <= q; i++)
		if (t[i] == 2) cout << res[i] << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 38 ms 9664 KB Output is correct
4 Correct 6 ms 2916 KB Output is correct
5 Correct 37 ms 10412 KB Output is correct
6 Correct 28 ms 10608 KB Output is correct
7 Correct 32 ms 10572 KB Output is correct
8 Correct 44 ms 9048 KB Output is correct
9 Correct 43 ms 14804 KB Output is correct
10 Correct 43 ms 9772 KB Output is correct
11 Correct 41 ms 9564 KB Output is correct
12 Correct 57 ms 12060 KB Output is correct
13 Correct 57 ms 10188 KB Output is correct
14 Correct 49 ms 9408 KB Output is correct
15 Correct 53 ms 10144 KB Output is correct
16 Correct 43 ms 13088 KB Output is correct
17 Correct 44 ms 12212 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1377 ms 75216 KB Output is correct
2 Correct 1369 ms 75144 KB Output is correct
3 Correct 1481 ms 75540 KB Output is correct
4 Correct 1483 ms 75180 KB Output is correct
5 Correct 1526 ms 75652 KB Output is correct
6 Correct 2057 ms 133012 KB Output is correct
7 Correct 2008 ms 129548 KB Output is correct
8 Correct 2039 ms 129264 KB Output is correct
9 Correct 38 ms 5068 KB Output is correct
10 Correct 1160 ms 100924 KB Output is correct
11 Correct 1050 ms 100540 KB Output is correct
12 Correct 1237 ms 54760 KB Output is correct
13 Correct 1209 ms 48412 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1167 ms 74372 KB Output is correct
2 Correct 835 ms 99096 KB Output is correct
3 Correct 1323 ms 103960 KB Output is correct
4 Correct 1116 ms 75500 KB Output is correct
5 Correct 38 ms 5748 KB Output is correct
6 Correct 1256 ms 95380 KB Output is correct
7 Correct 1033 ms 67476 KB Output is correct
8 Correct 928 ms 51652 KB Output is correct
9 Correct 789 ms 43408 KB Output is correct
10 Correct 695 ms 31828 KB Output is correct
11 Correct 788 ms 41048 KB Output is correct
12 Correct 692 ms 30988 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1655 ms 10452 KB Output is correct
2 Correct 51 ms 5000 KB Output is correct
3 Correct 148 ms 5980 KB Output is correct
4 Correct 74 ms 5972 KB Output is correct
5 Correct 810 ms 9780 KB Output is correct
6 Correct 1563 ms 9608 KB Output is correct
7 Correct 811 ms 9872 KB Output is correct
8 Correct 830 ms 8276 KB Output is correct
9 Correct 820 ms 8280 KB Output is correct
10 Correct 841 ms 8424 KB Output is correct
11 Correct 1211 ms 9116 KB Output is correct
12 Correct 1199 ms 9088 KB Output is correct
13 Correct 1232 ms 9224 KB Output is correct
14 Correct 780 ms 9760 KB Output is correct
15 Correct 789 ms 9816 KB Output is correct
16 Correct 1613 ms 9668 KB Output is correct
17 Correct 1660 ms 9696 KB Output is correct
18 Correct 1612 ms 9716 KB Output is correct
19 Correct 1569 ms 9700 KB Output is correct
20 Correct 1330 ms 9492 KB Output is correct
21 Correct 1221 ms 9492 KB Output is correct
22 Correct 1358 ms 10044 KB Output is correct
23 Correct 794 ms 9236 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1377 ms 75216 KB Output is correct
2 Correct 1369 ms 75144 KB Output is correct
3 Correct 1481 ms 75540 KB Output is correct
4 Correct 1483 ms 75180 KB Output is correct
5 Correct 1526 ms 75652 KB Output is correct
6 Correct 2057 ms 133012 KB Output is correct
7 Correct 2008 ms 129548 KB Output is correct
8 Correct 2039 ms 129264 KB Output is correct
9 Correct 38 ms 5068 KB Output is correct
10 Correct 1160 ms 100924 KB Output is correct
11 Correct 1050 ms 100540 KB Output is correct
12 Correct 1237 ms 54760 KB Output is correct
13 Correct 1209 ms 48412 KB Output is correct
14 Correct 1167 ms 74372 KB Output is correct
15 Correct 835 ms 99096 KB Output is correct
16 Correct 1323 ms 103960 KB Output is correct
17 Correct 1116 ms 75500 KB Output is correct
18 Correct 38 ms 5748 KB Output is correct
19 Correct 1256 ms 95380 KB Output is correct
20 Correct 1033 ms 67476 KB Output is correct
21 Correct 928 ms 51652 KB Output is correct
22 Correct 789 ms 43408 KB Output is correct
23 Correct 695 ms 31828 KB Output is correct
24 Correct 788 ms 41048 KB Output is correct
25 Correct 692 ms 30988 KB Output is correct
26 Correct 1442 ms 77100 KB Output is correct
27 Correct 1693 ms 106152 KB Output is correct
28 Correct 1478 ms 75280 KB Output is correct
29 Correct 1049 ms 32376 KB Output is correct
30 Correct 1640 ms 92676 KB Output is correct
31 Correct 1668 ms 94948 KB Output is correct
32 Correct 1644 ms 95392 KB Output is correct
33 Correct 1411 ms 75612 KB Output is correct
34 Correct 1416 ms 75900 KB Output is correct
35 Correct 1384 ms 76020 KB Output is correct
36 Correct 1074 ms 39412 KB Output is correct
37 Correct 1065 ms 37988 KB Output is correct
38 Correct 1129 ms 36412 KB Output is correct
39 Correct 998 ms 22588 KB Output is correct
40 Correct 988 ms 21828 KB Output is correct
41 Correct 999 ms 21352 KB Output is correct
42 Correct 958 ms 20840 KB Output is correct
43 Correct 943 ms 20392 KB Output is correct
44 Correct 938 ms 19728 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 38 ms 9664 KB Output is correct
4 Correct 6 ms 2916 KB Output is correct
5 Correct 37 ms 10412 KB Output is correct
6 Correct 28 ms 10608 KB Output is correct
7 Correct 32 ms 10572 KB Output is correct
8 Correct 44 ms 9048 KB Output is correct
9 Correct 43 ms 14804 KB Output is correct
10 Correct 43 ms 9772 KB Output is correct
11 Correct 41 ms 9564 KB Output is correct
12 Correct 57 ms 12060 KB Output is correct
13 Correct 57 ms 10188 KB Output is correct
14 Correct 49 ms 9408 KB Output is correct
15 Correct 53 ms 10144 KB Output is correct
16 Correct 43 ms 13088 KB Output is correct
17 Correct 44 ms 12212 KB Output is correct
18 Correct 1377 ms 75216 KB Output is correct
19 Correct 1369 ms 75144 KB Output is correct
20 Correct 1481 ms 75540 KB Output is correct
21 Correct 1483 ms 75180 KB Output is correct
22 Correct 1526 ms 75652 KB Output is correct
23 Correct 2057 ms 133012 KB Output is correct
24 Correct 2008 ms 129548 KB Output is correct
25 Correct 2039 ms 129264 KB Output is correct
26 Correct 38 ms 5068 KB Output is correct
27 Correct 1160 ms 100924 KB Output is correct
28 Correct 1050 ms 100540 KB Output is correct
29 Correct 1237 ms 54760 KB Output is correct
30 Correct 1209 ms 48412 KB Output is correct
31 Correct 1167 ms 74372 KB Output is correct
32 Correct 835 ms 99096 KB Output is correct
33 Correct 1323 ms 103960 KB Output is correct
34 Correct 1116 ms 75500 KB Output is correct
35 Correct 38 ms 5748 KB Output is correct
36 Correct 1256 ms 95380 KB Output is correct
37 Correct 1033 ms 67476 KB Output is correct
38 Correct 928 ms 51652 KB Output is correct
39 Correct 789 ms 43408 KB Output is correct
40 Correct 695 ms 31828 KB Output is correct
41 Correct 788 ms 41048 KB Output is correct
42 Correct 692 ms 30988 KB Output is correct
43 Correct 1655 ms 10452 KB Output is correct
44 Correct 51 ms 5000 KB Output is correct
45 Correct 148 ms 5980 KB Output is correct
46 Correct 74 ms 5972 KB Output is correct
47 Correct 810 ms 9780 KB Output is correct
48 Correct 1563 ms 9608 KB Output is correct
49 Correct 811 ms 9872 KB Output is correct
50 Correct 830 ms 8276 KB Output is correct
51 Correct 820 ms 8280 KB Output is correct
52 Correct 841 ms 8424 KB Output is correct
53 Correct 1211 ms 9116 KB Output is correct
54 Correct 1199 ms 9088 KB Output is correct
55 Correct 1232 ms 9224 KB Output is correct
56 Correct 780 ms 9760 KB Output is correct
57 Correct 789 ms 9816 KB Output is correct
58 Correct 1613 ms 9668 KB Output is correct
59 Correct 1660 ms 9696 KB Output is correct
60 Correct 1612 ms 9716 KB Output is correct
61 Correct 1569 ms 9700 KB Output is correct
62 Correct 1330 ms 9492 KB Output is correct
63 Correct 1221 ms 9492 KB Output is correct
64 Correct 1358 ms 10044 KB Output is correct
65 Correct 794 ms 9236 KB Output is correct
66 Correct 1442 ms 77100 KB Output is correct
67 Correct 1693 ms 106152 KB Output is correct
68 Correct 1478 ms 75280 KB Output is correct
69 Correct 1049 ms 32376 KB Output is correct
70 Correct 1640 ms 92676 KB Output is correct
71 Correct 1668 ms 94948 KB Output is correct
72 Correct 1644 ms 95392 KB Output is correct
73 Correct 1411 ms 75612 KB Output is correct
74 Correct 1416 ms 75900 KB Output is correct
75 Correct 1384 ms 76020 KB Output is correct
76 Correct 1074 ms 39412 KB Output is correct
77 Correct 1065 ms 37988 KB Output is correct
78 Correct 1129 ms 36412 KB Output is correct
79 Correct 998 ms 22588 KB Output is correct
80 Correct 988 ms 21828 KB Output is correct
81 Correct 999 ms 21352 KB Output is correct
82 Correct 958 ms 20840 KB Output is correct
83 Correct 943 ms 20392 KB Output is correct
84 Correct 938 ms 19728 KB Output is correct
85 Correct 2173 ms 79184 KB Output is correct
86 Correct 214 ms 13396 KB Output is correct
87 Correct 119 ms 17792 KB Output is correct
88 Correct 1266 ms 91284 KB Output is correct
89 Correct 2136 ms 77844 KB Output is correct
90 Correct 1375 ms 99940 KB Output is correct
91 Correct 1573 ms 77012 KB Output is correct
92 Correct 1572 ms 76824 KB Output is correct
93 Correct 2220 ms 114648 KB Output is correct
94 Correct 1897 ms 78116 KB Output is correct
95 Correct 1828 ms 78008 KB Output is correct
96 Correct 2180 ms 118712 KB Output is correct
97 Correct 1029 ms 44056 KB Output is correct
98 Correct 1056 ms 40888 KB Output is correct
99 Correct 2209 ms 80128 KB Output is correct
100 Correct 2180 ms 78928 KB Output is correct
101 Correct 2265 ms 79060 KB Output is correct
102 Correct 2204 ms 78988 KB Output is correct
103 Correct 2273 ms 124140 KB Output is correct
104 Correct 2264 ms 123780 KB Output is correct
105 Correct 1758 ms 51488 KB Output is correct
106 Correct 1473 ms 31636 KB Output is correct
107 Correct 1652 ms 58108 KB Output is correct
108 Correct 2204 ms 114324 KB Output is correct
109 Correct 1517 ms 117872 KB Output is correct