oj.uz

Submission #210691

# Submission time Handle Problem Language Result Execution time Memory
210691 2020-03-18T02:51:01 Z super_j6 Railway (BOI17_railway) C++14
100 / 100
 287 ms 20592 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <vector>
#include <set>
using namespace std;
#define endl '\n'
#define pi pair<int, int>
#define f first
#define s second

const int maxn = 100001;

struct BIT{
	int bit[maxn];
	
	BIT(){
		memset(bit, 0, sizeof(bit));
	}
	
	void add(int x, int v){
		for(x++; x < maxn; x += x & -x) bit[x] += v;
	}
	
	int qry(int x){
		int ret = 0;
		for(x++; x; x -= x & -x) ret += bit[x];
		return ret;
	}
	
	int qry(int a, int b){
		return qry(b) - qry(a - 1);
	}
};

const int w = 18;
int n, m, k;
int l[maxn], r[maxn], d[maxn], dp[maxn];
int p[w][maxn];
vector<pi> graph[maxn];
BIT bit;
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 = -bit.qry(l[b.back().f], r[b.back().f]) + 1;
			bit.add(l[b.back().f], b.back().s);
			dp[b.back().f] += b.back().s;
		}
		dp[b.back().f]--;
		for(pi i : b){
			bit.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:136: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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3192 KB Output is correct
2 Correct 12 ms 4472 KB Output is correct
3 Correct 12 ms 4476 KB Output is correct
4 Correct 6 ms 3192 KB Output is correct
5 Correct 6 ms 3192 KB Output is correct
6 Correct 12 ms 4728 KB Output is correct
7 Correct 12 ms 4600 KB Output is correct
8 Correct 11 ms 4472 KB Output is correct
9 Correct 11 ms 4472 KB Output is correct
10 Correct 6 ms 3192 KB Output is correct
11 Correct 6 ms 3192 KB Output is correct
12 Correct 6 ms 3192 KB Output is correct
13 Correct 6 ms 3196 KB Output is correct
14 Correct 6 ms 3192 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3192 KB Output is correct
2 Correct 12 ms 4472 KB Output is correct
3 Correct 12 ms 4476 KB Output is correct
4 Correct 6 ms 3192 KB Output is correct
5 Correct 6 ms 3192 KB Output is correct
6 Correct 12 ms 4728 KB Output is correct
7 Correct 12 ms 4600 KB Output is correct
8 Correct 11 ms 4472 KB Output is correct
9 Correct 11 ms 4472 KB Output is correct
10 Correct 6 ms 3192 KB Output is correct
11 Correct 6 ms 3192 KB Output is correct
12 Correct 6 ms 3192 KB Output is correct
13 Correct 6 ms 3196 KB Output is correct
14 Correct 6 ms 3192 KB Output is correct
15 Correct 72 ms 4472 KB Output is correct
16 Correct 73 ms 4472 KB Output is correct
17 Correct 72 ms 4472 KB Output is correct
18 Correct 13 ms 4728 KB Output is correct
19 Correct 12 ms 4472 KB Output is correct
20 Correct 65 ms 4512 KB Output is correct
21 Correct 71 ms 4472 KB Output is correct
22 Correct 6 ms 3192 KB Output is correct
23 Correct 12 ms 4440 KB Output is correct
24 Correct 12 ms 4472 KB Output is correct
25 Correct 6 ms 3192 KB Output is correct
26 Correct 6 ms 3192 KB Output is correct
27 Correct 13 ms 4728 KB Output is correct
28 Correct 12 ms 4600 KB Output is correct
29 Correct 11 ms 4472 KB Output is correct
30 Correct 11 ms 4472 KB Output is correct
31 Correct 6 ms 3192 KB Output is correct
32 Correct 7 ms 3192 KB Output is correct
33 Correct 7 ms 3192 KB Output is correct
34 Correct 6 ms 3192 KB Output is correct
35 Correct 6 ms 3192 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 20460 KB Output is correct
2 Correct 6 ms 3320 KB Output is correct
3 Correct 203 ms 20084 KB Output is correct
4 Correct 193 ms 19448 KB Output is correct
5 Correct 287 ms 20464 KB Output is correct
6 Correct 220 ms 20592 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 17660 KB Output is correct
2 Correct 139 ms 15736 KB Output is correct
3 Correct 157 ms 15512 KB Output is correct
4 Correct 154 ms 15352 KB Output is correct
5 Correct 168 ms 15476 KB Output is correct
6 Correct 113 ms 17784 KB Output is correct
7 Correct 109 ms 17784 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 17660 KB Output is correct
2 Correct 139 ms 15736 KB Output is correct
3 Correct 157 ms 15512 KB Output is correct
4 Correct 154 ms 15352 KB Output is correct
5 Correct 168 ms 15476 KB Output is correct
6 Correct 113 ms 17784 KB Output is correct
7 Correct 109 ms 17784 KB Output is correct
8 Correct 217 ms 17940 KB Output is correct
9 Correct 199 ms 17912 KB Output is correct
10 Correct 224 ms 20464 KB Output is correct
11 Correct 226 ms 20592 KB Output is correct
12 Correct 226 ms 15608 KB Output is correct
13 Correct 243 ms 15608 KB Output is correct
14 Correct 200 ms 15352 KB Output is correct
15 Correct 197 ms 15480 KB Output is correct
16 Correct 158 ms 15480 KB Output is correct
17 Correct 160 ms 15480 KB Output is correct
18 Correct 155 ms 15480 KB Output is correct
19 Correct 146 ms 15608 KB Output is correct
20 Correct 116 ms 18040 KB Output is correct
21 Correct 120 ms 18164 KB Output is correct
22 Correct 114 ms 18040 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3192 KB Output is correct
2 Correct 12 ms 4472 KB Output is correct
3 Correct 12 ms 4476 KB Output is correct
4 Correct 6 ms 3192 KB Output is correct
5 Correct 6 ms 3192 KB Output is correct
6 Correct 12 ms 4728 KB Output is correct
7 Correct 12 ms 4600 KB Output is correct
8 Correct 11 ms 4472 KB Output is correct
9 Correct 11 ms 4472 KB Output is correct
10 Correct 6 ms 3192 KB Output is correct
11 Correct 6 ms 3192 KB Output is correct
12 Correct 6 ms 3192 KB Output is correct
13 Correct 6 ms 3196 KB Output is correct
14 Correct 6 ms 3192 KB Output is correct
15 Correct 72 ms 4472 KB Output is correct
16 Correct 73 ms 4472 KB Output is correct
17 Correct 72 ms 4472 KB Output is correct
18 Correct 13 ms 4728 KB Output is correct
19 Correct 12 ms 4472 KB Output is correct
20 Correct 65 ms 4512 KB Output is correct
21 Correct 71 ms 4472 KB Output is correct
22 Correct 6 ms 3192 KB Output is correct
23 Correct 12 ms 4440 KB Output is correct
24 Correct 12 ms 4472 KB Output is correct
25 Correct 6 ms 3192 KB Output is correct
26 Correct 6 ms 3192 KB Output is correct
27 Correct 13 ms 4728 KB Output is correct
28 Correct 12 ms 4600 KB Output is correct
29 Correct 11 ms 4472 KB Output is correct
30 Correct 11 ms 4472 KB Output is correct
31 Correct 6 ms 3192 KB Output is correct
32 Correct 7 ms 3192 KB Output is correct
33 Correct 7 ms 3192 KB Output is correct
34 Correct 6 ms 3192 KB Output is correct
35 Correct 6 ms 3192 KB Output is correct
36 Correct 203 ms 20460 KB Output is correct
37 Correct 6 ms 3320 KB Output is correct
38 Correct 203 ms 20084 KB Output is correct
39 Correct 193 ms 19448 KB Output is correct
40 Correct 287 ms 20464 KB Output is correct
41 Correct 220 ms 20592 KB Output is correct
42 Correct 108 ms 17660 KB Output is correct
43 Correct 139 ms 15736 KB Output is correct
44 Correct 157 ms 15512 KB Output is correct
45 Correct 154 ms 15352 KB Output is correct
46 Correct 168 ms 15476 KB Output is correct
47 Correct 113 ms 17784 KB Output is correct
48 Correct 109 ms 17784 KB Output is correct
49 Correct 217 ms 17940 KB Output is correct
50 Correct 199 ms 17912 KB Output is correct
51 Correct 224 ms 20464 KB Output is correct
52 Correct 226 ms 20592 KB Output is correct
53 Correct 226 ms 15608 KB Output is correct
54 Correct 243 ms 15608 KB Output is correct
55 Correct 200 ms 15352 KB Output is correct
56 Correct 197 ms 15480 KB Output is correct
57 Correct 158 ms 15480 KB Output is correct
58 Correct 160 ms 15480 KB Output is correct
59 Correct 155 ms 15480 KB Output is correct
60 Correct 146 ms 15608 KB Output is correct
61 Correct 116 ms 18040 KB Output is correct
62 Correct 120 ms 18164 KB Output is correct
63 Correct 114 ms 18040 KB Output is correct
64 Correct 145 ms 17912 KB Output is correct
65 Correct 215 ms 15480 KB Output is correct
66 Correct 245 ms 15476 KB Output is correct
67 Correct 209 ms 15352 KB Output is correct
68 Correct 163 ms 15736 KB Output is correct
69 Correct 159 ms 15740 KB Output is correct
70 Correct 147 ms 18292 KB Output is correct
71 Correct 211 ms 17656 KB Output is correct
72 Correct 6 ms 3192 KB Output is correct
73 Correct 11 ms 4472 KB Output is correct
74 Correct 12 ms 4344 KB Output is correct
75 Correct 6 ms 3192 KB Output is correct
76 Correct 6 ms 3192 KB Output is correct
77 Correct 12 ms 4728 KB Output is correct
78 Correct 12 ms 4472 KB Output is correct
79 Correct 13 ms 4472 KB Output is correct
80 Correct 12 ms 4476 KB Output is correct
81 Correct 6 ms 3192 KB Output is correct
82 Correct 6 ms 3192 KB Output is correct
83 Correct 6 ms 3192 KB Output is correct
84 Correct 7 ms 3192 KB Output is correct
85 Correct 6 ms 3196 KB Output is correct
86 Correct 70 ms 4472 KB Output is correct
87 Correct 73 ms 4472 KB Output is correct
88 Correct 74 ms 4472 KB Output is correct
89 Correct 12 ms 4728 KB Output is correct
90 Correct 12 ms 4472 KB Output is correct
91 Correct 65 ms 4472 KB Output is correct
92 Correct 71 ms 4472 KB Output is correct
93 Correct 6 ms 3192 KB Output is correct
94 Correct 214 ms 20464 KB Output is correct
95 Correct 200 ms 20084 KB Output is correct
96 Correct 197 ms 19448 KB Output is correct
97 Correct 278 ms 20468 KB Output is correct
98 Correct 223 ms 20588 KB Output is correct
99 Correct 167 ms 15480 KB Output is correct
100 Correct 161 ms 15480 KB Output is correct
101 Correct 163 ms 15480 KB Output is correct
102 Correct 150 ms 15608 KB Output is correct
103 Correct 115 ms 17784 KB Output is correct
104 Correct 113 ms 18164 KB Output is correct
105 Correct 114 ms 17656 KB Output is correct
106 Correct 216 ms 18040 KB Output is correct
107 Correct 199 ms 17784 KB Output is correct
108 Correct 220 ms 20592 KB Output is correct
109 Correct 223 ms 20588 KB Output is correct
110 Correct 239 ms 15736 KB Output is correct
111 Correct 228 ms 15608 KB Output is correct
112 Correct 198 ms 15352 KB Output is correct
113 Correct 202 ms 15480 KB Output is correct