oj.uz

Submission #562928

# Submission time Handle Problem Language Result Execution time Memory
562928 2022-05-15T15:51:10 Z SeDunion Bridges (APIO19_bridges) C++17
100 / 100
 2347 ms 17688 KB 
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,abm,fma,bmi2")
#include <iostream>
#include <cassert>
#include <algorithm>
#include <string>
#include <bitset> 
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#ifndef LOCAL
	#include <bits/stdc++.h>
	#define cerr if(false)cerr
#endif
 
using namespace std;
using ll = long long;
 
const int N = 2e5 + 66;
 
/*
sqrt on queries:
 
used[i] -> which edges are presented in the block
 
for each block, let's do a kruskal without used edges
^ with queires in this block
 
1
2
3
4
5
---
6
7
8
9
10
11
----
12
13
14
15
*/
 
int p[N], sz[N];
int rb[N];
int rbsz;
 
int get(int x) {
	while (x != p[x]) x = p[x];
	return x;
}
 
void unite(int a, int b) {
	a = get(a), b = get(b);
	if (a == b) return;
	if (sz[a] > sz[b]) swap(a, b);
	rb[rbsz++] = a;
	p[a] = b;
	sz[b] += sz[a];
}
 
void rollback(int oo) {
	while (rbsz > oo) {
		int i = rb[--rbsz];
		sz[p[i]] -= sz[i];
		p[i] = i;
	}
}
 
int ea[N], eb[N], ec[N];
int qt[N], qx[N], qy[N];
 
vector<pair<int,int>>ev[N];
int ans[N];
const int K = 700;
 
int used[N];
 
vector<int>ed;
 
int curc[N];
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<int>all;
	for (int i = 1 ; i <= m ; ++ i) {
		cin >> ea[i] >> eb[i] >> ec[i];
		ec[i] = -ec[i];
		all.emplace_back(ec[i]);
	}
	int q;
	cin >> q;
	for (int i = 0 ; i < q ; ++ i) {
		cin >> qt[i] >> qx[i] >> qy[i];
		qy[i] = -qy[i];
		all.emplace_back(qy[i]);
	}
	sort(all.begin(), all.end());
	all.resize(unique(all.begin(), all.end()) - all.begin());
	for (int i = 1 ; i <= m ; ++ i) {
		ec[i] = lower_bound(all.begin(), all.end(), ec[i]) - all.begin();
	}
	for (int i = 0 ; i < q ; ++ i) {
		qy[i] = lower_bound(all.begin(), all.end(), qy[i]) - all.begin();
	}
	for (int l = 0 ; l < q ; l += K) {
		int r = min(q - 1, l + K - 1);
		for (int i = 1 ; i <= m ; ++ i) used[i] = 0;
		for (int i = l ; i <= r ; ++ i) {
			if (qt[i] == 1) used[qx[i]] = 1;
		}
		for (int i = 0 ; i < N ; ++ i) ev[i].clear();
      	rbsz = 0;
		for (int i = 1 ; i <= n ; ++ i) {
			p[i] = i, sz[i] = 1;
		}
		for (int i = 1 ; i <= m ; ++ i) if (!used[i]) {
			ev[ec[i]].emplace_back(-ea[i], eb[i]);
		}
		ed.clear();
		for (int i = l ; i <= r ; ++ i) {
			if (qt[i] == 2) {
				ev[qy[i]].emplace_back(qx[i], i);
			} else {
				ed.emplace_back(qx[i]);
			}
		}
		for (int tt = 0 ; tt < N ; ++ tt) {
		for (auto [a, b] : ev[tt]) {
			if (a < 0) {
				a = -a;
				unite(a, b);
			} else {
				int i = b;
				int oo = rbsz;
				for (int j : ed) curc[j] = ec[j];
				for (int j = l ; j < i ; ++ j) if (qt[j] == 1) curc[qx[j]] = qy[j];
				for (int j : ed) if (curc[j] <= qy[i]) unite(ea[j], eb[j]);
				ans[i] = sz[get(a)];
				rollback(oo);
			}
		}}
		for (int i = l ; i <= r ; ++ i) {
			if (qt[i] == 1) {
				ec[qx[i]] = qy[i];
			}
		}
	}
	for (int i = 0 ; i < q ; ++ i) {
		if (qt[i] == 2) cout << ans[i] << "\n";
	}
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5076 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 53 ms 5636 KB Output is correct
4 Correct 24 ms 5664 KB Output is correct
5 Correct 47 ms 5460 KB Output is correct
6 Correct 39 ms 5464 KB Output is correct
7 Correct 38 ms 5408 KB Output is correct
8 Correct 47 ms 5548 KB Output is correct
9 Correct 40 ms 5408 KB Output is correct
10 Correct 46 ms 5460 KB Output is correct
11 Correct 49 ms 5548 KB Output is correct
12 Correct 52 ms 5460 KB Output is correct
13 Correct 53 ms 5552 KB Output is correct
14 Correct 49 ms 5580 KB Output is correct
15 Correct 54 ms 5572 KB Output is correct
16 Correct 40 ms 5296 KB Output is correct
17 Correct 53 ms 5376 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1734 ms 14520 KB Output is correct
2 Correct 1688 ms 14740 KB Output is correct
3 Correct 1739 ms 14516 KB Output is correct
4 Correct 1742 ms 14616 KB Output is correct
5 Correct 1744 ms 14492 KB Output is correct
6 Correct 1899 ms 14256 KB Output is correct
7 Correct 1904 ms 14268 KB Output is correct
8 Correct 2029 ms 14488 KB Output is correct
9 Correct 207 ms 11316 KB Output is correct
10 Correct 844 ms 10672 KB Output is correct
11 Correct 852 ms 10760 KB Output is correct
12 Correct 1163 ms 14396 KB Output is correct
13 Correct 1482 ms 14412 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1255 ms 13368 KB Output is correct
2 Correct 706 ms 10912 KB Output is correct
3 Correct 1126 ms 12760 KB Output is correct
4 Correct 1056 ms 13548 KB Output is correct
5 Correct 184 ms 11344 KB Output is correct
6 Correct 1127 ms 13500 KB Output is correct
7 Correct 988 ms 13444 KB Output is correct
8 Correct 965 ms 13496 KB Output is correct
9 Correct 739 ms 13748 KB Output is correct
10 Correct 724 ms 13580 KB Output is correct
11 Correct 811 ms 13260 KB Output is correct
12 Correct 752 ms 13272 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1782 ms 17196 KB Output is correct
2 Correct 194 ms 11336 KB Output is correct
3 Correct 169 ms 11612 KB Output is correct
4 Correct 94 ms 9376 KB Output is correct
5 Correct 728 ms 12360 KB Output is correct
6 Correct 2089 ms 17144 KB Output is correct
7 Correct 752 ms 12648 KB Output is correct
8 Correct 978 ms 14780 KB Output is correct
9 Correct 915 ms 14752 KB Output is correct
10 Correct 706 ms 15048 KB Output is correct
11 Correct 1344 ms 16048 KB Output is correct
12 Correct 1306 ms 16028 KB Output is correct
13 Correct 1020 ms 16332 KB Output is correct
14 Correct 641 ms 12900 KB Output is correct
15 Correct 660 ms 12980 KB Output is correct
16 Correct 1759 ms 17484 KB Output is correct
17 Correct 1773 ms 17628 KB Output is correct
18 Correct 1849 ms 17468 KB Output is correct
19 Correct 1777 ms 17688 KB Output is correct
20 Correct 1150 ms 16768 KB Output is correct
21 Correct 1121 ms 16408 KB Output is correct
22 Correct 1469 ms 16728 KB Output is correct
23 Correct 605 ms 11204 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1734 ms 14520 KB Output is correct
2 Correct 1688 ms 14740 KB Output is correct
3 Correct 1739 ms 14516 KB Output is correct
4 Correct 1742 ms 14616 KB Output is correct
5 Correct 1744 ms 14492 KB Output is correct
6 Correct 1899 ms 14256 KB Output is correct
7 Correct 1904 ms 14268 KB Output is correct
8 Correct 2029 ms 14488 KB Output is correct
9 Correct 207 ms 11316 KB Output is correct
10 Correct 844 ms 10672 KB Output is correct
11 Correct 852 ms 10760 KB Output is correct
12 Correct 1163 ms 14396 KB Output is correct
13 Correct 1482 ms 14412 KB Output is correct
14 Correct 1255 ms 13368 KB Output is correct
15 Correct 706 ms 10912 KB Output is correct
16 Correct 1126 ms 12760 KB Output is correct
17 Correct 1056 ms 13548 KB Output is correct
18 Correct 184 ms 11344 KB Output is correct
19 Correct 1127 ms 13500 KB Output is correct
20 Correct 988 ms 13444 KB Output is correct
21 Correct 965 ms 13496 KB Output is correct
22 Correct 739 ms 13748 KB Output is correct
23 Correct 724 ms 13580 KB Output is correct
24 Correct 811 ms 13260 KB Output is correct
25 Correct 752 ms 13272 KB Output is correct
26 Correct 1441 ms 14112 KB Output is correct
27 Correct 1565 ms 13340 KB Output is correct
28 Correct 1477 ms 14040 KB Output is correct
29 Correct 1201 ms 14024 KB Output is correct
30 Correct 1543 ms 13688 KB Output is correct
31 Correct 1565 ms 13676 KB Output is correct
32 Correct 1600 ms 13612 KB Output is correct
33 Correct 1431 ms 14196 KB Output is correct
34 Correct 1461 ms 14180 KB Output is correct
35 Correct 1434 ms 14092 KB Output is correct
36 Correct 1225 ms 14200 KB Output is correct
37 Correct 1240 ms 13964 KB Output is correct
38 Correct 1232 ms 14088 KB Output is correct
39 Correct 1008 ms 14236 KB Output is correct
40 Correct 971 ms 14148 KB Output is correct
41 Correct 993 ms 14156 KB Output is correct
42 Correct 1096 ms 14036 KB Output is correct
43 Correct 1105 ms 14012 KB Output is correct
44 Correct 1100 ms 13828 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5076 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 53 ms 5636 KB Output is correct
4 Correct 24 ms 5664 KB Output is correct
5 Correct 47 ms 5460 KB Output is correct
6 Correct 39 ms 5464 KB Output is correct
7 Correct 38 ms 5408 KB Output is correct
8 Correct 47 ms 5548 KB Output is correct
9 Correct 40 ms 5408 KB Output is correct
10 Correct 46 ms 5460 KB Output is correct
11 Correct 49 ms 5548 KB Output is correct
12 Correct 52 ms 5460 KB Output is correct
13 Correct 53 ms 5552 KB Output is correct
14 Correct 49 ms 5580 KB Output is correct
15 Correct 54 ms 5572 KB Output is correct
16 Correct 40 ms 5296 KB Output is correct
17 Correct 53 ms 5376 KB Output is correct
18 Correct 1734 ms 14520 KB Output is correct
19 Correct 1688 ms 14740 KB Output is correct
20 Correct 1739 ms 14516 KB Output is correct
21 Correct 1742 ms 14616 KB Output is correct
22 Correct 1744 ms 14492 KB Output is correct
23 Correct 1899 ms 14256 KB Output is correct
24 Correct 1904 ms 14268 KB Output is correct
25 Correct 2029 ms 14488 KB Output is correct
26 Correct 207 ms 11316 KB Output is correct
27 Correct 844 ms 10672 KB Output is correct
28 Correct 852 ms 10760 KB Output is correct
29 Correct 1163 ms 14396 KB Output is correct
30 Correct 1482 ms 14412 KB Output is correct
31 Correct 1255 ms 13368 KB Output is correct
32 Correct 706 ms 10912 KB Output is correct
33 Correct 1126 ms 12760 KB Output is correct
34 Correct 1056 ms 13548 KB Output is correct
35 Correct 184 ms 11344 KB Output is correct
36 Correct 1127 ms 13500 KB Output is correct
37 Correct 988 ms 13444 KB Output is correct
38 Correct 965 ms 13496 KB Output is correct
39 Correct 739 ms 13748 KB Output is correct
40 Correct 724 ms 13580 KB Output is correct
41 Correct 811 ms 13260 KB Output is correct
42 Correct 752 ms 13272 KB Output is correct
43 Correct 1782 ms 17196 KB Output is correct
44 Correct 194 ms 11336 KB Output is correct
45 Correct 169 ms 11612 KB Output is correct
46 Correct 94 ms 9376 KB Output is correct
47 Correct 728 ms 12360 KB Output is correct
48 Correct 2089 ms 17144 KB Output is correct
49 Correct 752 ms 12648 KB Output is correct
50 Correct 978 ms 14780 KB Output is correct
51 Correct 915 ms 14752 KB Output is correct
52 Correct 706 ms 15048 KB Output is correct
53 Correct 1344 ms 16048 KB Output is correct
54 Correct 1306 ms 16028 KB Output is correct
55 Correct 1020 ms 16332 KB Output is correct
56 Correct 641 ms 12900 KB Output is correct
57 Correct 660 ms 12980 KB Output is correct
58 Correct 1759 ms 17484 KB Output is correct
59 Correct 1773 ms 17628 KB Output is correct
60 Correct 1849 ms 17468 KB Output is correct
61 Correct 1777 ms 17688 KB Output is correct
62 Correct 1150 ms 16768 KB Output is correct
63 Correct 1121 ms 16408 KB Output is correct
64 Correct 1469 ms 16728 KB Output is correct
65 Correct 605 ms 11204 KB Output is correct
66 Correct 1441 ms 14112 KB Output is correct
67 Correct 1565 ms 13340 KB Output is correct
68 Correct 1477 ms 14040 KB Output is correct
69 Correct 1201 ms 14024 KB Output is correct
70 Correct 1543 ms 13688 KB Output is correct
71 Correct 1565 ms 13676 KB Output is correct
72 Correct 1600 ms 13612 KB Output is correct
73 Correct 1431 ms 14196 KB Output is correct
74 Correct 1461 ms 14180 KB Output is correct
75 Correct 1434 ms 14092 KB Output is correct
76 Correct 1225 ms 14200 KB Output is correct
77 Correct 1240 ms 13964 KB Output is correct
78 Correct 1232 ms 14088 KB Output is correct
79 Correct 1008 ms 14236 KB Output is correct
80 Correct 971 ms 14148 KB Output is correct
81 Correct 993 ms 14156 KB Output is correct
82 Correct 1096 ms 14036 KB Output is correct
83 Correct 1105 ms 14012 KB Output is correct
84 Correct 1100 ms 13828 KB Output is correct
85 Correct 2315 ms 16924 KB Output is correct
86 Correct 176 ms 11460 KB Output is correct
87 Correct 105 ms 9040 KB Output is correct
88 Correct 932 ms 12148 KB Output is correct
89 Correct 2294 ms 17124 KB Output is correct
90 Correct 927 ms 11844 KB Output is correct
91 Correct 1504 ms 14112 KB Output is correct
92 Correct 1461 ms 14060 KB Output is correct
93 Correct 1751 ms 14624 KB Output is correct
94 Correct 1887 ms 15792 KB Output is correct
95 Correct 1846 ms 15868 KB Output is correct
96 Correct 1729 ms 15784 KB Output is correct
97 Correct 776 ms 12432 KB Output is correct
98 Correct 763 ms 12208 KB Output is correct
99 Correct 2347 ms 17312 KB Output is correct
100 Correct 2298 ms 16664 KB Output is correct
101 Correct 2312 ms 16676 KB Output is correct
102 Correct 2335 ms 16744 KB Output is correct
103 Correct 1884 ms 15704 KB Output is correct
104 Correct 1852 ms 15660 KB Output is correct
105 Correct 1771 ms 15312 KB Output is correct
106 Correct 1544 ms 14948 KB Output is correct
107 Correct 1297 ms 15744 KB Output is correct
108 Correct 2052 ms 16188 KB Output is correct
109 Correct 940 ms 10692 KB Output is correct