oj.uz

답안 #866110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866110 2023-10-25T12:31:37 Z qthang2k11 다리 (APIO19_bridges) C++17
100 / 100
 1695 ms 14152 KB 
// [+]
#include <bits/stdc++.h>
using namespace std;

const int N = 5e4 + 5, M = 1e5 + 5, Q = M, S = sqrt(Q);

int n, m, q, u[M], v[M], w[M];
int par[N], num[N];
int changed[M];

bool vs[N];

inline int find(int x) {
	if (par[x] != x)
		par[x] = find(par[x]);
	return par[x];
}

void join(int x, int y) {
	x = find(x);
	y = find(y);
	if (x == y) return;
	if (num[x] < num[y])
		swap(x, y);
	num[x] += num[y];
	par[y] = x;
}

int t[Q], x[Q], y[Q], ans[Q];

vector<int> edges[Q / S + 5], adj[N];

int dfs(int x) {
	vs[x] = true;
	int ans = num[x];
	for (int y: adj[x])
		if (!vs[y]) ans += dfs(y);
	return ans;
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	
	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];
	
	vector<array<int, 3>> arr;
	for (int i = 1; i <= m; i++)
		arr.push_back({w[i], i, 0});
	for (int i = 1; i <= q; i++)
		if (t[i] == 1) arr.push_back({y[i], x[i], i});
	sort(arr.rbegin(), arr.rend());
	
	for (int L = 1; L <= q; L += S) {
		int R = min(q, L + S - 1);
		
		fill(num + 1, num + n + 1, 1);
		iota(par + 1, par + n + 1, 1);
		
		vector<int> ask, unchanged, upd;
		for (int i = L; i <= R; i++) {
			if (t[i] == 1) {
				changed[x[i]] = i;
				upd.emplace_back(i);
			} else ask.emplace_back(i);
		}
		for (const auto &elem: arr)
			if (changed[elem[1]] == elem[2] && changed[elem[1]] < L)
				unchanged.emplace_back(elem[1]);
		int ucsz = unchanged.size();
		
		for (int i = L; i <= R; i++) {
			if (t[i] == 1) w[x[i]] = y[i];
			else {
				edges[i - L].clear();
				for (int id: upd)
					if (w[x[id]] >= y[i])
						edges[i - L].emplace_back(x[id]);
			}
		}
		
		sort(ask.begin(), ask.end(), [&] (int a, int b) {
			return y[a] > y[b];
		});
		sort(unchanged.begin(), unchanged.end(), [&] (int a, int b) {
			return w[a] > w[b];
		});
		
		int p = -1;
		for (int id: ask) {
			while (p + 1 < ucsz && w[unchanged[p + 1]] >= y[id]) 
				++p, join(u[unchanged[p]], v[unchanged[p]]);
			for (int eid: edges[id - L]) {
				int x = find(u[eid]), y = find(v[eid]);
				adj[x].emplace_back(y);
				adj[y].emplace_back(x); 
			}
			ans[id] = dfs(find(x[id]));
			
			vs[find(x[id])] = false;
			for (int eid: edges[id - L]) {
				int x = find(u[eid]), y = find(v[eid]);
				adj[x].clear();
				adj[y].clear();
				vs[x] = vs[y] = false; 
			}
		}
	}
	
	for (int i = 1; i <= q; i++)
		if (t[i] == 2) cout << ans[i] << '\n';
	
	return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 17 ms 5212 KB Output is correct
4 Correct 4 ms 4700 KB Output is correct
5 Correct 15 ms 5252 KB Output is correct
6 Correct 16 ms 5300 KB Output is correct
7 Correct 12 ms 5248 KB Output is correct
8 Correct 17 ms 5212 KB Output is correct
9 Correct 14 ms 5200 KB Output is correct
10 Correct 13 ms 5212 KB Output is correct
11 Correct 13 ms 5280 KB Output is correct
12 Correct 14 ms 5252 KB Output is correct
13 Correct 15 ms 5212 KB Output is correct
14 Correct 14 ms 5208 KB Output is correct
15 Correct 18 ms 5212 KB Output is correct
16 Correct 17 ms 5212 KB Output is correct
17 Correct 13 ms 5204 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 991 ms 10964 KB Output is correct
2 Correct 917 ms 11212 KB Output is correct
3 Correct 921 ms 11440 KB Output is correct
4 Correct 925 ms 11076 KB Output is correct
5 Correct 950 ms 11100 KB Output is correct
6 Correct 1002 ms 10180 KB Output is correct
7 Correct 1000 ms 9968 KB Output is correct
8 Correct 997 ms 10084 KB Output is correct
9 Correct 26 ms 6088 KB Output is correct
10 Correct 784 ms 9984 KB Output is correct
11 Correct 761 ms 9928 KB Output is correct
12 Correct 698 ms 9432 KB Output is correct
13 Correct 899 ms 11696 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 628 ms 10076 KB Output is correct
2 Correct 275 ms 7652 KB Output is correct
3 Correct 652 ms 9676 KB Output is correct
4 Correct 634 ms 9680 KB Output is correct
5 Correct 26 ms 6228 KB Output is correct
6 Correct 633 ms 9788 KB Output is correct
7 Correct 587 ms 9544 KB Output is correct
8 Correct 546 ms 9588 KB Output is correct
9 Correct 456 ms 8664 KB Output is correct
10 Correct 416 ms 8648 KB Output is correct
11 Correct 593 ms 10464 KB Output is correct
12 Correct 533 ms 10700 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1271 ms 11364 KB Output is correct
2 Correct 26 ms 6224 KB Output is correct
3 Correct 115 ms 9156 KB Output is correct
4 Correct 83 ms 9156 KB Output is correct
5 Correct 983 ms 9924 KB Output is correct
6 Correct 1263 ms 11364 KB Output is correct
7 Correct 1051 ms 9824 KB Output is correct
8 Correct 695 ms 8644 KB Output is correct
9 Correct 702 ms 8864 KB Output is correct
10 Correct 660 ms 8756 KB Output is correct
11 Correct 1126 ms 10148 KB Output is correct
12 Correct 1102 ms 10432 KB Output is correct
13 Correct 1128 ms 10020 KB Output is correct
14 Correct 967 ms 9920 KB Output is correct
15 Correct 954 ms 10084 KB Output is correct
16 Correct 1393 ms 11280 KB Output is correct
17 Correct 1424 ms 11252 KB Output is correct
18 Correct 1397 ms 11360 KB Output is correct
19 Correct 1380 ms 11360 KB Output is correct
20 Correct 1330 ms 10584 KB Output is correct
21 Correct 1254 ms 10688 KB Output is correct
22 Correct 1334 ms 11260 KB Output is correct
23 Correct 1067 ms 9492 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 991 ms 10964 KB Output is correct
2 Correct 917 ms 11212 KB Output is correct
3 Correct 921 ms 11440 KB Output is correct
4 Correct 925 ms 11076 KB Output is correct
5 Correct 950 ms 11100 KB Output is correct
6 Correct 1002 ms 10180 KB Output is correct
7 Correct 1000 ms 9968 KB Output is correct
8 Correct 997 ms 10084 KB Output is correct
9 Correct 26 ms 6088 KB Output is correct
10 Correct 784 ms 9984 KB Output is correct
11 Correct 761 ms 9928 KB Output is correct
12 Correct 698 ms 9432 KB Output is correct
13 Correct 899 ms 11696 KB Output is correct
14 Correct 628 ms 10076 KB Output is correct
15 Correct 275 ms 7652 KB Output is correct
16 Correct 652 ms 9676 KB Output is correct
17 Correct 634 ms 9680 KB Output is correct
18 Correct 26 ms 6228 KB Output is correct
19 Correct 633 ms 9788 KB Output is correct
20 Correct 587 ms 9544 KB Output is correct
21 Correct 546 ms 9588 KB Output is correct
22 Correct 456 ms 8664 KB Output is correct
23 Correct 416 ms 8648 KB Output is correct
24 Correct 593 ms 10464 KB Output is correct
25 Correct 533 ms 10700 KB Output is correct
26 Correct 869 ms 10988 KB Output is correct
27 Correct 1018 ms 10716 KB Output is correct
28 Correct 994 ms 11356 KB Output is correct
29 Correct 875 ms 11420 KB Output is correct
30 Correct 1016 ms 10852 KB Output is correct
31 Correct 1012 ms 10704 KB Output is correct
32 Correct 982 ms 10888 KB Output is correct
33 Correct 952 ms 11012 KB Output is correct
34 Correct 946 ms 11000 KB Output is correct
35 Correct 998 ms 11456 KB Output is correct
36 Correct 872 ms 11340 KB Output is correct
37 Correct 879 ms 11276 KB Output is correct
38 Correct 891 ms 11008 KB Output is correct
39 Correct 704 ms 9672 KB Output is correct
40 Correct 698 ms 9496 KB Output is correct
41 Correct 704 ms 9664 KB Output is correct
42 Correct 819 ms 11648 KB Output is correct
43 Correct 827 ms 11900 KB Output is correct
44 Correct 813 ms 12152 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 17 ms 5212 KB Output is correct
4 Correct 4 ms 4700 KB Output is correct
5 Correct 15 ms 5252 KB Output is correct
6 Correct 16 ms 5300 KB Output is correct
7 Correct 12 ms 5248 KB Output is correct
8 Correct 17 ms 5212 KB Output is correct
9 Correct 14 ms 5200 KB Output is correct
10 Correct 13 ms 5212 KB Output is correct
11 Correct 13 ms 5280 KB Output is correct
12 Correct 14 ms 5252 KB Output is correct
13 Correct 15 ms 5212 KB Output is correct
14 Correct 14 ms 5208 KB Output is correct
15 Correct 18 ms 5212 KB Output is correct
16 Correct 17 ms 5212 KB Output is correct
17 Correct 13 ms 5204 KB Output is correct
18 Correct 991 ms 10964 KB Output is correct
19 Correct 917 ms 11212 KB Output is correct
20 Correct 921 ms 11440 KB Output is correct
21 Correct 925 ms 11076 KB Output is correct
22 Correct 950 ms 11100 KB Output is correct
23 Correct 1002 ms 10180 KB Output is correct
24 Correct 1000 ms 9968 KB Output is correct
25 Correct 997 ms 10084 KB Output is correct
26 Correct 26 ms 6088 KB Output is correct
27 Correct 784 ms 9984 KB Output is correct
28 Correct 761 ms 9928 KB Output is correct
29 Correct 698 ms 9432 KB Output is correct
30 Correct 899 ms 11696 KB Output is correct
31 Correct 628 ms 10076 KB Output is correct
32 Correct 275 ms 7652 KB Output is correct
33 Correct 652 ms 9676 KB Output is correct
34 Correct 634 ms 9680 KB Output is correct
35 Correct 26 ms 6228 KB Output is correct
36 Correct 633 ms 9788 KB Output is correct
37 Correct 587 ms 9544 KB Output is correct
38 Correct 546 ms 9588 KB Output is correct
39 Correct 456 ms 8664 KB Output is correct
40 Correct 416 ms 8648 KB Output is correct
41 Correct 593 ms 10464 KB Output is correct
42 Correct 533 ms 10700 KB Output is correct
43 Correct 1271 ms 11364 KB Output is correct
44 Correct 26 ms 6224 KB Output is correct
45 Correct 115 ms 9156 KB Output is correct
46 Correct 83 ms 9156 KB Output is correct
47 Correct 983 ms 9924 KB Output is correct
48 Correct 1263 ms 11364 KB Output is correct
49 Correct 1051 ms 9824 KB Output is correct
50 Correct 695 ms 8644 KB Output is correct
51 Correct 702 ms 8864 KB Output is correct
52 Correct 660 ms 8756 KB Output is correct
53 Correct 1126 ms 10148 KB Output is correct
54 Correct 1102 ms 10432 KB Output is correct
55 Correct 1128 ms 10020 KB Output is correct
56 Correct 967 ms 9920 KB Output is correct
57 Correct 954 ms 10084 KB Output is correct
58 Correct 1393 ms 11280 KB Output is correct
59 Correct 1424 ms 11252 KB Output is correct
60 Correct 1397 ms 11360 KB Output is correct
61 Correct 1380 ms 11360 KB Output is correct
62 Correct 1330 ms 10584 KB Output is correct
63 Correct 1254 ms 10688 KB Output is correct
64 Correct 1334 ms 11260 KB Output is correct
65 Correct 1067 ms 9492 KB Output is correct
66 Correct 869 ms 10988 KB Output is correct
67 Correct 1018 ms 10716 KB Output is correct
68 Correct 994 ms 11356 KB Output is correct
69 Correct 875 ms 11420 KB Output is correct
70 Correct 1016 ms 10852 KB Output is correct
71 Correct 1012 ms 10704 KB Output is correct
72 Correct 982 ms 10888 KB Output is correct
73 Correct 952 ms 11012 KB Output is correct
74 Correct 946 ms 11000 KB Output is correct
75 Correct 998 ms 11456 KB Output is correct
76 Correct 872 ms 11340 KB Output is correct
77 Correct 879 ms 11276 KB Output is correct
78 Correct 891 ms 11008 KB Output is correct
79 Correct 704 ms 9672 KB Output is correct
80 Correct 698 ms 9496 KB Output is correct
81 Correct 704 ms 9664 KB Output is correct
82 Correct 819 ms 11648 KB Output is correct
83 Correct 827 ms 11900 KB Output is correct
84 Correct 813 ms 12152 KB Output is correct
85 Correct 1572 ms 14028 KB Output is correct
86 Correct 120 ms 9640 KB Output is correct
87 Correct 104 ms 9676 KB Output is correct
88 Correct 1258 ms 12636 KB Output is correct
89 Correct 1534 ms 13760 KB Output is correct
90 Correct 1268 ms 11340 KB Output is correct
91 Correct 992 ms 10952 KB Output is correct
92 Correct 940 ms 10952 KB Output is correct
93 Correct 998 ms 10248 KB Output is correct
94 Correct 1423 ms 12248 KB Output is correct
95 Correct 1358 ms 12400 KB Output is correct
96 Correct 1437 ms 11464 KB Output is correct
97 Correct 1055 ms 10512 KB Output is correct
98 Correct 1214 ms 12464 KB Output is correct
99 Correct 1664 ms 13292 KB Output is correct
100 Correct 1695 ms 13552 KB Output is correct
101 Correct 1656 ms 13724 KB Output is correct
102 Correct 1674 ms 14152 KB Output is correct
103 Correct 1538 ms 11468 KB Output is correct
104 Correct 1584 ms 12564 KB Output is correct
105 Correct 1584 ms 13008 KB Output is correct
106 Correct 1436 ms 12552 KB Output is correct
107 Correct 1350 ms 10880 KB Output is correct
108 Correct 1673 ms 12220 KB Output is correct
109 Correct 1381 ms 10432 KB Output is correct