oj.uz

Submission #951202

# Submission time Handle Problem Language Result Execution time Memory
951202 2024-03-21T11:04:46 Z MinaRagy06 Bridges (APIO19_bridges) C++17
100 / 100
 1388 ms 81404 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
 
const int N = 100'005, B = 500;
int par[N], sz[N], par2[N], sz2[N];
int find(int u) {
	if (u == par[u]) {
		return u;
	}
	return par[u] = find(par[u]);
}
void join(int u, int v) {
	u = find(u), v = find(v);
	if (u == v) return;
	if (sz[u] < sz[v]) swap(u, v);
	par[v] = u;
	sz[u] += sz[v];
}
vector<int> in;
void add(int u) {
	in.push_back(u);
	par2[u] = par[u];
	sz2[u] = sz[u];
}
int find2(int u) {
	if (par2[u] == -1) {
		add(u);
	}
	if (par2[u] == u) {
		return u;
	}
	return par2[u] = find2(par2[u]);
}
void join2(int u, int v) {
	u = find2(u), v = find2(v);
	if (u == v) return;
	if (sz2[u] < sz2[v]) swap(u, v);
	par2[v] = u;
	sz2[u] += sz2[v];
}
array<int, 3> qq[N];
array<int, 3> e[N];
int w[N], ans[N];
vector<int> vals[N];
vector<array<int, 3>> ask[N];
set<int> gud[N];
bool bad[N];
vector<int> vs;
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		cin >> e[i][1] >> e[i][2] >> e[i][0];
	}
	bad[m] = 1;
	int q;
	cin >> q;
	for (int k = 0; k < q; k++) {
		cin >> qq[k][0] >> qq[k][1] >> qq[k][2];
		if (qq[k][0] == 1) {
			qq[k][1]--;
		} else {
			vs.push_back(qq[k][2]);
		}
	}
	vs.push_back(0);
	vs.push_back(1e9 + 1);
	sort(vs.begin(), vs.end());
	vs.resize(unique(vs.begin(), vs.end()) - vs.begin());
	for (int i = 0; i < m; i++) {
		e[i][0] = lower_bound(vs.begin(), vs.end(), e[i][0] + 1) - vs.begin() - 1;
		w[i] = e[i][0];
		gud[e[i][0]].insert(i);
	}
	for (int k = 0; k < q; k++) {
		if (qq[k][0] == 1) {
			qq[k][2] = lower_bound(vs.begin(), vs.end(), qq[k][2] + 1) - vs.begin() - 1;
		} else {
			qq[k][2] = lower_bound(vs.begin(), vs.end(), qq[k][2]) - vs.begin();
		}
	}
	memset(ans, -1, sizeof ans);
	vector<int> v;
	int prv = 0;
	auto process = [&] (int L, int R) {
		for (int k = L; k <= R; k++) {
			int t = qq[k][0];
			if (t == 1) {
				int b = qq[k][1], r = qq[k][2];
				w[b] = r;
			} else {
				int x = qq[k][1], mx = qq[k][2];
				ask[mx].push_back({x, mx, k});
				for (auto i : v) {
					if (w[i] >= mx) {
						vals[k].push_back(i);
					}
				}
			}
		}
		for (int i = 1; i <= n; i++) {
			par[i] = i;
			sz[i] = 1;
			par2[i] = sz2[i] = -1;
		}
		for (int i = vs.size() - 1; i >= 0; i--) {
			for (auto idx : gud[i]) {
				if (!bad[idx]) {
					join(e[idx][1], e[idx][2]);
				}
			}
			for (auto [x, y, idx] : ask[i]) {
				for (auto idx : vals[idx]) {
					join2(e[idx][1], e[idx][2]);
				}
				ans[idx] = sz2[find2(x)];
				for (auto j : in) {
					par2[j] = sz2[j] = -1;
				}
				in.clear();
			}
			ask[i].clear();
		}
		for (int k = L; k <= R; k++) {
			vals[k].clear();
			int t = qq[k][0];
			if (t == 1) {
				int b = qq[k][1], r = qq[k][2];
				gud[e[b][0]].erase(b);
				e[b][0] = r;
				gud[e[b][0]].insert(b);
			}
		}
	};
	for (int k = 0; k < q; k++) {
		if (k - prv == B) {
			process(prv, k - 1);
			for (auto i : v) {
				bad[i] = 0;
			}
			v.clear();
			prv = k;
		}
		int t = qq[k][0];
		if (t == 1) {
			int b = qq[k][1];
			if (!bad[b]) {
				bad[b] = 1;
				v.push_back(b);
			}
		} else {
			ans[k] = 1;
		}
	}
	process(prv, q - 1);
	for (auto i : ans) {
		if (i == -1) continue;
		cout << i << '\n';
	}
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 19 ms 16216 KB Output is correct
4 Correct 7 ms 13148 KB Output is correct
5 Correct 13 ms 14340 KB Output is correct
6 Correct 10 ms 14424 KB Output is correct
7 Correct 11 ms 14496 KB Output is correct
8 Correct 13 ms 14168 KB Output is correct
9 Correct 12 ms 15452 KB Output is correct
10 Correct 13 ms 14428 KB Output is correct
11 Correct 13 ms 14428 KB Output is correct
12 Correct 14 ms 14684 KB Output is correct
13 Correct 22 ms 14684 KB Output is correct
14 Correct 15 ms 14684 KB Output is correct
15 Correct 20 ms 14428 KB Output is correct
16 Correct 12 ms 14872 KB Output is correct
17 Correct 12 ms 14684 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 839 ms 51820 KB Output is correct
2 Correct 984 ms 51800 KB Output is correct
3 Correct 916 ms 51872 KB Output is correct
4 Correct 982 ms 51928 KB Output is correct
5 Correct 961 ms 51924 KB Output is correct
6 Correct 537 ms 79720 KB Output is correct
7 Correct 542 ms 81308 KB Output is correct
8 Correct 552 ms 81404 KB Output is correct
9 Correct 106 ms 16592 KB Output is correct
10 Correct 550 ms 65236 KB Output is correct
11 Correct 539 ms 62568 KB Output is correct
12 Correct 364 ms 43328 KB Output is correct
13 Correct 323 ms 36496 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 641 ms 50848 KB Output is correct
2 Correct 393 ms 60448 KB Output is correct
3 Correct 632 ms 64728 KB Output is correct
4 Correct 622 ms 50720 KB Output is correct
5 Correct 106 ms 16596 KB Output is correct
6 Correct 612 ms 60912 KB Output is correct
7 Correct 562 ms 46924 KB Output is correct
8 Correct 511 ms 38804 KB Output is correct
9 Correct 456 ms 36304 KB Output is correct
10 Correct 517 ms 30908 KB Output is correct
11 Correct 377 ms 31572 KB Output is correct
12 Correct 376 ms 26208 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1040 ms 22480 KB Output is correct
2 Correct 114 ms 16528 KB Output is correct
3 Correct 95 ms 17740 KB Output is correct
4 Correct 65 ms 17748 KB Output is correct
5 Correct 615 ms 19412 KB Output is correct
6 Correct 1073 ms 22164 KB Output is correct
7 Correct 584 ms 19152 KB Output is correct
8 Correct 658 ms 19628 KB Output is correct
9 Correct 637 ms 19696 KB Output is correct
10 Correct 434 ms 19920 KB Output is correct
11 Correct 965 ms 21020 KB Output is correct
12 Correct 934 ms 21172 KB Output is correct
13 Correct 646 ms 21200 KB Output is correct
14 Correct 543 ms 19400 KB Output is correct
15 Correct 586 ms 19396 KB Output is correct
16 Correct 1183 ms 22228 KB Output is correct
17 Correct 1150 ms 22224 KB Output is correct
18 Correct 1209 ms 22476 KB Output is correct
19 Correct 1187 ms 22308 KB Output is correct
20 Correct 655 ms 21456 KB Output is correct
21 Correct 657 ms 21448 KB Output is correct
22 Correct 916 ms 22304 KB Output is correct
23 Correct 500 ms 18636 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 839 ms 51820 KB Output is correct
2 Correct 984 ms 51800 KB Output is correct
3 Correct 916 ms 51872 KB Output is correct
4 Correct 982 ms 51928 KB Output is correct
5 Correct 961 ms 51924 KB Output is correct
6 Correct 537 ms 79720 KB Output is correct
7 Correct 542 ms 81308 KB Output is correct
8 Correct 552 ms 81404 KB Output is correct
9 Correct 106 ms 16592 KB Output is correct
10 Correct 550 ms 65236 KB Output is correct
11 Correct 539 ms 62568 KB Output is correct
12 Correct 364 ms 43328 KB Output is correct
13 Correct 323 ms 36496 KB Output is correct
14 Correct 641 ms 50848 KB Output is correct
15 Correct 393 ms 60448 KB Output is correct
16 Correct 632 ms 64728 KB Output is correct
17 Correct 622 ms 50720 KB Output is correct
18 Correct 106 ms 16596 KB Output is correct
19 Correct 612 ms 60912 KB Output is correct
20 Correct 562 ms 46924 KB Output is correct
21 Correct 511 ms 38804 KB Output is correct
22 Correct 456 ms 36304 KB Output is correct
23 Correct 517 ms 30908 KB Output is correct
24 Correct 377 ms 31572 KB Output is correct
25 Correct 376 ms 26208 KB Output is correct
26 Correct 780 ms 51936 KB Output is correct
27 Correct 866 ms 66680 KB Output is correct
28 Correct 869 ms 51056 KB Output is correct
29 Correct 682 ms 29704 KB Output is correct
30 Correct 993 ms 59816 KB Output is correct
31 Correct 1022 ms 61040 KB Output is correct
32 Correct 970 ms 61344 KB Output is correct
33 Correct 899 ms 51048 KB Output is correct
34 Correct 891 ms 51148 KB Output is correct
35 Correct 890 ms 51212 KB Output is correct
36 Correct 717 ms 33064 KB Output is correct
37 Correct 711 ms 32268 KB Output is correct
38 Correct 700 ms 31512 KB Output is correct
39 Correct 668 ms 26340 KB Output is correct
40 Correct 660 ms 25688 KB Output is correct
41 Correct 664 ms 25248 KB Output is correct
42 Correct 558 ms 21996 KB Output is correct
43 Correct 560 ms 21728 KB Output is correct
44 Correct 551 ms 21328 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 19 ms 16216 KB Output is correct
4 Correct 7 ms 13148 KB Output is correct
5 Correct 13 ms 14340 KB Output is correct
6 Correct 10 ms 14424 KB Output is correct
7 Correct 11 ms 14496 KB Output is correct
8 Correct 13 ms 14168 KB Output is correct
9 Correct 12 ms 15452 KB Output is correct
10 Correct 13 ms 14428 KB Output is correct
11 Correct 13 ms 14428 KB Output is correct
12 Correct 14 ms 14684 KB Output is correct
13 Correct 22 ms 14684 KB Output is correct
14 Correct 15 ms 14684 KB Output is correct
15 Correct 20 ms 14428 KB Output is correct
16 Correct 12 ms 14872 KB Output is correct
17 Correct 12 ms 14684 KB Output is correct
18 Correct 839 ms 51820 KB Output is correct
19 Correct 984 ms 51800 KB Output is correct
20 Correct 916 ms 51872 KB Output is correct
21 Correct 982 ms 51928 KB Output is correct
22 Correct 961 ms 51924 KB Output is correct
23 Correct 537 ms 79720 KB Output is correct
24 Correct 542 ms 81308 KB Output is correct
25 Correct 552 ms 81404 KB Output is correct
26 Correct 106 ms 16592 KB Output is correct
27 Correct 550 ms 65236 KB Output is correct
28 Correct 539 ms 62568 KB Output is correct
29 Correct 364 ms 43328 KB Output is correct
30 Correct 323 ms 36496 KB Output is correct
31 Correct 641 ms 50848 KB Output is correct
32 Correct 393 ms 60448 KB Output is correct
33 Correct 632 ms 64728 KB Output is correct
34 Correct 622 ms 50720 KB Output is correct
35 Correct 106 ms 16596 KB Output is correct
36 Correct 612 ms 60912 KB Output is correct
37 Correct 562 ms 46924 KB Output is correct
38 Correct 511 ms 38804 KB Output is correct
39 Correct 456 ms 36304 KB Output is correct
40 Correct 517 ms 30908 KB Output is correct
41 Correct 377 ms 31572 KB Output is correct
42 Correct 376 ms 26208 KB Output is correct
43 Correct 1040 ms 22480 KB Output is correct
44 Correct 114 ms 16528 KB Output is correct
45 Correct 95 ms 17740 KB Output is correct
46 Correct 65 ms 17748 KB Output is correct
47 Correct 615 ms 19412 KB Output is correct
48 Correct 1073 ms 22164 KB Output is correct
49 Correct 584 ms 19152 KB Output is correct
50 Correct 658 ms 19628 KB Output is correct
51 Correct 637 ms 19696 KB Output is correct
52 Correct 434 ms 19920 KB Output is correct
53 Correct 965 ms 21020 KB Output is correct
54 Correct 934 ms 21172 KB Output is correct
55 Correct 646 ms 21200 KB Output is correct
56 Correct 543 ms 19400 KB Output is correct
57 Correct 586 ms 19396 KB Output is correct
58 Correct 1183 ms 22228 KB Output is correct
59 Correct 1150 ms 22224 KB Output is correct
60 Correct 1209 ms 22476 KB Output is correct
61 Correct 1187 ms 22308 KB Output is correct
62 Correct 655 ms 21456 KB Output is correct
63 Correct 657 ms 21448 KB Output is correct
64 Correct 916 ms 22304 KB Output is correct
65 Correct 500 ms 18636 KB Output is correct
66 Correct 780 ms 51936 KB Output is correct
67 Correct 866 ms 66680 KB Output is correct
68 Correct 869 ms 51056 KB Output is correct
69 Correct 682 ms 29704 KB Output is correct
70 Correct 993 ms 59816 KB Output is correct
71 Correct 1022 ms 61040 KB Output is correct
72 Correct 970 ms 61344 KB Output is correct
73 Correct 899 ms 51048 KB Output is correct
74 Correct 891 ms 51148 KB Output is correct
75 Correct 890 ms 51212 KB Output is correct
76 Correct 717 ms 33064 KB Output is correct
77 Correct 711 ms 32268 KB Output is correct
78 Correct 700 ms 31512 KB Output is correct
79 Correct 668 ms 26340 KB Output is correct
80 Correct 660 ms 25688 KB Output is correct
81 Correct 664 ms 25248 KB Output is correct
82 Correct 558 ms 21996 KB Output is correct
83 Correct 560 ms 21728 KB Output is correct
84 Correct 551 ms 21328 KB Output is correct
85 Correct 1280 ms 54504 KB Output is correct
86 Correct 106 ms 21076 KB Output is correct
87 Correct 88 ms 23636 KB Output is correct
88 Correct 911 ms 59976 KB Output is correct
89 Correct 1252 ms 53804 KB Output is correct
90 Correct 897 ms 63056 KB Output is correct
91 Correct 961 ms 52080 KB Output is correct
92 Correct 953 ms 51908 KB Output is correct
93 Correct 1179 ms 73432 KB Output is correct
94 Correct 1315 ms 53188 KB Output is correct
95 Correct 1183 ms 52956 KB Output is correct
96 Correct 1062 ms 74944 KB Output is correct
97 Correct 707 ms 36208 KB Output is correct
98 Correct 762 ms 33684 KB Output is correct
99 Correct 1347 ms 55012 KB Output is correct
100 Correct 1388 ms 54420 KB Output is correct
101 Correct 1370 ms 54312 KB Output is correct
102 Correct 1368 ms 54332 KB Output is correct
103 Correct 1033 ms 78024 KB Output is correct
104 Correct 1034 ms 78740 KB Output is correct
105 Correct 765 ms 38376 KB Output is correct
106 Correct 638 ms 27800 KB Output is correct
107 Correct 825 ms 45716 KB Output is correct
108 Correct 1162 ms 72256 KB Output is correct
109 Correct 857 ms 73044 KB Output is correct