oj.uz

Submission #559002

# Submission time Handle Problem Language Result Execution time Memory
559002 2022-05-09T07:24:49 Z hollwo_pelw Bridges (APIO19_bridges) C++17
100 / 100
 2567 ms 109060 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 = 800;

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 2 ms 2680 KB Output is correct
3 Correct 40 ms 8624 KB Output is correct
4 Correct 6 ms 2900 KB Output is correct
5 Correct 36 ms 9324 KB Output is correct
6 Correct 32 ms 9004 KB Output is correct
7 Correct 30 ms 8848 KB Output is correct
8 Correct 42 ms 8152 KB Output is correct
9 Correct 44 ms 12724 KB Output is correct
10 Correct 37 ms 8696 KB Output is correct
11 Correct 36 ms 8604 KB Output is correct
12 Correct 47 ms 10336 KB Output is correct
13 Correct 43 ms 9100 KB Output is correct
14 Correct 40 ms 8440 KB Output is correct
15 Correct 42 ms 8904 KB Output is correct
16 Correct 39 ms 10320 KB Output is correct
17 Correct 40 ms 10144 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1502 ms 66012 KB Output is correct
2 Correct 1489 ms 65852 KB Output is correct
3 Correct 1465 ms 66164 KB Output is correct
4 Correct 1544 ms 65832 KB Output is correct
5 Correct 1518 ms 66072 KB Output is correct
6 Correct 1999 ms 108748 KB Output is correct
7 Correct 1984 ms 108768 KB Output is correct
8 Correct 1999 ms 108636 KB Output is correct
9 Correct 42 ms 4416 KB Output is correct
10 Correct 1057 ms 83296 KB Output is correct
11 Correct 995 ms 84588 KB Output is correct
12 Correct 1368 ms 53688 KB Output is correct
13 Correct 1310 ms 47724 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1175 ms 64656 KB Output is correct
2 Correct 747 ms 84476 KB Output is correct
3 Correct 1277 ms 86032 KB Output is correct
4 Correct 1134 ms 64348 KB Output is correct
5 Correct 46 ms 4380 KB Output is correct
6 Correct 1273 ms 82448 KB Output is correct
7 Correct 1054 ms 56268 KB Output is correct
8 Correct 981 ms 42644 KB Output is correct
9 Correct 836 ms 34896 KB Output is correct
10 Correct 788 ms 25280 KB Output is correct
11 Correct 868 ms 34204 KB Output is correct
12 Correct 773 ms 25000 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2061 ms 9012 KB Output is correct
2 Correct 42 ms 4408 KB Output is correct
3 Correct 222 ms 5308 KB Output is correct
4 Correct 95 ms 5212 KB Output is correct
5 Correct 1040 ms 9024 KB Output is correct
6 Correct 2041 ms 8972 KB Output is correct
7 Correct 1048 ms 9020 KB Output is correct
8 Correct 1045 ms 7556 KB Output is correct
9 Correct 1025 ms 7548 KB Output is correct
10 Correct 1043 ms 7848 KB Output is correct
11 Correct 1538 ms 8372 KB Output is correct
12 Correct 1548 ms 8364 KB Output is correct
13 Correct 1612 ms 8584 KB Output is correct
14 Correct 942 ms 9580 KB Output is correct
15 Correct 1002 ms 9532 KB Output is correct
16 Correct 2138 ms 9572 KB Output is correct
17 Correct 2125 ms 9388 KB Output is correct
18 Correct 2129 ms 9468 KB Output is correct
19 Correct 2082 ms 9468 KB Output is correct
20 Correct 1844 ms 9284 KB Output is correct
21 Correct 1811 ms 9284 KB Output is correct
22 Correct 2131 ms 9496 KB Output is correct
23 Correct 1207 ms 9032 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1502 ms 66012 KB Output is correct
2 Correct 1489 ms 65852 KB Output is correct
3 Correct 1465 ms 66164 KB Output is correct
4 Correct 1544 ms 65832 KB Output is correct
5 Correct 1518 ms 66072 KB Output is correct
6 Correct 1999 ms 108748 KB Output is correct
7 Correct 1984 ms 108768 KB Output is correct
8 Correct 1999 ms 108636 KB Output is correct
9 Correct 42 ms 4416 KB Output is correct
10 Correct 1057 ms 83296 KB Output is correct
11 Correct 995 ms 84588 KB Output is correct
12 Correct 1368 ms 53688 KB Output is correct
13 Correct 1310 ms 47724 KB Output is correct
14 Correct 1175 ms 64656 KB Output is correct
15 Correct 747 ms 84476 KB Output is correct
16 Correct 1277 ms 86032 KB Output is correct
17 Correct 1134 ms 64348 KB Output is correct
18 Correct 46 ms 4380 KB Output is correct
19 Correct 1273 ms 82448 KB Output is correct
20 Correct 1054 ms 56268 KB Output is correct
21 Correct 981 ms 42644 KB Output is correct
22 Correct 836 ms 34896 KB Output is correct
23 Correct 788 ms 25280 KB Output is correct
24 Correct 868 ms 34204 KB Output is correct
25 Correct 773 ms 25000 KB Output is correct
26 Correct 1638 ms 65416 KB Output is correct
27 Correct 1804 ms 87656 KB Output is correct
28 Correct 1629 ms 64012 KB Output is correct
29 Correct 1271 ms 26956 KB Output is correct
30 Correct 1803 ms 77496 KB Output is correct
31 Correct 1807 ms 79072 KB Output is correct
32 Correct 1791 ms 79516 KB Output is correct
33 Correct 1662 ms 63488 KB Output is correct
34 Correct 1633 ms 64240 KB Output is correct
35 Correct 1605 ms 64228 KB Output is correct
36 Correct 1342 ms 32948 KB Output is correct
37 Correct 1300 ms 31620 KB Output is correct
38 Correct 1343 ms 30192 KB Output is correct
39 Correct 1157 ms 18000 KB Output is correct
40 Correct 1169 ms 17268 KB Output is correct
41 Correct 1138 ms 16908 KB Output is correct
42 Correct 1122 ms 16720 KB Output is correct
43 Correct 1119 ms 16248 KB Output is correct
44 Correct 1118 ms 15632 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 2 ms 2680 KB Output is correct
3 Correct 40 ms 8624 KB Output is correct
4 Correct 6 ms 2900 KB Output is correct
5 Correct 36 ms 9324 KB Output is correct
6 Correct 32 ms 9004 KB Output is correct
7 Correct 30 ms 8848 KB Output is correct
8 Correct 42 ms 8152 KB Output is correct
9 Correct 44 ms 12724 KB Output is correct
10 Correct 37 ms 8696 KB Output is correct
11 Correct 36 ms 8604 KB Output is correct
12 Correct 47 ms 10336 KB Output is correct
13 Correct 43 ms 9100 KB Output is correct
14 Correct 40 ms 8440 KB Output is correct
15 Correct 42 ms 8904 KB Output is correct
16 Correct 39 ms 10320 KB Output is correct
17 Correct 40 ms 10144 KB Output is correct
18 Correct 1502 ms 66012 KB Output is correct
19 Correct 1489 ms 65852 KB Output is correct
20 Correct 1465 ms 66164 KB Output is correct
21 Correct 1544 ms 65832 KB Output is correct
22 Correct 1518 ms 66072 KB Output is correct
23 Correct 1999 ms 108748 KB Output is correct
24 Correct 1984 ms 108768 KB Output is correct
25 Correct 1999 ms 108636 KB Output is correct
26 Correct 42 ms 4416 KB Output is correct
27 Correct 1057 ms 83296 KB Output is correct
28 Correct 995 ms 84588 KB Output is correct
29 Correct 1368 ms 53688 KB Output is correct
30 Correct 1310 ms 47724 KB Output is correct
31 Correct 1175 ms 64656 KB Output is correct
32 Correct 747 ms 84476 KB Output is correct
33 Correct 1277 ms 86032 KB Output is correct
34 Correct 1134 ms 64348 KB Output is correct
35 Correct 46 ms 4380 KB Output is correct
36 Correct 1273 ms 82448 KB Output is correct
37 Correct 1054 ms 56268 KB Output is correct
38 Correct 981 ms 42644 KB Output is correct
39 Correct 836 ms 34896 KB Output is correct
40 Correct 788 ms 25280 KB Output is correct
41 Correct 868 ms 34204 KB Output is correct
42 Correct 773 ms 25000 KB Output is correct
43 Correct 2061 ms 9012 KB Output is correct
44 Correct 42 ms 4408 KB Output is correct
45 Correct 222 ms 5308 KB Output is correct
46 Correct 95 ms 5212 KB Output is correct
47 Correct 1040 ms 9024 KB Output is correct
48 Correct 2041 ms 8972 KB Output is correct
49 Correct 1048 ms 9020 KB Output is correct
50 Correct 1045 ms 7556 KB Output is correct
51 Correct 1025 ms 7548 KB Output is correct
52 Correct 1043 ms 7848 KB Output is correct
53 Correct 1538 ms 8372 KB Output is correct
54 Correct 1548 ms 8364 KB Output is correct
55 Correct 1612 ms 8584 KB Output is correct
56 Correct 942 ms 9580 KB Output is correct
57 Correct 1002 ms 9532 KB Output is correct
58 Correct 2138 ms 9572 KB Output is correct
59 Correct 2125 ms 9388 KB Output is correct
60 Correct 2129 ms 9468 KB Output is correct
61 Correct 2082 ms 9468 KB Output is correct
62 Correct 1844 ms 9284 KB Output is correct
63 Correct 1811 ms 9284 KB Output is correct
64 Correct 2131 ms 9496 KB Output is correct
65 Correct 1207 ms 9032 KB Output is correct
66 Correct 1638 ms 65416 KB Output is correct
67 Correct 1804 ms 87656 KB Output is correct
68 Correct 1629 ms 64012 KB Output is correct
69 Correct 1271 ms 26956 KB Output is correct
70 Correct 1803 ms 77496 KB Output is correct
71 Correct 1807 ms 79072 KB Output is correct
72 Correct 1791 ms 79516 KB Output is correct
73 Correct 1662 ms 63488 KB Output is correct
74 Correct 1633 ms 64240 KB Output is correct
75 Correct 1605 ms 64228 KB Output is correct
76 Correct 1342 ms 32948 KB Output is correct
77 Correct 1300 ms 31620 KB Output is correct
78 Correct 1343 ms 30192 KB Output is correct
79 Correct 1157 ms 18000 KB Output is correct
80 Correct 1169 ms 17268 KB Output is correct
81 Correct 1138 ms 16908 KB Output is correct
82 Correct 1122 ms 16720 KB Output is correct
83 Correct 1119 ms 16248 KB Output is correct
84 Correct 1118 ms 15632 KB Output is correct
85 Correct 2512 ms 66628 KB Output is correct
86 Correct 233 ms 11264 KB Output is correct
87 Correct 143 ms 15236 KB Output is correct
88 Correct 1428 ms 78604 KB Output is correct
89 Correct 2433 ms 65704 KB Output is correct
90 Correct 1482 ms 79184 KB Output is correct
91 Correct 1620 ms 65668 KB Output is correct
92 Correct 1610 ms 65448 KB Output is correct
93 Correct 2136 ms 108780 KB Output is correct
94 Correct 2062 ms 66128 KB Output is correct
95 Correct 2078 ms 65832 KB Output is correct
96 Correct 2279 ms 108568 KB Output is correct
97 Correct 1300 ms 36920 KB Output is correct
98 Correct 1255 ms 37372 KB Output is correct
99 Correct 2567 ms 67628 KB Output is correct
100 Correct 2538 ms 66516 KB Output is correct
101 Correct 2537 ms 66184 KB Output is correct
102 Correct 2518 ms 66232 KB Output is correct
103 Correct 2504 ms 108944 KB Output is correct
104 Correct 2413 ms 109024 KB Output is correct
105 Correct 2029 ms 48256 KB Output is correct
106 Correct 1759 ms 28460 KB Output is correct
107 Correct 1966 ms 53448 KB Output is correct
108 Correct 2431 ms 109060 KB Output is correct
109 Correct 1691 ms 108572 KB Output is correct