oj.uz

Submission #545500

# Submission time Handle Problem Language Result Execution time Memory
545500 2022-04-04T16:04:31 Z Mazaalai Bridges (APIO19_bridges) C++17
100 / 100
 2013 ms 40732 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define ALL(x) x.begin(),x.end()
using namespace std;
using PII = pair <int, int>;
const int N = 5e4+5;
const int M = 1e5+5;
const int BLOCK = 1000;
int n, m, k, q;
bool changed[M];
int u[M], v[M], w[M];
vector <int> join[BLOCK];
vector <int> updates, curQueries, unchanged;
// queries
int ans[M];
PII queries[M];
bool type[M], QUERY = 1;
// DSU
vector <int> stk;
int par[N], sz[N];
int find(int a) {
	while (par[a] != a) a = par[a];
	return a;
}
void merge(int a, int b) {
	a = find(a);
	b = find(b);
	if (a == b) return;
	if (sz[a] < sz[b]) swap(a, b);
	sz[a] += sz[b];
	par[b] = a;
	stk.pb(b);
}
void rewind(int tar) {
	while(stk.size() > tar) {
		int cur = stk.back(); stk.pop_back();
		sz[par[cur]] -= sz[cur];
		par[cur] = cur;
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	// freopen("0.in", "r", stdin);
	// freopen("0.out", "w", stdout);
	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++) {
		int t; cin >> t >> queries[i].ff >> queries[i].ss;
		type[i] = t-1;
	}
	for (int l = 1; l <= q; l+=BLOCK) {
		int r = min(l+BLOCK-1, q);
		// reset
		updates.clear();
		unchanged.clear();
		curQueries.clear();
		fill(sz+1, sz+1+n, 1);
		iota(par+1, par+1+n, 1);
		fill(changed+1, changed+m+1, 0);
		// solution
		for (int i = l; i <= r; i++) {
			if (type[i] == QUERY) {
				curQueries.pb(i);
			} else { // type[i] == UPDATE
				changed[queries[i].ff] = 1;
				updates.pb(i);
			}
		}
		for (int i = 1; i <= m; i++) 
			if (!changed[i]) unchanged.pb(i);
		
		for (int i = l; i <= r; i++) {
			if (type[i] == QUERY) {
				join[i-l].clear();
				for (auto el : updates)
					if (w[queries[el].ff] >= queries[i].ss) join[i-l].pb(queries[el].ff);
			} else { // type[i] == UPDATE
				w[queries[i].ff] = queries[i].ss;
			}
		}
		sort(ALL(curQueries), [&](int a, int b) { return queries[a].ss > queries[b].ss; });
		sort(ALL(unchanged), [&](int a, int b) { return w[a] > w[b]; });
		int pt = 0;
		for (auto query : curQueries) {
			while(pt < unchanged.size() && w[unchanged[pt]] >= queries[query].ss) {
				int pos = unchanged[pt++];
				merge(u[pos], v[pos]);
			}
			int curSz = stk.size();
			for (auto el : join[query-l]) merge(u[el], v[el]);
			ans[query] = sz[find(queries[query].ff)];
			rewind(curSz);
		}
	}
	for (int i = 1; i <= q; i++) 
		if (type[i] == QUERY) cout << ans[i] << "\n";
}

Compilation message

bridges.cpp: In function 'void rewind(int)':
bridges.cpp:37:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |  while(stk.size() > tar) {
      |        ~~~~~~~~~~~^~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:91:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |    while(pt < unchanged.size() && w[unchanged[pt]] >= queries[query].ss) {
      |          ~~~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 34 ms 2612 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 34 ms 2852 KB Output is correct
6 Correct 25 ms 2552 KB Output is correct
7 Correct 32 ms 3412 KB Output is correct
8 Correct 41 ms 2508 KB Output is correct
9 Correct 46 ms 4180 KB Output is correct
10 Correct 43 ms 2664 KB Output is correct
11 Correct 39 ms 2548 KB Output is correct
12 Correct 51 ms 2812 KB Output is correct
13 Correct 45 ms 2700 KB Output is correct
14 Correct 43 ms 2620 KB Output is correct
15 Correct 46 ms 2548 KB Output is correct
16 Correct 45 ms 3896 KB Output is correct
17 Correct 42 ms 3416 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1346 ms 38484 KB Output is correct
2 Correct 1370 ms 38212 KB Output is correct
3 Correct 1289 ms 38248 KB Output is correct
4 Correct 1356 ms 38320 KB Output is correct
5 Correct 1314 ms 38360 KB Output is correct
6 Correct 1844 ms 39920 KB Output is correct
7 Correct 1879 ms 39732 KB Output is correct
8 Correct 1934 ms 39768 KB Output is correct
9 Correct 31 ms 1748 KB Output is correct
10 Correct 1087 ms 39876 KB Output is correct
11 Correct 1028 ms 39888 KB Output is correct
12 Correct 1108 ms 36216 KB Output is correct
13 Correct 1132 ms 39668 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1028 ms 21332 KB Output is correct
2 Correct 757 ms 10140 KB Output is correct
3 Correct 1203 ms 23060 KB Output is correct
4 Correct 985 ms 21440 KB Output is correct
5 Correct 30 ms 1780 KB Output is correct
6 Correct 1137 ms 21440 KB Output is correct
7 Correct 905 ms 21176 KB Output is correct
8 Correct 803 ms 20932 KB Output is correct
9 Correct 645 ms 19240 KB Output is correct
10 Correct 606 ms 19316 KB Output is correct
11 Correct 717 ms 22956 KB Output is correct
12 Correct 641 ms 22808 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1635 ms 36536 KB Output is correct
2 Correct 42 ms 1780 KB Output is correct
3 Correct 160 ms 2284 KB Output is correct
4 Correct 76 ms 2320 KB Output is correct
5 Correct 938 ms 36544 KB Output is correct
6 Correct 1639 ms 36552 KB Output is correct
7 Correct 840 ms 36748 KB Output is correct
8 Correct 820 ms 35776 KB Output is correct
9 Correct 809 ms 35712 KB Output is correct
10 Correct 836 ms 35704 KB Output is correct
11 Correct 1200 ms 36188 KB Output is correct
12 Correct 1149 ms 36228 KB Output is correct
13 Correct 1148 ms 36120 KB Output is correct
14 Correct 696 ms 36536 KB Output is correct
15 Correct 793 ms 36580 KB Output is correct
16 Correct 1517 ms 36644 KB Output is correct
17 Correct 1598 ms 36496 KB Output is correct
18 Correct 1643 ms 36584 KB Output is correct
19 Correct 1636 ms 36512 KB Output is correct
20 Correct 1372 ms 36276 KB Output is correct
21 Correct 1394 ms 36268 KB Output is correct
22 Correct 1614 ms 36436 KB Output is correct
23 Correct 920 ms 36244 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1346 ms 38484 KB Output is correct
2 Correct 1370 ms 38212 KB Output is correct
3 Correct 1289 ms 38248 KB Output is correct
4 Correct 1356 ms 38320 KB Output is correct
5 Correct 1314 ms 38360 KB Output is correct
6 Correct 1844 ms 39920 KB Output is correct
7 Correct 1879 ms 39732 KB Output is correct
8 Correct 1934 ms 39768 KB Output is correct
9 Correct 31 ms 1748 KB Output is correct
10 Correct 1087 ms 39876 KB Output is correct
11 Correct 1028 ms 39888 KB Output is correct
12 Correct 1108 ms 36216 KB Output is correct
13 Correct 1132 ms 39668 KB Output is correct
14 Correct 1028 ms 21332 KB Output is correct
15 Correct 757 ms 10140 KB Output is correct
16 Correct 1203 ms 23060 KB Output is correct
17 Correct 985 ms 21440 KB Output is correct
18 Correct 30 ms 1780 KB Output is correct
19 Correct 1137 ms 21440 KB Output is correct
20 Correct 905 ms 21176 KB Output is correct
21 Correct 803 ms 20932 KB Output is correct
22 Correct 645 ms 19240 KB Output is correct
23 Correct 606 ms 19316 KB Output is correct
24 Correct 717 ms 22956 KB Output is correct
25 Correct 641 ms 22808 KB Output is correct
26 Correct 1403 ms 38380 KB Output is correct
27 Correct 1711 ms 39916 KB Output is correct
28 Correct 1444 ms 38180 KB Output is correct
29 Correct 1033 ms 37912 KB Output is correct
30 Correct 1657 ms 39916 KB Output is correct
31 Correct 1717 ms 39800 KB Output is correct
32 Correct 1694 ms 39848 KB Output is correct
33 Correct 1473 ms 38196 KB Output is correct
34 Correct 1462 ms 38048 KB Output is correct
35 Correct 1466 ms 38328 KB Output is correct
36 Correct 1126 ms 38080 KB Output is correct
37 Correct 1104 ms 38044 KB Output is correct
38 Correct 1097 ms 37976 KB Output is correct
39 Correct 901 ms 36132 KB Output is correct
40 Correct 898 ms 36400 KB Output is correct
41 Correct 886 ms 36216 KB Output is correct
42 Correct 891 ms 39232 KB Output is correct
43 Correct 864 ms 39248 KB Output is correct
44 Correct 836 ms 39140 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 34 ms 2612 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 34 ms 2852 KB Output is correct
6 Correct 25 ms 2552 KB Output is correct
7 Correct 32 ms 3412 KB Output is correct
8 Correct 41 ms 2508 KB Output is correct
9 Correct 46 ms 4180 KB Output is correct
10 Correct 43 ms 2664 KB Output is correct
11 Correct 39 ms 2548 KB Output is correct
12 Correct 51 ms 2812 KB Output is correct
13 Correct 45 ms 2700 KB Output is correct
14 Correct 43 ms 2620 KB Output is correct
15 Correct 46 ms 2548 KB Output is correct
16 Correct 45 ms 3896 KB Output is correct
17 Correct 42 ms 3416 KB Output is correct
18 Correct 1346 ms 38484 KB Output is correct
19 Correct 1370 ms 38212 KB Output is correct
20 Correct 1289 ms 38248 KB Output is correct
21 Correct 1356 ms 38320 KB Output is correct
22 Correct 1314 ms 38360 KB Output is correct
23 Correct 1844 ms 39920 KB Output is correct
24 Correct 1879 ms 39732 KB Output is correct
25 Correct 1934 ms 39768 KB Output is correct
26 Correct 31 ms 1748 KB Output is correct
27 Correct 1087 ms 39876 KB Output is correct
28 Correct 1028 ms 39888 KB Output is correct
29 Correct 1108 ms 36216 KB Output is correct
30 Correct 1132 ms 39668 KB Output is correct
31 Correct 1028 ms 21332 KB Output is correct
32 Correct 757 ms 10140 KB Output is correct
33 Correct 1203 ms 23060 KB Output is correct
34 Correct 985 ms 21440 KB Output is correct
35 Correct 30 ms 1780 KB Output is correct
36 Correct 1137 ms 21440 KB Output is correct
37 Correct 905 ms 21176 KB Output is correct
38 Correct 803 ms 20932 KB Output is correct
39 Correct 645 ms 19240 KB Output is correct
40 Correct 606 ms 19316 KB Output is correct
41 Correct 717 ms 22956 KB Output is correct
42 Correct 641 ms 22808 KB Output is correct
43 Correct 1635 ms 36536 KB Output is correct
44 Correct 42 ms 1780 KB Output is correct
45 Correct 160 ms 2284 KB Output is correct
46 Correct 76 ms 2320 KB Output is correct
47 Correct 938 ms 36544 KB Output is correct
48 Correct 1639 ms 36552 KB Output is correct
49 Correct 840 ms 36748 KB Output is correct
50 Correct 820 ms 35776 KB Output is correct
51 Correct 809 ms 35712 KB Output is correct
52 Correct 836 ms 35704 KB Output is correct
53 Correct 1200 ms 36188 KB Output is correct
54 Correct 1149 ms 36228 KB Output is correct
55 Correct 1148 ms 36120 KB Output is correct
56 Correct 696 ms 36536 KB Output is correct
57 Correct 793 ms 36580 KB Output is correct
58 Correct 1517 ms 36644 KB Output is correct
59 Correct 1598 ms 36496 KB Output is correct
60 Correct 1643 ms 36584 KB Output is correct
61 Correct 1636 ms 36512 KB Output is correct
62 Correct 1372 ms 36276 KB Output is correct
63 Correct 1394 ms 36268 KB Output is correct
64 Correct 1614 ms 36436 KB Output is correct
65 Correct 920 ms 36244 KB Output is correct
66 Correct 1403 ms 38380 KB Output is correct
67 Correct 1711 ms 39916 KB Output is correct
68 Correct 1444 ms 38180 KB Output is correct
69 Correct 1033 ms 37912 KB Output is correct
70 Correct 1657 ms 39916 KB Output is correct
71 Correct 1717 ms 39800 KB Output is correct
72 Correct 1694 ms 39848 KB Output is correct
73 Correct 1473 ms 38196 KB Output is correct
74 Correct 1462 ms 38048 KB Output is correct
75 Correct 1466 ms 38328 KB Output is correct
76 Correct 1126 ms 38080 KB Output is correct
77 Correct 1104 ms 38044 KB Output is correct
78 Correct 1097 ms 37976 KB Output is correct
79 Correct 901 ms 36132 KB Output is correct
80 Correct 898 ms 36400 KB Output is correct
81 Correct 886 ms 36216 KB Output is correct
82 Correct 891 ms 39232 KB Output is correct
83 Correct 864 ms 39248 KB Output is correct
84 Correct 836 ms 39140 KB Output is correct
85 Correct 1913 ms 38968 KB Output is correct
86 Correct 189 ms 4292 KB Output is correct
87 Correct 114 ms 5456 KB Output is correct
88 Correct 1202 ms 40664 KB Output is correct
89 Correct 1867 ms 39260 KB Output is correct
90 Correct 1144 ms 40728 KB Output is correct
91 Correct 1364 ms 38292 KB Output is correct
92 Correct 1388 ms 38172 KB Output is correct
93 Correct 2013 ms 39456 KB Output is correct
94 Correct 1557 ms 38800 KB Output is correct
95 Correct 1615 ms 38636 KB Output is correct
96 Correct 1794 ms 40296 KB Output is correct
97 Correct 833 ms 37304 KB Output is correct
98 Correct 908 ms 40732 KB Output is correct
99 Correct 1821 ms 39268 KB Output is correct
100 Correct 1825 ms 38836 KB Output is correct
101 Correct 1904 ms 39152 KB Output is correct
102 Correct 1853 ms 39244 KB Output is correct
103 Correct 1970 ms 40432 KB Output is correct
104 Correct 1966 ms 40412 KB Output is correct
105 Correct 1498 ms 40204 KB Output is correct
106 Correct 1219 ms 39972 KB Output is correct
107 Correct 1397 ms 36828 KB Output is correct
108 Correct 1817 ms 39472 KB Output is correct
109 Correct 1311 ms 40480 KB Output is correct