oj.uz

답안 #739139

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
739139 2023-05-10T03:37:12 Z josanneo22 다리 (APIO19_bridges) C++17
100 / 100
 2013 ms 32364 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

const int B = 1000;

int n, m, q;

stack<int> stck;
int sz[100001], cmp[100001];

void reset() {
	iota(cmp + 1, cmp + 1 + n, 1);
	fill(sz + 1, sz + n + 1, 1);
}

inline int find(int a) {
	while (cmp[a] != a) a = cmp[a];
	return a;
}

void onion(int a, int b) {
	a = find(a), b = find(b);
	if (a == b) return;
	if (sz[a] > sz[b]) swap(a, b);
	stck.push(a);
	sz[b] += sz[a];
	cmp[a] = cmp[b];
}

void rollback(int x) {
	while (stck.size() > x) {
		int k = stck.top();
		stck.pop();
		sz[cmp[k]] -= sz[k];
		cmp[k] = k;
	}
}

int u[100001], v[100001], w[100001];
int t[100001], x[100001], y[100001];
bool changed[100001];
vector<int> to_join[B];
int ans[100001];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	FOR(i, 1, m + 1) cin >> u[i] >> v[i] >> w[i];
	cin >> q;
	FOR(i, 1, q + 1) cin >> t[i] >> x[i] >> y[i];

	for (int l = 1; l <= q; l += B) {
		int r = min(q + 1, l + B);
		reset();
		fill(changed + 1, changed + m + 1, false);

		vector<int> ask, upd, unchanged;
		FOR(i, l, r) {
			if (t[i] == 1) {
				changed[x[i]] = true;
				upd.push_back(i);
			} else ask.push_back(i);
		}
		FOR(i, 1, m + 1) if (!changed[i]) unchanged.push_back(i);

		FOR(i, l, r) {
			if (t[i] == 1) w[x[i]] = y[i];
			else {
				to_join[i - l].clear();
				for (int j : upd)
					if (w[x[j]] >= y[i]) to_join[i - l].push_back(x[j]);
			}
		}

		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 ptr = 0;
		for (int i : ask) {
			while (ptr < unchanged.size() && w[unchanged[ptr]] >= y[i]) {
				onion(u[unchanged[ptr]], v[unchanged[ptr]]);
				ptr++;
			}
			int prev_size = stck.size();
			for (int j : to_join[i - l]) onion(u[j], v[j]);
			ans[i] = sz[find(x[i])];
			rollback(prev_size);
		}
	}

	FOR(i, 1, q + 1) if (t[i] == 2) cout << ans[i] << '\n';
	return 0;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:33:21: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |  while (stck.size() > x) {
      |         ~~~~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:84:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |    while (ptr < unchanged.size() && w[unchanged[ptr]] >= y[i]) {
      |           ~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 2804 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 37 ms 2980 KB Output is correct
6 Correct 28 ms 2748 KB Output is correct
7 Correct 34 ms 3600 KB Output is correct
8 Correct 35 ms 2780 KB Output is correct
9 Correct 42 ms 4296 KB Output is correct
10 Correct 37 ms 2924 KB Output is correct
11 Correct 35 ms 2784 KB Output is correct
12 Correct 44 ms 2972 KB Output is correct
13 Correct 44 ms 2920 KB Output is correct
14 Correct 40 ms 2800 KB Output is correct
15 Correct 44 ms 2804 KB Output is correct
16 Correct 38 ms 4036 KB Output is correct
17 Correct 39 ms 3448 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1239 ms 28992 KB Output is correct
2 Correct 1239 ms 28844 KB Output is correct
3 Correct 1215 ms 28968 KB Output is correct
4 Correct 1260 ms 29092 KB Output is correct
5 Correct 1286 ms 29108 KB Output is correct
6 Correct 1906 ms 30396 KB Output is correct
7 Correct 1872 ms 30380 KB Output is correct
8 Correct 1915 ms 30428 KB Output is correct
9 Correct 32 ms 3412 KB Output is correct
10 Correct 1036 ms 29544 KB Output is correct
11 Correct 999 ms 29520 KB Output is correct
12 Correct 1076 ms 27100 KB Output is correct
13 Correct 1081 ms 30112 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1028 ms 21076 KB Output is correct
2 Correct 795 ms 11196 KB Output is correct
3 Correct 1237 ms 22668 KB Output is correct
4 Correct 1010 ms 21188 KB Output is correct
5 Correct 39 ms 3464 KB Output is correct
6 Correct 1141 ms 21040 KB Output is correct
7 Correct 916 ms 20692 KB Output is correct
8 Correct 823 ms 20584 KB Output is correct
9 Correct 640 ms 19312 KB Output is correct
10 Correct 570 ms 19372 KB Output is correct
11 Correct 698 ms 22212 KB Output is correct
12 Correct 607 ms 22236 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1407 ms 28620 KB Output is correct
2 Correct 33 ms 3404 KB Output is correct
3 Correct 157 ms 4684 KB Output is correct
4 Correct 81 ms 4676 KB Output is correct
5 Correct 726 ms 27300 KB Output is correct
6 Correct 1402 ms 28740 KB Output is correct
7 Correct 696 ms 27296 KB Output is correct
8 Correct 678 ms 26716 KB Output is correct
9 Correct 667 ms 26764 KB Output is correct
10 Correct 676 ms 26724 KB Output is correct
11 Correct 1004 ms 28000 KB Output is correct
12 Correct 1016 ms 27996 KB Output is correct
13 Correct 1018 ms 28012 KB Output is correct
14 Correct 622 ms 27324 KB Output is correct
15 Correct 648 ms 27276 KB Output is correct
16 Correct 1431 ms 29048 KB Output is correct
17 Correct 1372 ms 28820 KB Output is correct
18 Correct 1383 ms 29168 KB Output is correct
19 Correct 1387 ms 29080 KB Output is correct
20 Correct 1196 ms 28612 KB Output is correct
21 Correct 1208 ms 28292 KB Output is correct
22 Correct 1428 ms 28376 KB Output is correct
23 Correct 766 ms 24904 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1239 ms 28992 KB Output is correct
2 Correct 1239 ms 28844 KB Output is correct
3 Correct 1215 ms 28968 KB Output is correct
4 Correct 1260 ms 29092 KB Output is correct
5 Correct 1286 ms 29108 KB Output is correct
6 Correct 1906 ms 30396 KB Output is correct
7 Correct 1872 ms 30380 KB Output is correct
8 Correct 1915 ms 30428 KB Output is correct
9 Correct 32 ms 3412 KB Output is correct
10 Correct 1036 ms 29544 KB Output is correct
11 Correct 999 ms 29520 KB Output is correct
12 Correct 1076 ms 27100 KB Output is correct
13 Correct 1081 ms 30112 KB Output is correct
14 Correct 1028 ms 21076 KB Output is correct
15 Correct 795 ms 11196 KB Output is correct
16 Correct 1237 ms 22668 KB Output is correct
17 Correct 1010 ms 21188 KB Output is correct
18 Correct 39 ms 3464 KB Output is correct
19 Correct 1141 ms 21040 KB Output is correct
20 Correct 916 ms 20692 KB Output is correct
21 Correct 823 ms 20584 KB Output is correct
22 Correct 640 ms 19312 KB Output is correct
23 Correct 570 ms 19372 KB Output is correct
24 Correct 698 ms 22212 KB Output is correct
25 Correct 607 ms 22236 KB Output is correct
26 Correct 1300 ms 29116 KB Output is correct
27 Correct 1556 ms 30720 KB Output is correct
28 Correct 1267 ms 28860 KB Output is correct
29 Correct 901 ms 28528 KB Output is correct
30 Correct 1457 ms 30456 KB Output is correct
31 Correct 1512 ms 30600 KB Output is correct
32 Correct 1484 ms 30608 KB Output is correct
33 Correct 1282 ms 28896 KB Output is correct
34 Correct 1264 ms 28776 KB Output is correct
35 Correct 1278 ms 29052 KB Output is correct
36 Correct 942 ms 28520 KB Output is correct
37 Correct 940 ms 28612 KB Output is correct
38 Correct 933 ms 28476 KB Output is correct
39 Correct 758 ms 27092 KB Output is correct
40 Correct 763 ms 27252 KB Output is correct
41 Correct 761 ms 27108 KB Output is correct
42 Correct 741 ms 29236 KB Output is correct
43 Correct 783 ms 29188 KB Output is correct
44 Correct 771 ms 29060 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 2804 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 37 ms 2980 KB Output is correct
6 Correct 28 ms 2748 KB Output is correct
7 Correct 34 ms 3600 KB Output is correct
8 Correct 35 ms 2780 KB Output is correct
9 Correct 42 ms 4296 KB Output is correct
10 Correct 37 ms 2924 KB Output is correct
11 Correct 35 ms 2784 KB Output is correct
12 Correct 44 ms 2972 KB Output is correct
13 Correct 44 ms 2920 KB Output is correct
14 Correct 40 ms 2800 KB Output is correct
15 Correct 44 ms 2804 KB Output is correct
16 Correct 38 ms 4036 KB Output is correct
17 Correct 39 ms 3448 KB Output is correct
18 Correct 1239 ms 28992 KB Output is correct
19 Correct 1239 ms 28844 KB Output is correct
20 Correct 1215 ms 28968 KB Output is correct
21 Correct 1260 ms 29092 KB Output is correct
22 Correct 1286 ms 29108 KB Output is correct
23 Correct 1906 ms 30396 KB Output is correct
24 Correct 1872 ms 30380 KB Output is correct
25 Correct 1915 ms 30428 KB Output is correct
26 Correct 32 ms 3412 KB Output is correct
27 Correct 1036 ms 29544 KB Output is correct
28 Correct 999 ms 29520 KB Output is correct
29 Correct 1076 ms 27100 KB Output is correct
30 Correct 1081 ms 30112 KB Output is correct
31 Correct 1028 ms 21076 KB Output is correct
32 Correct 795 ms 11196 KB Output is correct
33 Correct 1237 ms 22668 KB Output is correct
34 Correct 1010 ms 21188 KB Output is correct
35 Correct 39 ms 3464 KB Output is correct
36 Correct 1141 ms 21040 KB Output is correct
37 Correct 916 ms 20692 KB Output is correct
38 Correct 823 ms 20584 KB Output is correct
39 Correct 640 ms 19312 KB Output is correct
40 Correct 570 ms 19372 KB Output is correct
41 Correct 698 ms 22212 KB Output is correct
42 Correct 607 ms 22236 KB Output is correct
43 Correct 1407 ms 28620 KB Output is correct
44 Correct 33 ms 3404 KB Output is correct
45 Correct 157 ms 4684 KB Output is correct
46 Correct 81 ms 4676 KB Output is correct
47 Correct 726 ms 27300 KB Output is correct
48 Correct 1402 ms 28740 KB Output is correct
49 Correct 696 ms 27296 KB Output is correct
50 Correct 678 ms 26716 KB Output is correct
51 Correct 667 ms 26764 KB Output is correct
52 Correct 676 ms 26724 KB Output is correct
53 Correct 1004 ms 28000 KB Output is correct
54 Correct 1016 ms 27996 KB Output is correct
55 Correct 1018 ms 28012 KB Output is correct
56 Correct 622 ms 27324 KB Output is correct
57 Correct 648 ms 27276 KB Output is correct
58 Correct 1431 ms 29048 KB Output is correct
59 Correct 1372 ms 28820 KB Output is correct
60 Correct 1383 ms 29168 KB Output is correct
61 Correct 1387 ms 29080 KB Output is correct
62 Correct 1196 ms 28612 KB Output is correct
63 Correct 1208 ms 28292 KB Output is correct
64 Correct 1428 ms 28376 KB Output is correct
65 Correct 766 ms 24904 KB Output is correct
66 Correct 1300 ms 29116 KB Output is correct
67 Correct 1556 ms 30720 KB Output is correct
68 Correct 1267 ms 28860 KB Output is correct
69 Correct 901 ms 28528 KB Output is correct
70 Correct 1457 ms 30456 KB Output is correct
71 Correct 1512 ms 30600 KB Output is correct
72 Correct 1484 ms 30608 KB Output is correct
73 Correct 1282 ms 28896 KB Output is correct
74 Correct 1264 ms 28776 KB Output is correct
75 Correct 1278 ms 29052 KB Output is correct
76 Correct 942 ms 28520 KB Output is correct
77 Correct 940 ms 28612 KB Output is correct
78 Correct 933 ms 28476 KB Output is correct
79 Correct 758 ms 27092 KB Output is correct
80 Correct 763 ms 27252 KB Output is correct
81 Correct 761 ms 27108 KB Output is correct
82 Correct 741 ms 29236 KB Output is correct
83 Correct 783 ms 29188 KB Output is correct
84 Correct 771 ms 29060 KB Output is correct
85 Correct 1849 ms 30876 KB Output is correct
86 Correct 171 ms 6628 KB Output is correct
87 Correct 116 ms 7924 KB Output is correct
88 Correct 1075 ms 31224 KB Output is correct
89 Correct 1737 ms 31136 KB Output is correct
90 Correct 1078 ms 31364 KB Output is correct
91 Correct 1327 ms 28900 KB Output is correct
92 Correct 1307 ms 28772 KB Output is correct
93 Correct 1912 ms 30388 KB Output is correct
94 Correct 1526 ms 30520 KB Output is correct
95 Correct 1558 ms 30532 KB Output is correct
96 Correct 1791 ms 32052 KB Output is correct
97 Correct 832 ms 27688 KB Output is correct
98 Correct 869 ms 30912 KB Output is correct
99 Correct 1782 ms 31468 KB Output is correct
100 Correct 1845 ms 30964 KB Output is correct
101 Correct 1873 ms 31444 KB Output is correct
102 Correct 1857 ms 31464 KB Output is correct
103 Correct 2013 ms 32248 KB Output is correct
104 Correct 1996 ms 32364 KB Output is correct
105 Correct 1437 ms 32076 KB Output is correct
106 Correct 1215 ms 31532 KB Output is correct
107 Correct 1364 ms 28896 KB Output is correct
108 Correct 1829 ms 31172 KB Output is correct
109 Correct 1378 ms 29004 KB Output is correct