oj.uz

Submission #951944

# Submission time Handle Problem Language Result Execution time Memory
951944 2024-03-23T02:16:11 Z MinaRagy06 Bridges (APIO19_bridges) C++17
100 / 100
 1040 ms 127220 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 100'005, B = 700;
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;
array<int, 3> qq[N];
array<int, 3> e[N];
int w[N], ans[N];
vector<int> vals[N];
vector<array<int, 2>> ask[N];
set<int> gud[N];
bool bad[N];
vector<int> vs;
bool vis[N];
vector<int> adj[N];
void dfs(int i, int &cnt) {
	cnt += sz[i];
	in.push_back(i);
	vis[i] = 1;
	for (auto nxt : adj[i]) {
		if (!vis[nxt]) {
			dfs(nxt, cnt);
		}
	}
}
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, 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, eidx] : ask[i]) {
				for (auto idx : vals[eidx]) {
					if (find(e[idx][1]) != find(e[idx][2])) {
						adj[find(e[idx][1])].push_back(find(e[idx][2]));
						adj[find(e[idx][2])].push_back(find(e[idx][1]));
					}
				}
				int cnt = 0;
				dfs(find(x), cnt);
				ans[eidx] = cnt;
				for (auto j : in) {
					vis[j] = 0;
				}
				in.clear();
				for (auto idx : vals[eidx]) {
					if (find(e[idx][1]) != find(e[idx][2])) {
						adj[find(e[idx][1])].pop_back();
						adj[find(e[idx][2])].pop_back();
					}
				}
			}
			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 4 ms 16988 KB Output is correct
2 Correct 3 ms 17040 KB Output is correct
3 Correct 21 ms 21332 KB Output is correct
4 Correct 8 ms 17500 KB Output is correct
5 Correct 15 ms 18848 KB Output is correct
6 Correct 13 ms 18780 KB Output is correct
7 Correct 14 ms 18532 KB Output is correct
8 Correct 18 ms 18460 KB Output is correct
9 Correct 17 ms 19548 KB Output is correct
10 Correct 14 ms 18768 KB Output is correct
11 Correct 14 ms 18612 KB Output is correct
12 Correct 18 ms 19036 KB Output is correct
13 Correct 19 ms 19348 KB Output is correct
14 Correct 18 ms 19032 KB Output is correct
15 Correct 18 ms 18788 KB Output is correct
16 Correct 16 ms 19036 KB Output is correct
17 Correct 15 ms 19036 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 731 ms 77304 KB Output is correct
2 Correct 769 ms 76792 KB Output is correct
3 Correct 766 ms 77272 KB Output is correct
4 Correct 759 ms 76908 KB Output is correct
5 Correct 754 ms 76984 KB Output is correct
6 Correct 788 ms 124888 KB Output is correct
7 Correct 751 ms 125652 KB Output is correct
8 Correct 714 ms 125928 KB Output is correct
9 Correct 94 ms 21988 KB Output is correct
10 Correct 705 ms 98260 KB Output is correct
11 Correct 656 ms 82836 KB Output is correct
12 Correct 387 ms 66820 KB Output is correct
13 Correct 369 ms 63900 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 590 ms 75508 KB Output is correct
2 Correct 538 ms 96588 KB Output is correct
3 Correct 659 ms 99184 KB Output is correct
4 Correct 595 ms 75024 KB Output is correct
5 Correct 94 ms 22108 KB Output is correct
6 Correct 618 ms 90840 KB Output is correct
7 Correct 531 ms 68364 KB Output is correct
8 Correct 458 ms 55772 KB Output is correct
9 Correct 410 ms 48340 KB Output is correct
10 Correct 416 ms 41056 KB Output is correct
11 Correct 348 ms 45648 KB Output is correct
12 Correct 334 ms 38256 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 765 ms 29496 KB Output is correct
2 Correct 93 ms 22008 KB Output is correct
3 Correct 79 ms 23892 KB Output is correct
4 Correct 49 ms 23744 KB Output is correct
5 Correct 493 ms 24984 KB Output is correct
6 Correct 771 ms 29824 KB Output is correct
7 Correct 456 ms 24784 KB Output is correct
8 Correct 490 ms 25836 KB Output is correct
9 Correct 487 ms 25672 KB Output is correct
10 Correct 332 ms 25624 KB Output is correct
11 Correct 698 ms 27452 KB Output is correct
12 Correct 695 ms 27648 KB Output is correct
13 Correct 499 ms 27604 KB Output is correct
14 Correct 408 ms 24928 KB Output is correct
15 Correct 442 ms 25228 KB Output is correct
16 Correct 888 ms 29316 KB Output is correct
17 Correct 909 ms 29232 KB Output is correct
18 Correct 890 ms 29536 KB Output is correct
19 Correct 892 ms 29344 KB Output is correct
20 Correct 510 ms 28140 KB Output is correct
21 Correct 490 ms 27856 KB Output is correct
22 Correct 689 ms 29140 KB Output is correct
23 Correct 379 ms 23788 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 731 ms 77304 KB Output is correct
2 Correct 769 ms 76792 KB Output is correct
3 Correct 766 ms 77272 KB Output is correct
4 Correct 759 ms 76908 KB Output is correct
5 Correct 754 ms 76984 KB Output is correct
6 Correct 788 ms 124888 KB Output is correct
7 Correct 751 ms 125652 KB Output is correct
8 Correct 714 ms 125928 KB Output is correct
9 Correct 94 ms 21988 KB Output is correct
10 Correct 705 ms 98260 KB Output is correct
11 Correct 656 ms 82836 KB Output is correct
12 Correct 387 ms 66820 KB Output is correct
13 Correct 369 ms 63900 KB Output is correct
14 Correct 590 ms 75508 KB Output is correct
15 Correct 538 ms 96588 KB Output is correct
16 Correct 659 ms 99184 KB Output is correct
17 Correct 595 ms 75024 KB Output is correct
18 Correct 94 ms 22108 KB Output is correct
19 Correct 618 ms 90840 KB Output is correct
20 Correct 531 ms 68364 KB Output is correct
21 Correct 458 ms 55772 KB Output is correct
22 Correct 410 ms 48340 KB Output is correct
23 Correct 416 ms 41056 KB Output is correct
24 Correct 348 ms 45648 KB Output is correct
25 Correct 334 ms 38256 KB Output is correct
26 Correct 689 ms 76500 KB Output is correct
27 Correct 877 ms 101176 KB Output is correct
28 Correct 764 ms 75968 KB Output is correct
29 Correct 564 ms 42324 KB Output is correct
30 Correct 932 ms 89692 KB Output is correct
31 Correct 895 ms 92100 KB Output is correct
32 Correct 891 ms 92536 KB Output is correct
33 Correct 755 ms 75024 KB Output is correct
34 Correct 791 ms 75480 KB Output is correct
35 Correct 776 ms 75480 KB Output is correct
36 Correct 603 ms 47484 KB Output is correct
37 Correct 603 ms 46276 KB Output is correct
38 Correct 594 ms 45460 KB Output is correct
39 Correct 537 ms 34764 KB Output is correct
40 Correct 529 ms 34104 KB Output is correct
41 Correct 548 ms 33816 KB Output is correct
42 Correct 452 ms 31568 KB Output is correct
43 Correct 446 ms 31144 KB Output is correct
44 Correct 477 ms 31056 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 3 ms 17040 KB Output is correct
3 Correct 21 ms 21332 KB Output is correct
4 Correct 8 ms 17500 KB Output is correct
5 Correct 15 ms 18848 KB Output is correct
6 Correct 13 ms 18780 KB Output is correct
7 Correct 14 ms 18532 KB Output is correct
8 Correct 18 ms 18460 KB Output is correct
9 Correct 17 ms 19548 KB Output is correct
10 Correct 14 ms 18768 KB Output is correct
11 Correct 14 ms 18612 KB Output is correct
12 Correct 18 ms 19036 KB Output is correct
13 Correct 19 ms 19348 KB Output is correct
14 Correct 18 ms 19032 KB Output is correct
15 Correct 18 ms 18788 KB Output is correct
16 Correct 16 ms 19036 KB Output is correct
17 Correct 15 ms 19036 KB Output is correct
18 Correct 731 ms 77304 KB Output is correct
19 Correct 769 ms 76792 KB Output is correct
20 Correct 766 ms 77272 KB Output is correct
21 Correct 759 ms 76908 KB Output is correct
22 Correct 754 ms 76984 KB Output is correct
23 Correct 788 ms 124888 KB Output is correct
24 Correct 751 ms 125652 KB Output is correct
25 Correct 714 ms 125928 KB Output is correct
26 Correct 94 ms 21988 KB Output is correct
27 Correct 705 ms 98260 KB Output is correct
28 Correct 656 ms 82836 KB Output is correct
29 Correct 387 ms 66820 KB Output is correct
30 Correct 369 ms 63900 KB Output is correct
31 Correct 590 ms 75508 KB Output is correct
32 Correct 538 ms 96588 KB Output is correct
33 Correct 659 ms 99184 KB Output is correct
34 Correct 595 ms 75024 KB Output is correct
35 Correct 94 ms 22108 KB Output is correct
36 Correct 618 ms 90840 KB Output is correct
37 Correct 531 ms 68364 KB Output is correct
38 Correct 458 ms 55772 KB Output is correct
39 Correct 410 ms 48340 KB Output is correct
40 Correct 416 ms 41056 KB Output is correct
41 Correct 348 ms 45648 KB Output is correct
42 Correct 334 ms 38256 KB Output is correct
43 Correct 765 ms 29496 KB Output is correct
44 Correct 93 ms 22008 KB Output is correct
45 Correct 79 ms 23892 KB Output is correct
46 Correct 49 ms 23744 KB Output is correct
47 Correct 493 ms 24984 KB Output is correct
48 Correct 771 ms 29824 KB Output is correct
49 Correct 456 ms 24784 KB Output is correct
50 Correct 490 ms 25836 KB Output is correct
51 Correct 487 ms 25672 KB Output is correct
52 Correct 332 ms 25624 KB Output is correct
53 Correct 698 ms 27452 KB Output is correct
54 Correct 695 ms 27648 KB Output is correct
55 Correct 499 ms 27604 KB Output is correct
56 Correct 408 ms 24928 KB Output is correct
57 Correct 442 ms 25228 KB Output is correct
58 Correct 888 ms 29316 KB Output is correct
59 Correct 909 ms 29232 KB Output is correct
60 Correct 890 ms 29536 KB Output is correct
61 Correct 892 ms 29344 KB Output is correct
62 Correct 510 ms 28140 KB Output is correct
63 Correct 490 ms 27856 KB Output is correct
64 Correct 689 ms 29140 KB Output is correct
65 Correct 379 ms 23788 KB Output is correct
66 Correct 689 ms 76500 KB Output is correct
67 Correct 877 ms 101176 KB Output is correct
68 Correct 764 ms 75968 KB Output is correct
69 Correct 564 ms 42324 KB Output is correct
70 Correct 932 ms 89692 KB Output is correct
71 Correct 895 ms 92100 KB Output is correct
72 Correct 891 ms 92536 KB Output is correct
73 Correct 755 ms 75024 KB Output is correct
74 Correct 791 ms 75480 KB Output is correct
75 Correct 776 ms 75480 KB Output is correct
76 Correct 603 ms 47484 KB Output is correct
77 Correct 603 ms 46276 KB Output is correct
78 Correct 594 ms 45460 KB Output is correct
79 Correct 537 ms 34764 KB Output is correct
80 Correct 529 ms 34104 KB Output is correct
81 Correct 548 ms 33816 KB Output is correct
82 Correct 452 ms 31568 KB Output is correct
83 Correct 446 ms 31144 KB Output is correct
84 Correct 477 ms 31056 KB Output is correct
85 Correct 983 ms 80144 KB Output is correct
86 Correct 95 ms 28832 KB Output is correct
87 Correct 67 ms 33616 KB Output is correct
88 Correct 735 ms 88788 KB Output is correct
89 Correct 1010 ms 79156 KB Output is correct
90 Correct 719 ms 90068 KB Output is correct
91 Correct 796 ms 76828 KB Output is correct
92 Correct 788 ms 77176 KB Output is correct
93 Correct 850 ms 125660 KB Output is correct
94 Correct 922 ms 78556 KB Output is correct
95 Correct 898 ms 78444 KB Output is correct
96 Correct 708 ms 126240 KB Output is correct
97 Correct 572 ms 49348 KB Output is correct
98 Correct 608 ms 47496 KB Output is correct
99 Correct 1004 ms 81148 KB Output is correct
100 Correct 1032 ms 80344 KB Output is correct
101 Correct 1040 ms 80180 KB Output is correct
102 Correct 1038 ms 80060 KB Output is correct
103 Correct 684 ms 127220 KB Output is correct
104 Correct 706 ms 127220 KB Output is correct
105 Correct 537 ms 64840 KB Output is correct
106 Correct 461 ms 44372 KB Output is correct
107 Correct 590 ms 67536 KB Output is correct
108 Correct 845 ms 118308 KB Output is correct
109 Correct 632 ms 124168 KB Output is correct