oj.uz

Submission #864567

# Submission time Handle Problem Language Result Execution time Memory
864567 2023-10-23T08:52:29 Z iskhakkutbilim Railway (BOI17_railway) C++17
100 / 100
 348 ms 66876 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 2e5;
const int LOG = 20;
int up[N+1][LOG+1], depth[N+1], sub[N+1];
int bigchild[N+1], chain[N+1], Pos[N+1];
int n, m, k;
vector< pair<int, int> > edge;
vector<int> ans, g[N+1], ministr[N+1], tins[N+1];
int tin[N+1], tout[N+1], T, position;
 
 
 
 
void dfs(int v, int p){
	tin[v] = ++T;
	up[v][0] = p;
	for(int j = 1;j < LOG; j++) up[v][j] = up[up[v][j-1]][j-1];
	sub[v] = 1;
	int big=-1;
	for(auto to : g[v]){
		if(to != p){
			depth[to] = depth[v]+1;
			dfs(to, v);
			sub[v]+= sub[to];
			if(big == -1 or sub[big] < sub[to]){
				big = to;
			}
		}
	}
	tout[v] = ++T;
	bigchild[v] = big;
}
int upper(int v, int p){
	return (tin[p] <= tin[v] and tout[v] <= tout[p]);
}
void decompose(int v, int head){
	Pos[v] = ++position;
	chain[v] = head;
	if(bigchild[v] != -1){
		decompose(bigchild[v], head);
	}
	for(auto to : g[v]){
		if(to == up[v][0] or to == bigchild[v]) continue;
		decompose(to, to);
	}
}
 
int t[4*N], lazy[4*N];
 
void push(int v, int vl, int vr){
	if(lazy[v] == 0) return;
	t[v]+= (lazy[v] * (vr-vl+1));
	if(vl != vr){
		lazy[v<<1]+= lazy[v];
		lazy[v<<1|1]+= lazy[v];
	}
	lazy[v] = 0;
}
 
void add(int l, int r, int x, int v, int vl, int vr){
	push(v, vl, vr);
	if(l > vr or vl > r) return;
	if(l <= vl and r >= vr){
		lazy[v]+= x;
		push(v, vl, vr);
		return;
	}
	int mid = (vl + vr)>>1;
	add(l, r, x, v<<1, vl, mid);
	add(l, r, x, v<<1|1, mid+1, vr);
	t[v] = t[v<<1] + t[v<<1|1];
}
int get(int pos, int v, int vl, int vr){
	push(v, vl, vr);
	if(vl == vr) return t[v];
	int mid = (vl + vr)>>1;
	if(mid >= pos)  return get(pos, v<<1, vl, mid);
	else return get(pos, v<<1|1, mid+1, vr);
}
 
 
void query(int a, int b, int x){
	for(; chain[a] != chain[b]; ){
		if(depth[b] < depth[a]) swap(a, b);
		add(min(Pos[b], Pos[chain[b]]), max(Pos[b], Pos[chain[b]]), x, 1, 1, n);
		b = up[chain[b]][0];
	}	
	if(depth[b] < depth[a]) swap(a, b);
	add(min(Pos[a], Pos[b]), max(Pos[a], Pos[b]), x, 1, 1, n);
}
 
int lca(int a, int b){
	if(depth[a] > depth[b]) swap(a, b);
	if(upper(a, b)) return a;
	int k =depth[b]-depth[a];
	for(int i = 0;i < LOG; i++){
		if(k&(1LL<<i)){
			b = up[b][i];
		}
	}
	if(a == b) return a;
	for(int i = LOG-1; i >= 0; i--){
		if(up[a][i] != up[b][i]){
			a = up[a][i], b = up[b][i];
		}
	}
	return up[a][0];
}
 
main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
	cin >> n >> m >> k;
	for(int i = 1;i < n; i++){
		int a, b; cin >> a >> b;
		edge.push_back({a, b});
		g[a].push_back(b);
		g[b].push_back(a);
	}	
	dfs(1, 1);
	decompose(1, 1);
	for(int i = 1;i <= m; i++){
		int sz; cin >> sz;
		for(int j = 0;j < sz; j++){
			int idx; cin >> idx;
			ministr[i].push_back(idx);
		}
	}
	vector<int> cnt(n, 0);
	vector<int> ans;
	for(int i = 1;i <= m; i++){
		sort(all(ministr[i]), [&](int A, int B){
			return tin[A] < tin[B];	
		});
		for(int j = 0;j < ministr[i].size(); j++){
			int a = ministr[i][j], b = ministr[i][(j + 1) % (int)ministr[i].size()];
//			cout << a << ' ' << b << '\n';
			int lc = lca(a, b);
			query(a, lc, 1);
			query(b, lc, 1);
			add(Pos[lc], Pos[lc], -2, 1, 1, n);
		}
//		cout << '\n' << '\n';
	}
	for(int i = 0;i < n-1; i++){
		int a = edge[i].ff, b = edge[i].ss;
		if(tin[a] > tin[b]) swap(a, b);
		cnt[i] = get(Pos[b], 1, 1, n);
		if(cnt[i] >=2* k){
			ans.push_back(i + 1);
		}
	}
	sort(all(ans));
	cout << ans.size() << '\n';
	for(int x : ans) cout << x << ' ';
	return 0;
}

Compilation message

railway.cpp:116:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  116 | main(){
      | ^~~~
railway.cpp: In function 'int main()':
railway.cpp:141:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |   for(int j = 0;j < ministr[i].size(); j++){
      |                 ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 24924 KB Output is correct
2 Correct 12 ms 30284 KB Output is correct
3 Correct 11 ms 30180 KB Output is correct
4 Correct 4 ms 24924 KB Output is correct
5 Correct 4 ms 24924 KB Output is correct
6 Correct 11 ms 30680 KB Output is correct
7 Correct 11 ms 30424 KB Output is correct
8 Correct 10 ms 30168 KB Output is correct
9 Correct 11 ms 30300 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 4 ms 24924 KB Output is correct
12 Correct 4 ms 24924 KB Output is correct
13 Correct 4 ms 24924 KB Output is correct
14 Correct 4 ms 24924 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 24924 KB Output is correct
2 Correct 12 ms 30284 KB Output is correct
3 Correct 11 ms 30180 KB Output is correct
4 Correct 4 ms 24924 KB Output is correct
5 Correct 4 ms 24924 KB Output is correct
6 Correct 11 ms 30680 KB Output is correct
7 Correct 11 ms 30424 KB Output is correct
8 Correct 10 ms 30168 KB Output is correct
9 Correct 11 ms 30300 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 4 ms 24924 KB Output is correct
12 Correct 4 ms 24924 KB Output is correct
13 Correct 4 ms 24924 KB Output is correct
14 Correct 4 ms 24924 KB Output is correct
15 Correct 84 ms 31448 KB Output is correct
16 Correct 84 ms 31808 KB Output is correct
17 Correct 85 ms 31948 KB Output is correct
18 Correct 13 ms 32728 KB Output is correct
19 Correct 12 ms 30424 KB Output is correct
20 Correct 95 ms 31812 KB Output is correct
21 Correct 98 ms 31700 KB Output is correct
22 Correct 4 ms 24924 KB Output is correct
23 Correct 12 ms 32308 KB Output is correct
24 Correct 12 ms 32244 KB Output is correct
25 Correct 4 ms 24924 KB Output is correct
26 Correct 4 ms 24924 KB Output is correct
27 Correct 12 ms 30936 KB Output is correct
28 Correct 11 ms 30420 KB Output is correct
29 Correct 11 ms 30424 KB Output is correct
30 Correct 11 ms 30420 KB Output is correct
31 Correct 4 ms 24924 KB Output is correct
32 Correct 4 ms 24924 KB Output is correct
33 Correct 4 ms 24924 KB Output is correct
34 Correct 4 ms 24924 KB Output is correct
35 Correct 4 ms 24924 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 64708 KB Output is correct
2 Correct 4 ms 24924 KB Output is correct
3 Correct 189 ms 65216 KB Output is correct
4 Correct 181 ms 63932 KB Output is correct
5 Correct 202 ms 65508 KB Output is correct
6 Correct 191 ms 66876 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 58116 KB Output is correct
2 Correct 206 ms 54904 KB Output is correct
3 Correct 237 ms 54852 KB Output is correct
4 Correct 295 ms 55124 KB Output is correct
5 Correct 270 ms 55368 KB Output is correct
6 Correct 177 ms 59584 KB Output is correct
7 Correct 169 ms 59096 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 58116 KB Output is correct
2 Correct 206 ms 54904 KB Output is correct
3 Correct 237 ms 54852 KB Output is correct
4 Correct 295 ms 55124 KB Output is correct
5 Correct 270 ms 55368 KB Output is correct
6 Correct 177 ms 59584 KB Output is correct
7 Correct 169 ms 59096 KB Output is correct
8 Correct 198 ms 60036 KB Output is correct
9 Correct 208 ms 60796 KB Output is correct
10 Correct 183 ms 66048 KB Output is correct
11 Correct 173 ms 65928 KB Output is correct
12 Correct 174 ms 55740 KB Output is correct
13 Correct 169 ms 55652 KB Output is correct
14 Correct 241 ms 55892 KB Output is correct
15 Correct 239 ms 56132 KB Output is correct
16 Correct 291 ms 56396 KB Output is correct
17 Correct 277 ms 55588 KB Output is correct
18 Correct 282 ms 55836 KB Output is correct
19 Correct 204 ms 55492 KB Output is correct
20 Correct 174 ms 60292 KB Output is correct
21 Correct 183 ms 61108 KB Output is correct
22 Correct 176 ms 60356 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 24924 KB Output is correct
2 Correct 12 ms 30284 KB Output is correct
3 Correct 11 ms 30180 KB Output is correct
4 Correct 4 ms 24924 KB Output is correct
5 Correct 4 ms 24924 KB Output is correct
6 Correct 11 ms 30680 KB Output is correct
7 Correct 11 ms 30424 KB Output is correct
8 Correct 10 ms 30168 KB Output is correct
9 Correct 11 ms 30300 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 4 ms 24924 KB Output is correct
12 Correct 4 ms 24924 KB Output is correct
13 Correct 4 ms 24924 KB Output is correct
14 Correct 4 ms 24924 KB Output is correct
15 Correct 84 ms 31448 KB Output is correct
16 Correct 84 ms 31808 KB Output is correct
17 Correct 85 ms 31948 KB Output is correct
18 Correct 13 ms 32728 KB Output is correct
19 Correct 12 ms 30424 KB Output is correct
20 Correct 95 ms 31812 KB Output is correct
21 Correct 98 ms 31700 KB Output is correct
22 Correct 4 ms 24924 KB Output is correct
23 Correct 12 ms 32308 KB Output is correct
24 Correct 12 ms 32244 KB Output is correct
25 Correct 4 ms 24924 KB Output is correct
26 Correct 4 ms 24924 KB Output is correct
27 Correct 12 ms 30936 KB Output is correct
28 Correct 11 ms 30420 KB Output is correct
29 Correct 11 ms 30424 KB Output is correct
30 Correct 11 ms 30420 KB Output is correct
31 Correct 4 ms 24924 KB Output is correct
32 Correct 4 ms 24924 KB Output is correct
33 Correct 4 ms 24924 KB Output is correct
34 Correct 4 ms 24924 KB Output is correct
35 Correct 4 ms 24924 KB Output is correct
36 Correct 194 ms 64708 KB Output is correct
37 Correct 4 ms 24924 KB Output is correct
38 Correct 189 ms 65216 KB Output is correct
39 Correct 181 ms 63932 KB Output is correct
40 Correct 202 ms 65508 KB Output is correct
41 Correct 191 ms 66876 KB Output is correct
42 Correct 170 ms 58116 KB Output is correct
43 Correct 206 ms 54904 KB Output is correct
44 Correct 237 ms 54852 KB Output is correct
45 Correct 295 ms 55124 KB Output is correct
46 Correct 270 ms 55368 KB Output is correct
47 Correct 177 ms 59584 KB Output is correct
48 Correct 169 ms 59096 KB Output is correct
49 Correct 198 ms 60036 KB Output is correct
50 Correct 208 ms 60796 KB Output is correct
51 Correct 183 ms 66048 KB Output is correct
52 Correct 173 ms 65928 KB Output is correct
53 Correct 174 ms 55740 KB Output is correct
54 Correct 169 ms 55652 KB Output is correct
55 Correct 241 ms 55892 KB Output is correct
56 Correct 239 ms 56132 KB Output is correct
57 Correct 291 ms 56396 KB Output is correct
58 Correct 277 ms 55588 KB Output is correct
59 Correct 282 ms 55836 KB Output is correct
60 Correct 204 ms 55492 KB Output is correct
61 Correct 174 ms 60292 KB Output is correct
62 Correct 183 ms 61108 KB Output is correct
63 Correct 176 ms 60356 KB Output is correct
64 Correct 188 ms 61328 KB Output is correct
65 Correct 348 ms 57420 KB Output is correct
66 Correct 331 ms 56856 KB Output is correct
67 Correct 277 ms 56868 KB Output is correct
68 Correct 134 ms 55204 KB Output is correct
69 Correct 133 ms 55364 KB Output is correct
70 Correct 196 ms 62016 KB Output is correct
71 Correct 193 ms 60416 KB Output is correct
72 Correct 4 ms 24920 KB Output is correct
73 Correct 11 ms 32216 KB Output is correct
74 Correct 11 ms 30424 KB Output is correct
75 Correct 4 ms 24924 KB Output is correct
76 Correct 4 ms 25016 KB Output is correct
77 Correct 12 ms 30780 KB Output is correct
78 Correct 11 ms 30424 KB Output is correct
79 Correct 10 ms 30168 KB Output is correct
80 Correct 11 ms 30424 KB Output is correct
81 Correct 4 ms 24924 KB Output is correct
82 Correct 4 ms 24920 KB Output is correct
83 Correct 4 ms 24924 KB Output is correct
84 Correct 4 ms 25064 KB Output is correct
85 Correct 4 ms 24924 KB Output is correct
86 Correct 84 ms 31704 KB Output is correct
87 Correct 84 ms 31804 KB Output is correct
88 Correct 84 ms 31804 KB Output is correct
89 Correct 15 ms 31032 KB Output is correct
90 Correct 12 ms 30424 KB Output is correct
91 Correct 101 ms 31832 KB Output is correct
92 Correct 99 ms 31700 KB Output is correct
93 Correct 4 ms 24924 KB Output is correct
94 Correct 195 ms 66524 KB Output is correct
95 Correct 186 ms 65472 KB Output is correct
96 Correct 190 ms 64296 KB Output is correct
97 Correct 200 ms 66240 KB Output is correct
98 Correct 190 ms 66748 KB Output is correct
99 Correct 313 ms 55892 KB Output is correct
100 Correct 289 ms 55636 KB Output is correct
101 Correct 332 ms 56132 KB Output is correct
102 Correct 217 ms 55668 KB Output is correct
103 Correct 169 ms 59364 KB Output is correct
104 Correct 178 ms 60812 KB Output is correct
105 Correct 174 ms 59584 KB Output is correct
106 Correct 193 ms 60860 KB Output is correct
107 Correct 188 ms 60768 KB Output is correct
108 Correct 178 ms 66044 KB Output is correct
109 Correct 169 ms 65984 KB Output is correct
110 Correct 172 ms 55720 KB Output is correct
111 Correct 167 ms 55740 KB Output is correct
112 Correct 243 ms 55784 KB Output is correct
113 Correct 239 ms 55836 KB Output is correct