oj.uz

답안 #210689

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
210689 2020-03-18T02:43:17 Z super_j6 Railway (BOI17_railway) C++14
100 / 100
 460 ms 31608 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
#define endl '\n'
#define pi pair<int, int>
#define f first
#define s second

struct segTree{
	int l, r;
	segTree *left, *right;
	int val = 0;
	
	segTree(int a, int b){
		l = a;
		r = b;
		
		if(l != r){
			int mid = (l + r) / 2;
			left = new segTree(l, mid);
			right = new segTree(mid + 1, r);
		}
	}
	
	void add(int x, int v){
		if(x < l || r < x) return;
		if(l == r){
			val += v;
			return;
		}
		
		left->add(x, v);
		right->add(x, v);
		val = left->val + right->val;
	}
	
	int qry(int a, int b){
		if(b < l || r < a) return 0;
		if(a <= l && r <= b) return val;
		
		return left->qry(a, b) + right->qry(a, b);
	}
};

const int maxn = 100000, w = 18;
int n, m, k;
int l[maxn], r[maxn], d[maxn], dp[maxn];
int p[w][maxn];
vector<pi> graph[maxn];
segTree tre(0, maxn);
vector<int> ans;

auto cmp = [&](int x, int y){
	return (pi){r[x], -l[x]} < (pi){r[y], -l[y]};
};
set<int, decltype(cmp)> a(cmp);
vector<pi> b;

int dfs(int c){
	r[c] = l[c];
	for(pi i : graph[c]){
		if(i.f == p[0][c]) continue;
		d[i.f] = d[c] + 1;
		l[i.f] = r[c] + 1;
		p[0][i.f] = c;
		r[c] = dfs(i.f);
	}
	return r[c];
}

int lca(int x, int y){
	if(d[x] < d[y]) swap(x, y);
	for(int i = w - 1; i >= 0; i--) if(p[i][x] != -1 && d[p[i][x]] >= d[y]) x = p[i][x];
	for(int i = w - 1; i >= 0; i--){
		if(p[i][x] != p[i][y]){
			x = p[i][x];
			y = p[i][y];
		}
	}
	return x == y ? x : p[0][x];
}

void dfs2(int c){
	for(pi i : graph[c]){
		if(i.f == p[0][c]) continue;
		dfs2(i.f);
		if(dp[i.f] >= k) ans.push_back(i.s);
		dp[c] += dp[i.f];
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n >> m >> k;

	for(int i = 1; i < n; i++){
		int u, v;
		cin >> u >> v;
		u--, v--;
		graph[u].push_back({v, i});
		graph[v].push_back({u, i});
	}
	
	p[0][0] = -1;
	dfs(0);
	
	for(int i = 1; i < w; i++)
	for(int j = 0; j < n; j++){
		p[i][j] = p[i - 1][j] == -1 ? -1 : p[i - 1][p[i - 1][j]];
	}
	
	for(int i = 0; i < m; i++){
		int s;
		cin >> s;
		
		b.clear();
		for(int j = 0; j < s; j++){
			int x;
			cin >> x;
			x--;
			a.insert(x);
		}
		while(!a.empty()){
			if(!b.empty()) a.insert(lca(b.back().f, *a.begin()));
			b.push_back({*a.begin(), 0});
			a.erase(a.begin());
			b.back().s = -tre.qry(l[b.back().f], r[b.back().f]) + 1;
			tre.add(l[b.back().f], b.back().s);
			dp[b.back().f] += b.back().s;
		}
		dp[b.back().f]--;
		for(pi i : b){
			tre.add(l[i.f], -i.s);
		}
	}
	
	dfs2(0);
	sort(ans.begin(), ans.end());
	
	cout << ans.size() << endl;
	if(!ans.empty()) cout << ans[0];
	for(int i = 1; i < ans.size(); i++) cout << " " << ans[i];
	cout << endl;

	return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:147:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < ans.size(); i++) cout << " " << ans[i];
                 ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 12152 KB Output is correct
2 Correct 21 ms 13560 KB Output is correct
3 Correct 21 ms 13560 KB Output is correct
4 Correct 15 ms 12152 KB Output is correct
5 Correct 16 ms 12152 KB Output is correct
6 Correct 22 ms 13816 KB Output is correct
7 Correct 23 ms 13688 KB Output is correct
8 Correct 21 ms 13560 KB Output is correct
9 Correct 22 ms 13560 KB Output is correct
10 Correct 15 ms 12152 KB Output is correct
11 Correct 15 ms 12152 KB Output is correct
12 Correct 15 ms 12152 KB Output is correct
13 Correct 17 ms 12152 KB Output is correct
14 Correct 16 ms 12152 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 12152 KB Output is correct
2 Correct 21 ms 13560 KB Output is correct
3 Correct 21 ms 13560 KB Output is correct
4 Correct 15 ms 12152 KB Output is correct
5 Correct 16 ms 12152 KB Output is correct
6 Correct 22 ms 13816 KB Output is correct
7 Correct 23 ms 13688 KB Output is correct
8 Correct 21 ms 13560 KB Output is correct
9 Correct 22 ms 13560 KB Output is correct
10 Correct 15 ms 12152 KB Output is correct
11 Correct 15 ms 12152 KB Output is correct
12 Correct 15 ms 12152 KB Output is correct
13 Correct 17 ms 12152 KB Output is correct
14 Correct 16 ms 12152 KB Output is correct
15 Correct 131 ms 13948 KB Output is correct
16 Correct 129 ms 13944 KB Output is correct
17 Correct 135 ms 13944 KB Output is correct
18 Correct 23 ms 13808 KB Output is correct
19 Correct 23 ms 13560 KB Output is correct
20 Correct 125 ms 14072 KB Output is correct
21 Correct 132 ms 13944 KB Output is correct
22 Correct 16 ms 12152 KB Output is correct
23 Correct 22 ms 13560 KB Output is correct
24 Correct 21 ms 13560 KB Output is correct
25 Correct 15 ms 12152 KB Output is correct
26 Correct 16 ms 12156 KB Output is correct
27 Correct 22 ms 13816 KB Output is correct
28 Correct 23 ms 13688 KB Output is correct
29 Correct 21 ms 13560 KB Output is correct
30 Correct 21 ms 13560 KB Output is correct
31 Correct 15 ms 12204 KB Output is correct
32 Correct 15 ms 12152 KB Output is correct
33 Correct 18 ms 12152 KB Output is correct
34 Correct 16 ms 12152 KB Output is correct
35 Correct 15 ms 12152 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 357 ms 29400 KB Output is correct
2 Correct 15 ms 12152 KB Output is correct
3 Correct 360 ms 29052 KB Output is correct
4 Correct 355 ms 28536 KB Output is correct
5 Correct 460 ms 29448 KB Output is correct
6 Correct 358 ms 29560 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 26616 KB Output is correct
2 Correct 195 ms 24824 KB Output is correct
3 Correct 239 ms 24568 KB Output is correct
4 Correct 222 ms 24824 KB Output is correct
5 Correct 258 ms 24864 KB Output is correct
6 Correct 170 ms 27168 KB Output is correct
7 Correct 165 ms 27132 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 26616 KB Output is correct
2 Correct 195 ms 24824 KB Output is correct
3 Correct 239 ms 24568 KB Output is correct
4 Correct 222 ms 24824 KB Output is correct
5 Correct 258 ms 24864 KB Output is correct
6 Correct 170 ms 27168 KB Output is correct
7 Correct 165 ms 27132 KB Output is correct
8 Correct 373 ms 27256 KB Output is correct
9 Correct 354 ms 28664 KB Output is correct
10 Correct 358 ms 31356 KB Output is correct
11 Correct 365 ms 31356 KB Output is correct
12 Correct 378 ms 25976 KB Output is correct
13 Correct 386 ms 25976 KB Output is correct
14 Correct 299 ms 26104 KB Output is correct
15 Correct 304 ms 26104 KB Output is correct
16 Correct 254 ms 26384 KB Output is correct
17 Correct 239 ms 26232 KB Output is correct
18 Correct 213 ms 26232 KB Output is correct
19 Correct 208 ms 26488 KB Output is correct
20 Correct 173 ms 28792 KB Output is correct
21 Correct 174 ms 28916 KB Output is correct
22 Correct 174 ms 28792 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 12152 KB Output is correct
2 Correct 21 ms 13560 KB Output is correct
3 Correct 21 ms 13560 KB Output is correct
4 Correct 15 ms 12152 KB Output is correct
5 Correct 16 ms 12152 KB Output is correct
6 Correct 22 ms 13816 KB Output is correct
7 Correct 23 ms 13688 KB Output is correct
8 Correct 21 ms 13560 KB Output is correct
9 Correct 22 ms 13560 KB Output is correct
10 Correct 15 ms 12152 KB Output is correct
11 Correct 15 ms 12152 KB Output is correct
12 Correct 15 ms 12152 KB Output is correct
13 Correct 17 ms 12152 KB Output is correct
14 Correct 16 ms 12152 KB Output is correct
15 Correct 131 ms 13948 KB Output is correct
16 Correct 129 ms 13944 KB Output is correct
17 Correct 135 ms 13944 KB Output is correct
18 Correct 23 ms 13808 KB Output is correct
19 Correct 23 ms 13560 KB Output is correct
20 Correct 125 ms 14072 KB Output is correct
21 Correct 132 ms 13944 KB Output is correct
22 Correct 16 ms 12152 KB Output is correct
23 Correct 22 ms 13560 KB Output is correct
24 Correct 21 ms 13560 KB Output is correct
25 Correct 15 ms 12152 KB Output is correct
26 Correct 16 ms 12156 KB Output is correct
27 Correct 22 ms 13816 KB Output is correct
28 Correct 23 ms 13688 KB Output is correct
29 Correct 21 ms 13560 KB Output is correct
30 Correct 21 ms 13560 KB Output is correct
31 Correct 15 ms 12204 KB Output is correct
32 Correct 15 ms 12152 KB Output is correct
33 Correct 18 ms 12152 KB Output is correct
34 Correct 16 ms 12152 KB Output is correct
35 Correct 15 ms 12152 KB Output is correct
36 Correct 357 ms 29400 KB Output is correct
37 Correct 15 ms 12152 KB Output is correct
38 Correct 360 ms 29052 KB Output is correct
39 Correct 355 ms 28536 KB Output is correct
40 Correct 460 ms 29448 KB Output is correct
41 Correct 358 ms 29560 KB Output is correct
42 Correct 170 ms 26616 KB Output is correct
43 Correct 195 ms 24824 KB Output is correct
44 Correct 239 ms 24568 KB Output is correct
45 Correct 222 ms 24824 KB Output is correct
46 Correct 258 ms 24864 KB Output is correct
47 Correct 170 ms 27168 KB Output is correct
48 Correct 165 ms 27132 KB Output is correct
49 Correct 373 ms 27256 KB Output is correct
50 Correct 354 ms 28664 KB Output is correct
51 Correct 358 ms 31356 KB Output is correct
52 Correct 365 ms 31356 KB Output is correct
53 Correct 378 ms 25976 KB Output is correct
54 Correct 386 ms 25976 KB Output is correct
55 Correct 299 ms 26104 KB Output is correct
56 Correct 304 ms 26104 KB Output is correct
57 Correct 254 ms 26384 KB Output is correct
58 Correct 239 ms 26232 KB Output is correct
59 Correct 213 ms 26232 KB Output is correct
60 Correct 208 ms 26488 KB Output is correct
61 Correct 173 ms 28792 KB Output is correct
62 Correct 174 ms 28916 KB Output is correct
63 Correct 174 ms 28792 KB Output is correct
64 Correct 248 ms 28728 KB Output is correct
65 Correct 363 ms 26232 KB Output is correct
66 Correct 433 ms 26104 KB Output is correct
67 Correct 342 ms 26104 KB Output is correct
68 Correct 261 ms 26012 KB Output is correct
69 Correct 255 ms 25976 KB Output is correct
70 Correct 251 ms 29044 KB Output is correct
71 Correct 402 ms 28408 KB Output is correct
72 Correct 16 ms 12152 KB Output is correct
73 Correct 22 ms 13560 KB Output is correct
74 Correct 22 ms 13560 KB Output is correct
75 Correct 15 ms 12152 KB Output is correct
76 Correct 15 ms 12204 KB Output is correct
77 Correct 22 ms 13820 KB Output is correct
78 Correct 24 ms 13692 KB Output is correct
79 Correct 21 ms 13560 KB Output is correct
80 Correct 21 ms 13560 KB Output is correct
81 Correct 15 ms 12152 KB Output is correct
82 Correct 15 ms 12156 KB Output is correct
83 Correct 15 ms 12152 KB Output is correct
84 Correct 15 ms 12152 KB Output is correct
85 Correct 15 ms 12156 KB Output is correct
86 Correct 124 ms 13944 KB Output is correct
87 Correct 129 ms 13944 KB Output is correct
88 Correct 130 ms 13944 KB Output is correct
89 Correct 23 ms 13816 KB Output is correct
90 Correct 22 ms 13560 KB Output is correct
91 Correct 124 ms 14072 KB Output is correct
92 Correct 131 ms 13944 KB Output is correct
93 Correct 16 ms 12152 KB Output is correct
94 Correct 351 ms 31220 KB Output is correct
95 Correct 364 ms 30968 KB Output is correct
96 Correct 352 ms 30328 KB Output is correct
97 Correct 458 ms 31220 KB Output is correct
98 Correct 366 ms 31608 KB Output is correct
99 Correct 263 ms 26232 KB Output is correct
100 Correct 239 ms 26232 KB Output is correct
101 Correct 240 ms 26236 KB Output is correct
102 Correct 219 ms 26472 KB Output is correct
103 Correct 174 ms 28536 KB Output is correct
104 Correct 177 ms 28916 KB Output is correct
105 Correct 175 ms 28536 KB Output is correct
106 Correct 374 ms 28880 KB Output is correct
107 Correct 348 ms 28536 KB Output is correct
108 Correct 358 ms 31356 KB Output is correct
109 Correct 354 ms 31356 KB Output is correct
110 Correct 379 ms 25976 KB Output is correct
111 Correct 379 ms 25976 KB Output is correct
112 Correct 312 ms 26104 KB Output is correct
113 Correct 327 ms 26108 KB Output is correct