답안 #778559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778559 2023-07-10T12:19:00 Z Trisanu_Das 다리 (APIO19_bridges) C++17
100 / 100
1977 ms 10676 KB
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ar array
 
const int mxN = 100000;
const int B = 750;
int n, m, q, ans[mxN];
int par[mxN], sz[mxN];
 
ar<int, 3> e[mxN];
ar<int, 3> qry[mxN];
 
vector<int> rb;
 
void reset() {
	rb.clear();
	fill(sz, sz + n, 1);
	iota(par, par + n, 0);
}
 
int find(int i) {
	while(i != par[i]) i = par[i];
	return i;
}
 
void merge(int a, int b) {
	a = find(a), b = find(b);
	if (a == b) return;
	if (sz[a] < sz[b]) swap(a, b);
	rb.push_back(b);
	sz[a] += sz[b];
	par[b] = a;
}
 
void rollback(int k) {
	while(rb.size() > k) {
		int b = rb.back();
		rb.pop_back();
		sz[par[b]] -= sz[b];
		par[b] = b;
	}
}
 
vector<int> to_join[B];
 
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < m; ++i) cin >> e[i][0] >> e[i][1] >> e[i][2], --e[i][0], --e[i][1];
	cin >> q;
	for (int i = 0; i < q; ++i) cin >> qry[i][0] >> qry[i][1] >> qry[i][2], --qry[i][1];
 
	for (int l = 0; l < q; l += B) {
		reset();
		int r = min(q, l + B);
		vector<bool> changed(m);
		for (int i = l; i < r; ++i) if (qry[i][0] == 1) changed[qry[i][1]] = 1;
 
		vector<int> upd, unchanged, ask;
		for (int i = 0; i < m; ++i) {
			if (changed[i]) upd.push_back(i);
			if (!changed[i]) unchanged.push_back(i);
		}
		for (int i = l; i < r; ++i) {
			if (qry[i][0] == 1) e[qry[i][1]][2] = qry[i][2];
			else {
				to_join[i - l].clear();
				for (int ind : upd) if (e[ind][2] >= qry[i][2]) to_join[i - l].push_back(ind);
				ask.push_back(i);
			}
		}
		sort(unchanged.begin(), unchanged.end(), [&](int a, int b) {return e[a][2] < e[b][2];});
		sort(ask.begin(), ask.end(), [&](int a, int b) {return qry[a][2] > qry[b][2];});
		for (int i : ask) {
			while(!unchanged.empty()) {
				int x = unchanged.back();
				if (e[x][2] < qry[i][2]) break;
				merge(e[x][0], e[x][1]);
				unchanged.pop_back();
			}
			int prv_sz = rb.size();
			for (int x : to_join[i - l]) merge(e[x][0], e[x][1]);
			ans[i] = sz[find(qry[i][1])];
			rollback(prv_sz);
		}
	}
	for (int i = 0; i < q; ++i) if (qry[i][0] == 2) cout << ans[i] << "\n";
	return 0;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:38:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |  while(rb.size() > k) {
      |        ~~~~~~~~~~^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 18 ms 2088 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 8 ms 980 KB Output is correct
6 Correct 7 ms 936 KB Output is correct
7 Correct 8 ms 980 KB Output is correct
8 Correct 9 ms 1088 KB Output is correct
9 Correct 8 ms 980 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 8 ms 988 KB Output is correct
12 Correct 10 ms 996 KB Output is correct
13 Correct 11 ms 1252 KB Output is correct
14 Correct 10 ms 1236 KB Output is correct
15 Correct 9 ms 1028 KB Output is correct
16 Correct 7 ms 980 KB Output is correct
17 Correct 7 ms 996 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 978 ms 7996 KB Output is correct
2 Correct 982 ms 8004 KB Output is correct
3 Correct 945 ms 7944 KB Output is correct
4 Correct 979 ms 8024 KB Output is correct
5 Correct 966 ms 8084 KB Output is correct
6 Correct 1110 ms 7564 KB Output is correct
7 Correct 1090 ms 7760 KB Output is correct
8 Correct 1071 ms 7660 KB Output is correct
9 Correct 27 ms 3456 KB Output is correct
10 Correct 533 ms 6768 KB Output is correct
11 Correct 554 ms 6888 KB Output is correct
12 Correct 877 ms 6644 KB Output is correct
13 Correct 865 ms 9344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 681 ms 6888 KB Output is correct
2 Correct 330 ms 5428 KB Output is correct
3 Correct 694 ms 6684 KB Output is correct
4 Correct 686 ms 6984 KB Output is correct
5 Correct 27 ms 3412 KB Output is correct
6 Correct 688 ms 7000 KB Output is correct
7 Correct 638 ms 6892 KB Output is correct
8 Correct 600 ms 6904 KB Output is correct
9 Correct 542 ms 5776 KB Output is correct
10 Correct 542 ms 5836 KB Output is correct
11 Correct 555 ms 8408 KB Output is correct
12 Correct 524 ms 8284 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1690 ms 8844 KB Output is correct
2 Correct 26 ms 3404 KB Output is correct
3 Correct 196 ms 4452 KB Output is correct
4 Correct 86 ms 4588 KB Output is correct
5 Correct 839 ms 7328 KB Output is correct
6 Correct 1652 ms 8760 KB Output is correct
7 Correct 882 ms 7332 KB Output is correct
8 Correct 773 ms 6252 KB Output is correct
9 Correct 767 ms 6324 KB Output is correct
10 Correct 796 ms 6244 KB Output is correct
11 Correct 1245 ms 7676 KB Output is correct
12 Correct 1217 ms 7756 KB Output is correct
13 Correct 1252 ms 7612 KB Output is correct
14 Correct 732 ms 7356 KB Output is correct
15 Correct 786 ms 7296 KB Output is correct
16 Correct 1686 ms 8712 KB Output is correct
17 Correct 1730 ms 8744 KB Output is correct
18 Correct 1718 ms 8784 KB Output is correct
19 Correct 1644 ms 8704 KB Output is correct
20 Correct 1458 ms 8032 KB Output is correct
21 Correct 1404 ms 7948 KB Output is correct
22 Correct 1622 ms 8628 KB Output is correct
23 Correct 906 ms 6784 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 978 ms 7996 KB Output is correct
2 Correct 982 ms 8004 KB Output is correct
3 Correct 945 ms 7944 KB Output is correct
4 Correct 979 ms 8024 KB Output is correct
5 Correct 966 ms 8084 KB Output is correct
6 Correct 1110 ms 7564 KB Output is correct
7 Correct 1090 ms 7760 KB Output is correct
8 Correct 1071 ms 7660 KB Output is correct
9 Correct 27 ms 3456 KB Output is correct
10 Correct 533 ms 6768 KB Output is correct
11 Correct 554 ms 6888 KB Output is correct
12 Correct 877 ms 6644 KB Output is correct
13 Correct 865 ms 9344 KB Output is correct
14 Correct 681 ms 6888 KB Output is correct
15 Correct 330 ms 5428 KB Output is correct
16 Correct 694 ms 6684 KB Output is correct
17 Correct 686 ms 6984 KB Output is correct
18 Correct 27 ms 3412 KB Output is correct
19 Correct 688 ms 7000 KB Output is correct
20 Correct 638 ms 6892 KB Output is correct
21 Correct 600 ms 6904 KB Output is correct
22 Correct 542 ms 5776 KB Output is correct
23 Correct 542 ms 5836 KB Output is correct
24 Correct 555 ms 8408 KB Output is correct
25 Correct 524 ms 8284 KB Output is correct
26 Correct 995 ms 8060 KB Output is correct
27 Correct 1082 ms 7676 KB Output is correct
28 Correct 1034 ms 8020 KB Output is correct
29 Correct 895 ms 7964 KB Output is correct
30 Correct 1062 ms 7788 KB Output is correct
31 Correct 1087 ms 7856 KB Output is correct
32 Correct 1102 ms 7780 KB Output is correct
33 Correct 1046 ms 7988 KB Output is correct
34 Correct 1028 ms 7992 KB Output is correct
35 Correct 1025 ms 7988 KB Output is correct
36 Correct 899 ms 8000 KB Output is correct
37 Correct 934 ms 8044 KB Output is correct
38 Correct 891 ms 7992 KB Output is correct
39 Correct 825 ms 6888 KB Output is correct
40 Correct 811 ms 6780 KB Output is correct
41 Correct 828 ms 6796 KB Output is correct
42 Correct 816 ms 8924 KB Output is correct
43 Correct 803 ms 8804 KB Output is correct
44 Correct 819 ms 8816 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 18 ms 2088 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 8 ms 980 KB Output is correct
6 Correct 7 ms 936 KB Output is correct
7 Correct 8 ms 980 KB Output is correct
8 Correct 9 ms 1088 KB Output is correct
9 Correct 8 ms 980 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 8 ms 988 KB Output is correct
12 Correct 10 ms 996 KB Output is correct
13 Correct 11 ms 1252 KB Output is correct
14 Correct 10 ms 1236 KB Output is correct
15 Correct 9 ms 1028 KB Output is correct
16 Correct 7 ms 980 KB Output is correct
17 Correct 7 ms 996 KB Output is correct
18 Correct 978 ms 7996 KB Output is correct
19 Correct 982 ms 8004 KB Output is correct
20 Correct 945 ms 7944 KB Output is correct
21 Correct 979 ms 8024 KB Output is correct
22 Correct 966 ms 8084 KB Output is correct
23 Correct 1110 ms 7564 KB Output is correct
24 Correct 1090 ms 7760 KB Output is correct
25 Correct 1071 ms 7660 KB Output is correct
26 Correct 27 ms 3456 KB Output is correct
27 Correct 533 ms 6768 KB Output is correct
28 Correct 554 ms 6888 KB Output is correct
29 Correct 877 ms 6644 KB Output is correct
30 Correct 865 ms 9344 KB Output is correct
31 Correct 681 ms 6888 KB Output is correct
32 Correct 330 ms 5428 KB Output is correct
33 Correct 694 ms 6684 KB Output is correct
34 Correct 686 ms 6984 KB Output is correct
35 Correct 27 ms 3412 KB Output is correct
36 Correct 688 ms 7000 KB Output is correct
37 Correct 638 ms 6892 KB Output is correct
38 Correct 600 ms 6904 KB Output is correct
39 Correct 542 ms 5776 KB Output is correct
40 Correct 542 ms 5836 KB Output is correct
41 Correct 555 ms 8408 KB Output is correct
42 Correct 524 ms 8284 KB Output is correct
43 Correct 1690 ms 8844 KB Output is correct
44 Correct 26 ms 3404 KB Output is correct
45 Correct 196 ms 4452 KB Output is correct
46 Correct 86 ms 4588 KB Output is correct
47 Correct 839 ms 7328 KB Output is correct
48 Correct 1652 ms 8760 KB Output is correct
49 Correct 882 ms 7332 KB Output is correct
50 Correct 773 ms 6252 KB Output is correct
51 Correct 767 ms 6324 KB Output is correct
52 Correct 796 ms 6244 KB Output is correct
53 Correct 1245 ms 7676 KB Output is correct
54 Correct 1217 ms 7756 KB Output is correct
55 Correct 1252 ms 7612 KB Output is correct
56 Correct 732 ms 7356 KB Output is correct
57 Correct 786 ms 7296 KB Output is correct
58 Correct 1686 ms 8712 KB Output is correct
59 Correct 1730 ms 8744 KB Output is correct
60 Correct 1718 ms 8784 KB Output is correct
61 Correct 1644 ms 8704 KB Output is correct
62 Correct 1458 ms 8032 KB Output is correct
63 Correct 1404 ms 7948 KB Output is correct
64 Correct 1622 ms 8628 KB Output is correct
65 Correct 906 ms 6784 KB Output is correct
66 Correct 995 ms 8060 KB Output is correct
67 Correct 1082 ms 7676 KB Output is correct
68 Correct 1034 ms 8020 KB Output is correct
69 Correct 895 ms 7964 KB Output is correct
70 Correct 1062 ms 7788 KB Output is correct
71 Correct 1087 ms 7856 KB Output is correct
72 Correct 1102 ms 7780 KB Output is correct
73 Correct 1046 ms 7988 KB Output is correct
74 Correct 1028 ms 7992 KB Output is correct
75 Correct 1025 ms 7988 KB Output is correct
76 Correct 899 ms 8000 KB Output is correct
77 Correct 934 ms 8044 KB Output is correct
78 Correct 891 ms 7992 KB Output is correct
79 Correct 825 ms 6888 KB Output is correct
80 Correct 811 ms 6780 KB Output is correct
81 Correct 828 ms 6796 KB Output is correct
82 Correct 816 ms 8924 KB Output is correct
83 Correct 803 ms 8804 KB Output is correct
84 Correct 819 ms 8816 KB Output is correct
85 Correct 1977 ms 10060 KB Output is correct
86 Correct 210 ms 6040 KB Output is correct
87 Correct 97 ms 6080 KB Output is correct
88 Correct 1018 ms 8480 KB Output is correct
89 Correct 1929 ms 10228 KB Output is correct
90 Correct 1025 ms 8640 KB Output is correct
91 Correct 1035 ms 7932 KB Output is correct
92 Correct 1059 ms 8096 KB Output is correct
93 Correct 1147 ms 7644 KB Output is correct
94 Correct 1515 ms 9120 KB Output is correct
95 Correct 1500 ms 9232 KB Output is correct
96 Correct 1515 ms 8836 KB Output is correct
97 Correct 911 ms 7284 KB Output is correct
98 Correct 954 ms 10108 KB Output is correct
99 Correct 1973 ms 10052 KB Output is correct
100 Correct 1969 ms 10000 KB Output is correct
101 Correct 1972 ms 10128 KB Output is correct
102 Correct 1919 ms 10048 KB Output is correct
103 Correct 1669 ms 9136 KB Output is correct
104 Correct 1721 ms 9076 KB Output is correct
105 Correct 1577 ms 10676 KB Output is correct
106 Correct 1338 ms 10404 KB Output is correct
107 Correct 1531 ms 7988 KB Output is correct
108 Correct 1866 ms 9744 KB Output is correct
109 Correct 1164 ms 7848 KB Output is correct