oj.uz

답안 #755411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
755411 2023-06-10T04:19:25 Z HaiHoang 다리 (APIO19_bridges) C++17
100 / 100
 2001 ms 32388 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 35 ms 2712 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 36 ms 2900 KB Output is correct
6 Correct 25 ms 2568 KB Output is correct
7 Correct 31 ms 3412 KB Output is correct
8 Correct 38 ms 2640 KB Output is correct
9 Correct 45 ms 4316 KB Output is correct
10 Correct 41 ms 2768 KB Output is correct
11 Correct 38 ms 2600 KB Output is correct
12 Correct 46 ms 2848 KB Output is correct
13 Correct 43 ms 2892 KB Output is correct
14 Correct 38 ms 2636 KB Output is correct
15 Correct 43 ms 2688 KB Output is correct
16 Correct 40 ms 3916 KB Output is correct
17 Correct 40 ms 3456 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1276 ms 26080 KB Output is correct
2 Correct 1297 ms 26128 KB Output is correct
3 Correct 1244 ms 26280 KB Output is correct
4 Correct 1273 ms 26100 KB Output is correct
5 Correct 1316 ms 26368 KB Output is correct
6 Correct 1914 ms 28052 KB Output is correct
7 Correct 1880 ms 27992 KB Output is correct
8 Correct 1894 ms 27936 KB Output is correct
9 Correct 34 ms 1996 KB Output is correct
10 Correct 1065 ms 27980 KB Output is correct
11 Correct 987 ms 27980 KB Output is correct
12 Correct 1076 ms 24660 KB Output is correct
13 Correct 1135 ms 27396 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1035 ms 18876 KB Output is correct
2 Correct 791 ms 9664 KB Output is correct
3 Correct 1231 ms 20560 KB Output is correct
4 Correct 965 ms 18940 KB Output is correct
5 Correct 40 ms 2124 KB Output is correct
6 Correct 1200 ms 18824 KB Output is correct
7 Correct 966 ms 18496 KB Output is correct
8 Correct 796 ms 18248 KB Output is correct
9 Correct 678 ms 17184 KB Output is correct
10 Correct 607 ms 16972 KB Output is correct
11 Correct 719 ms 19876 KB Output is correct
12 Correct 628 ms 19740 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1504 ms 24872 KB Output is correct
2 Correct 39 ms 2044 KB Output is correct
3 Correct 176 ms 2652 KB Output is correct
4 Correct 76 ms 2704 KB Output is correct
5 Correct 795 ms 24852 KB Output is correct
6 Correct 1484 ms 24944 KB Output is correct
7 Correct 729 ms 24924 KB Output is correct
8 Correct 687 ms 23848 KB Output is correct
9 Correct 704 ms 23988 KB Output is correct
10 Correct 724 ms 24000 KB Output is correct
11 Correct 1113 ms 24724 KB Output is correct
12 Correct 1101 ms 24740 KB Output is correct
13 Correct 1075 ms 25004 KB Output is correct
14 Correct 676 ms 24904 KB Output is correct
15 Correct 676 ms 25088 KB Output is correct
16 Correct 1409 ms 25228 KB Output is correct
17 Correct 1394 ms 25100 KB Output is correct
18 Correct 1445 ms 25472 KB Output is correct
19 Correct 1415 ms 25288 KB Output is correct
20 Correct 1189 ms 25104 KB Output is correct
21 Correct 1231 ms 25152 KB Output is correct
22 Correct 1421 ms 24904 KB Output is correct
23 Correct 779 ms 22924 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1276 ms 26080 KB Output is correct
2 Correct 1297 ms 26128 KB Output is correct
3 Correct 1244 ms 26280 KB Output is correct
4 Correct 1273 ms 26100 KB Output is correct
5 Correct 1316 ms 26368 KB Output is correct
6 Correct 1914 ms 28052 KB Output is correct
7 Correct 1880 ms 27992 KB Output is correct
8 Correct 1894 ms 27936 KB Output is correct
9 Correct 34 ms 1996 KB Output is correct
10 Correct 1065 ms 27980 KB Output is correct
11 Correct 987 ms 27980 KB Output is correct
12 Correct 1076 ms 24660 KB Output is correct
13 Correct 1135 ms 27396 KB Output is correct
14 Correct 1035 ms 18876 KB Output is correct
15 Correct 791 ms 9664 KB Output is correct
16 Correct 1231 ms 20560 KB Output is correct
17 Correct 965 ms 18940 KB Output is correct
18 Correct 40 ms 2124 KB Output is correct
19 Correct 1200 ms 18824 KB Output is correct
20 Correct 966 ms 18496 KB Output is correct
21 Correct 796 ms 18248 KB Output is correct
22 Correct 678 ms 17184 KB Output is correct
23 Correct 607 ms 16972 KB Output is correct
24 Correct 719 ms 19876 KB Output is correct
25 Correct 628 ms 19740 KB Output is correct
26 Correct 1374 ms 26328 KB Output is correct
27 Correct 1605 ms 27996 KB Output is correct
28 Correct 1358 ms 26224 KB Output is correct
29 Correct 948 ms 25744 KB Output is correct
30 Correct 1544 ms 27916 KB Output is correct
31 Correct 1561 ms 28028 KB Output is correct
32 Correct 1587 ms 27868 KB Output is correct
33 Correct 1293 ms 26144 KB Output is correct
34 Correct 1341 ms 25952 KB Output is correct
35 Correct 1323 ms 26124 KB Output is correct
36 Correct 1002 ms 25768 KB Output is correct
37 Correct 997 ms 25880 KB Output is correct
38 Correct 985 ms 25768 KB Output is correct
39 Correct 800 ms 24388 KB Output is correct
40 Correct 800 ms 24516 KB Output is correct
41 Correct 774 ms 24344 KB Output is correct
42 Correct 820 ms 26276 KB Output is correct
43 Correct 790 ms 26284 KB Output is correct
44 Correct 799 ms 26188 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 35 ms 2712 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 36 ms 2900 KB Output is correct
6 Correct 25 ms 2568 KB Output is correct
7 Correct 31 ms 3412 KB Output is correct
8 Correct 38 ms 2640 KB Output is correct
9 Correct 45 ms 4316 KB Output is correct
10 Correct 41 ms 2768 KB Output is correct
11 Correct 38 ms 2600 KB Output is correct
12 Correct 46 ms 2848 KB Output is correct
13 Correct 43 ms 2892 KB Output is correct
14 Correct 38 ms 2636 KB Output is correct
15 Correct 43 ms 2688 KB Output is correct
16 Correct 40 ms 3916 KB Output is correct
17 Correct 40 ms 3456 KB Output is correct
18 Correct 1276 ms 26080 KB Output is correct
19 Correct 1297 ms 26128 KB Output is correct
20 Correct 1244 ms 26280 KB Output is correct
21 Correct 1273 ms 26100 KB Output is correct
22 Correct 1316 ms 26368 KB Output is correct
23 Correct 1914 ms 28052 KB Output is correct
24 Correct 1880 ms 27992 KB Output is correct
25 Correct 1894 ms 27936 KB Output is correct
26 Correct 34 ms 1996 KB Output is correct
27 Correct 1065 ms 27980 KB Output is correct
28 Correct 987 ms 27980 KB Output is correct
29 Correct 1076 ms 24660 KB Output is correct
30 Correct 1135 ms 27396 KB Output is correct
31 Correct 1035 ms 18876 KB Output is correct
32 Correct 791 ms 9664 KB Output is correct
33 Correct 1231 ms 20560 KB Output is correct
34 Correct 965 ms 18940 KB Output is correct
35 Correct 40 ms 2124 KB Output is correct
36 Correct 1200 ms 18824 KB Output is correct
37 Correct 966 ms 18496 KB Output is correct
38 Correct 796 ms 18248 KB Output is correct
39 Correct 678 ms 17184 KB Output is correct
40 Correct 607 ms 16972 KB Output is correct
41 Correct 719 ms 19876 KB Output is correct
42 Correct 628 ms 19740 KB Output is correct
43 Correct 1504 ms 24872 KB Output is correct
44 Correct 39 ms 2044 KB Output is correct
45 Correct 176 ms 2652 KB Output is correct
46 Correct 76 ms 2704 KB Output is correct
47 Correct 795 ms 24852 KB Output is correct
48 Correct 1484 ms 24944 KB Output is correct
49 Correct 729 ms 24924 KB Output is correct
50 Correct 687 ms 23848 KB Output is correct
51 Correct 704 ms 23988 KB Output is correct
52 Correct 724 ms 24000 KB Output is correct
53 Correct 1113 ms 24724 KB Output is correct
54 Correct 1101 ms 24740 KB Output is correct
55 Correct 1075 ms 25004 KB Output is correct
56 Correct 676 ms 24904 KB Output is correct
57 Correct 676 ms 25088 KB Output is correct
58 Correct 1409 ms 25228 KB Output is correct
59 Correct 1394 ms 25100 KB Output is correct
60 Correct 1445 ms 25472 KB Output is correct
61 Correct 1415 ms 25288 KB Output is correct
62 Correct 1189 ms 25104 KB Output is correct
63 Correct 1231 ms 25152 KB Output is correct
64 Correct 1421 ms 24904 KB Output is correct
65 Correct 779 ms 22924 KB Output is correct
66 Correct 1374 ms 26328 KB Output is correct
67 Correct 1605 ms 27996 KB Output is correct
68 Correct 1358 ms 26224 KB Output is correct
69 Correct 948 ms 25744 KB Output is correct
70 Correct 1544 ms 27916 KB Output is correct
71 Correct 1561 ms 28028 KB Output is correct
72 Correct 1587 ms 27868 KB Output is correct
73 Correct 1293 ms 26144 KB Output is correct
74 Correct 1341 ms 25952 KB Output is correct
75 Correct 1323 ms 26124 KB Output is correct
76 Correct 1002 ms 25768 KB Output is correct
77 Correct 997 ms 25880 KB Output is correct
78 Correct 985 ms 25768 KB Output is correct
79 Correct 800 ms 24388 KB Output is correct
80 Correct 800 ms 24516 KB Output is correct
81 Correct 774 ms 24344 KB Output is correct
82 Correct 820 ms 26276 KB Output is correct
83 Correct 790 ms 26284 KB Output is correct
84 Correct 799 ms 26188 KB Output is correct
85 Correct 1927 ms 30820 KB Output is correct
86 Correct 182 ms 6756 KB Output is correct
87 Correct 110 ms 7916 KB Output is correct
88 Correct 1164 ms 31060 KB Output is correct
89 Correct 1910 ms 30932 KB Output is correct
90 Correct 1154 ms 31236 KB Output is correct
91 Correct 1391 ms 28748 KB Output is correct
92 Correct 1362 ms 28772 KB Output is correct
93 Correct 1992 ms 30244 KB Output is correct
94 Correct 1542 ms 30404 KB Output is correct
95 Correct 1669 ms 30420 KB Output is correct
96 Correct 1931 ms 32040 KB Output is correct
97 Correct 879 ms 27828 KB Output is correct
98 Correct 949 ms 30888 KB Output is correct
99 Correct 1891 ms 31332 KB Output is correct
100 Correct 1899 ms 31108 KB Output is correct
101 Correct 1961 ms 31468 KB Output is correct
102 Correct 1841 ms 31532 KB Output is correct
103 Correct 1998 ms 32388 KB Output is correct
104 Correct 2001 ms 32192 KB Output is correct
105 Correct 1480 ms 31996 KB Output is correct
106 Correct 1194 ms 31644 KB Output is correct
107 Correct 1378 ms 28980 KB Output is correct
108 Correct 1832 ms 31080 KB Output is correct
109 Correct 1349 ms 29000 KB Output is correct