oj.uz

답안 #219585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219585 2020-04-05T16:16:56 Z socho Railway (BOI17_railway) C++14
100 / 100
 237 ms 46952 KB 
#include "bits/stdc++.h"
using namespace std;
// #define int long long
 
int n, m, k;
const int MXN = 300005;
vector<int> adj[MXN];
 
int st_start[MXN];
int st_end[MXN];
int at = 0;
 
int adder[MXN];
 
void dfs_tr(int node, int last) {
	st_start[node] = at;
	at++;
	for (int i=0; i<adj[node].size(); i++) {
		int x = adj[node][i];
		if (x == last) continue;
		dfs_tr(x, node);
	}
	st_end[node] = at;
	at++;
}
 
const int MXK = 20;
int depth[MXN];
int par[MXN][MXK];
 
void dfs_dep(int node, int last, int dep) {
	par[node][0] = last;
	depth[node] = dep;
	for (int i=1; i<MXK; i++) {
		int p = par[node][i-1];
		if (p == -1) continue;
		par[node][i] = par[p][i-1];
	}
	for (int i=0; i<adj[node].size(); i++) {
		int o = adj[node][i];
		if (o == last) continue;
		dfs_dep(o, node, dep+1);
	}
}
 
int kth_parent(int n, int k) {
	for (int i=0; i<MXK; i++) {
		if (k & (1 << i)) {
			n = par[n][i];
		}
	}
	return n;
}
 
int lca(int a, int b) {
	if (depth[a] > depth[b]) swap(a, b);
	b = kth_parent(b, depth[b]-depth[a]);
	
	// cout << a << ' ' << b << endl;
	
	if (a == b) return a;
	
	for (int i=MXK-1; i>=0; i--) {
		if (par[a][i] != par[b][i]) {
			a = par[a][i];
			b = par[b][i];
		}
	}
	return par[a][0];
}
 
bool byt(int a, int b) {
	return st_start[a] < st_start[b];
}
 
int delta[MXN];
vector<int> chosen;
int att[MXN];
 
int dfs_rec(int node, int last) {
	
	int ans = delta[node];
	
	for (int i=0; i<adj[node].size(); i++) {
		int ad = adj[node][i];
		if (ad == last) continue;
		ans += dfs_rec(ad, node);
	}
	
	return att[node] = ans;
	
}
 
signed main() {
	
	for (int i=0; i<MXN; i++) for (int j=0; j<MXK; j++) par[i][j] = -1;
	
	cin >> n >> m >> k;
	
	vector<pair<int, int> > ed;
	
	for (int i=1; i<n; i++) {
		int a, b;
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
		ed.push_back(make_pair(a, b));
	}
	dfs_tr(1, -1);
	dfs_dep(1, -1, 0);
	
	int above[n+1];
	
	for (int i=0; i<n-1; i++) {
		int a = ed[i].first, b = ed[i].second;
		if (depth[a] > depth[b]) above[a] = i+1;
		else above[b] = i+1;
	}
	
	
	// for (int i=1; i<=n; i++) cout << i << ' ' << st_start[i] << ' ' << st_end[i] << endl;
	
	for (int T=0; T<m; T++) {
		
		int nm;
		cin >> nm;
		int arr[nm];
		for (int i=0; i<nm; i++) cin >> arr[i];
		
		sort(arr, arr+nm, byt);
		
		// for (int i=0; i<nm; i++) cout << arr[i] << ' '; cout << endl;
		
		vector<pair<int, int> > ranges;
		
		
		for (int i=0; i<nm; i++) {
			int a = arr[i], b = arr[(i+1)%nm];
			int l = lca(a, b);
			// cout << a << ' ' << b << ' ' << l << endl;
			delta[l] -= 2;
			delta[a]++;
			delta[b]++;
		}
		
		
	}
	
	dfs_rec(1, -1);
	
	vector<int> f;
	
	for (int i=1; i<=n; i++) {
		if (att[i] >= 2 * k) {
			f.push_back(above[i]);
		}
	}
	sort(f.begin(), f.end());
	
	cout << f.size() << endl;
	for (int i=0; i<f.size(); i++) cout << f[i] << ' ';
	cout << endl;
	
	
	
}

Compilation message

railway.cpp: In function 'void dfs_tr(int, int)':
railway.cpp:18:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<adj[node].size(); i++) {
                ~^~~~~~~~~~~~~~~~~
railway.cpp: In function 'void dfs_dep(int, int, int)':
railway.cpp:39:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<adj[node].size(); i++) {
                ~^~~~~~~~~~~~~~~~~
railway.cpp: In function 'int dfs_rec(int, int)':
railway.cpp:84:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<adj[node].size(); i++) {
                ~^~~~~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:161:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<f.size(); i++) cout << f[i] << ' ';
                ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 30848 KB Output is correct
2 Correct 34 ms 31608 KB Output is correct
3 Correct 33 ms 31616 KB Output is correct
4 Correct 24 ms 30884 KB Output is correct
5 Correct 22 ms 30848 KB Output is correct
6 Correct 34 ms 31992 KB Output is correct
7 Correct 33 ms 31744 KB Output is correct
8 Correct 31 ms 31616 KB Output is correct
9 Correct 31 ms 31736 KB Output is correct
10 Correct 23 ms 30848 KB Output is correct
11 Correct 23 ms 30848 KB Output is correct
12 Correct 23 ms 30848 KB Output is correct
13 Correct 22 ms 30848 KB Output is correct
14 Correct 22 ms 30848 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 30848 KB Output is correct
2 Correct 34 ms 31608 KB Output is correct
3 Correct 33 ms 31616 KB Output is correct
4 Correct 24 ms 30884 KB Output is correct
5 Correct 22 ms 30848 KB Output is correct
6 Correct 34 ms 31992 KB Output is correct
7 Correct 33 ms 31744 KB Output is correct
8 Correct 31 ms 31616 KB Output is correct
9 Correct 31 ms 31736 KB Output is correct
10 Correct 23 ms 30848 KB Output is correct
11 Correct 23 ms 30848 KB Output is correct
12 Correct 23 ms 30848 KB Output is correct
13 Correct 22 ms 30848 KB Output is correct
14 Correct 22 ms 30848 KB Output is correct
15 Correct 70 ms 31992 KB Output is correct
16 Correct 70 ms 32124 KB Output is correct
17 Correct 77 ms 32252 KB Output is correct
18 Correct 35 ms 31992 KB Output is correct
19 Correct 34 ms 31744 KB Output is correct
20 Correct 78 ms 32248 KB Output is correct
21 Correct 81 ms 32120 KB Output is correct
22 Correct 22 ms 30848 KB Output is correct
23 Correct 34 ms 31608 KB Output is correct
24 Correct 34 ms 31608 KB Output is correct
25 Correct 22 ms 30848 KB Output is correct
26 Correct 23 ms 30848 KB Output is correct
27 Correct 34 ms 31992 KB Output is correct
28 Correct 33 ms 31736 KB Output is correct
29 Correct 31 ms 31616 KB Output is correct
30 Correct 33 ms 31616 KB Output is correct
31 Correct 25 ms 30848 KB Output is correct
32 Correct 23 ms 30848 KB Output is correct
33 Correct 23 ms 30848 KB Output is correct
34 Correct 22 ms 30848 KB Output is correct
35 Correct 22 ms 30840 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 224 ms 46572 KB Output is correct
2 Correct 23 ms 30848 KB Output is correct
3 Correct 229 ms 45932 KB Output is correct
4 Correct 220 ms 45292 KB Output is correct
5 Correct 237 ms 46700 KB Output is correct
6 Correct 230 ms 46952 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 207 ms 41960 KB Output is correct
2 Correct 230 ms 39408 KB Output is correct
3 Correct 225 ms 39016 KB Output is correct
4 Correct 225 ms 39020 KB Output is correct
5 Correct 233 ms 39040 KB Output is correct
6 Correct 205 ms 42092 KB Output is correct
7 Correct 201 ms 42092 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 207 ms 41960 KB Output is correct
2 Correct 230 ms 39408 KB Output is correct
3 Correct 225 ms 39016 KB Output is correct
4 Correct 225 ms 39020 KB Output is correct
5 Correct 233 ms 39040 KB Output is correct
6 Correct 205 ms 42092 KB Output is correct
7 Correct 201 ms 42092 KB Output is correct
8 Correct 225 ms 42348 KB Output is correct
9 Correct 209 ms 42348 KB Output is correct
10 Correct 211 ms 46568 KB Output is correct
11 Correct 217 ms 46700 KB Output is correct
12 Correct 177 ms 38892 KB Output is correct
13 Correct 173 ms 38892 KB Output is correct
14 Correct 224 ms 39020 KB Output is correct
15 Correct 213 ms 39016 KB Output is correct
16 Correct 226 ms 39016 KB Output is correct
17 Correct 227 ms 39108 KB Output is correct
18 Correct 220 ms 39020 KB Output is correct
19 Correct 217 ms 39404 KB Output is correct
20 Correct 214 ms 42472 KB Output is correct
21 Correct 212 ms 42600 KB Output is correct
22 Correct 204 ms 42344 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 30848 KB Output is correct
2 Correct 34 ms 31608 KB Output is correct
3 Correct 33 ms 31616 KB Output is correct
4 Correct 24 ms 30884 KB Output is correct
5 Correct 22 ms 30848 KB Output is correct
6 Correct 34 ms 31992 KB Output is correct
7 Correct 33 ms 31744 KB Output is correct
8 Correct 31 ms 31616 KB Output is correct
9 Correct 31 ms 31736 KB Output is correct
10 Correct 23 ms 30848 KB Output is correct
11 Correct 23 ms 30848 KB Output is correct
12 Correct 23 ms 30848 KB Output is correct
13 Correct 22 ms 30848 KB Output is correct
14 Correct 22 ms 30848 KB Output is correct
15 Correct 70 ms 31992 KB Output is correct
16 Correct 70 ms 32124 KB Output is correct
17 Correct 77 ms 32252 KB Output is correct
18 Correct 35 ms 31992 KB Output is correct
19 Correct 34 ms 31744 KB Output is correct
20 Correct 78 ms 32248 KB Output is correct
21 Correct 81 ms 32120 KB Output is correct
22 Correct 22 ms 30848 KB Output is correct
23 Correct 34 ms 31608 KB Output is correct
24 Correct 34 ms 31608 KB Output is correct
25 Correct 22 ms 30848 KB Output is correct
26 Correct 23 ms 30848 KB Output is correct
27 Correct 34 ms 31992 KB Output is correct
28 Correct 33 ms 31736 KB Output is correct
29 Correct 31 ms 31616 KB Output is correct
30 Correct 33 ms 31616 KB Output is correct
31 Correct 25 ms 30848 KB Output is correct
32 Correct 23 ms 30848 KB Output is correct
33 Correct 23 ms 30848 KB Output is correct
34 Correct 22 ms 30848 KB Output is correct
35 Correct 22 ms 30840 KB Output is correct
36 Correct 224 ms 46572 KB Output is correct
37 Correct 23 ms 30848 KB Output is correct
38 Correct 229 ms 45932 KB Output is correct
39 Correct 220 ms 45292 KB Output is correct
40 Correct 237 ms 46700 KB Output is correct
41 Correct 230 ms 46952 KB Output is correct
42 Correct 207 ms 41960 KB Output is correct
43 Correct 230 ms 39408 KB Output is correct
44 Correct 225 ms 39016 KB Output is correct
45 Correct 225 ms 39020 KB Output is correct
46 Correct 233 ms 39040 KB Output is correct
47 Correct 205 ms 42092 KB Output is correct
48 Correct 201 ms 42092 KB Output is correct
49 Correct 225 ms 42348 KB Output is correct
50 Correct 209 ms 42348 KB Output is correct
51 Correct 211 ms 46568 KB Output is correct
52 Correct 217 ms 46700 KB Output is correct
53 Correct 177 ms 38892 KB Output is correct
54 Correct 173 ms 38892 KB Output is correct
55 Correct 224 ms 39020 KB Output is correct
56 Correct 213 ms 39016 KB Output is correct
57 Correct 226 ms 39016 KB Output is correct
58 Correct 227 ms 39108 KB Output is correct
59 Correct 220 ms 39020 KB Output is correct
60 Correct 217 ms 39404 KB Output is correct
61 Correct 214 ms 42472 KB Output is correct
62 Correct 212 ms 42600 KB Output is correct
63 Correct 204 ms 42344 KB Output is correct
64 Correct 221 ms 42472 KB Output is correct
65 Correct 228 ms 39020 KB Output is correct
66 Correct 222 ms 39020 KB Output is correct
67 Correct 223 ms 39208 KB Output is correct
68 Correct 181 ms 38892 KB Output is correct
69 Correct 159 ms 38888 KB Output is correct
70 Correct 228 ms 42984 KB Output is correct
71 Correct 211 ms 42092 KB Output is correct
72 Correct 22 ms 30848 KB Output is correct
73 Correct 32 ms 31616 KB Output is correct
74 Correct 33 ms 31616 KB Output is correct
75 Correct 22 ms 30848 KB Output is correct
76 Correct 23 ms 30848 KB Output is correct
77 Correct 33 ms 31992 KB Output is correct
78 Correct 33 ms 31736 KB Output is correct
79 Correct 31 ms 31608 KB Output is correct
80 Correct 31 ms 31608 KB Output is correct
81 Correct 22 ms 30880 KB Output is correct
82 Correct 21 ms 30848 KB Output is correct
83 Correct 22 ms 30848 KB Output is correct
84 Correct 22 ms 30848 KB Output is correct
85 Correct 22 ms 30840 KB Output is correct
86 Correct 72 ms 32120 KB Output is correct
87 Correct 70 ms 31992 KB Output is correct
88 Correct 71 ms 32120 KB Output is correct
89 Correct 37 ms 32000 KB Output is correct
90 Correct 33 ms 31736 KB Output is correct
91 Correct 76 ms 32248 KB Output is correct
92 Correct 77 ms 32120 KB Output is correct
93 Correct 22 ms 30848 KB Output is correct
94 Correct 223 ms 46572 KB Output is correct
95 Correct 221 ms 45928 KB Output is correct
96 Correct 217 ms 45288 KB Output is correct
97 Correct 235 ms 46700 KB Output is correct
98 Correct 232 ms 46952 KB Output is correct
99 Correct 227 ms 39016 KB Output is correct
100 Correct 231 ms 39172 KB Output is correct
101 Correct 222 ms 39020 KB Output is correct
102 Correct 217 ms 39400 KB Output is correct
103 Correct 211 ms 42256 KB Output is correct
104 Correct 205 ms 42476 KB Output is correct
105 Correct 201 ms 41964 KB Output is correct
106 Correct 225 ms 42372 KB Output is correct
107 Correct 210 ms 42216 KB Output is correct
108 Correct 214 ms 46696 KB Output is correct
109 Correct 210 ms 46572 KB Output is correct
110 Correct 174 ms 38892 KB Output is correct
111 Correct 171 ms 38892 KB Output is correct
112 Correct 226 ms 39020 KB Output is correct
113 Correct 218 ms 39020 KB Output is correct