oj.uz

Submission #689336

# Submission time Handle Problem Language Result Execution time Memory
689336 2023-01-28T08:57:06 Z sudheerays123 Railway (BOI17_railway) C++17
100 / 100
 146 ms 39748 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 1e5+5 , INF = 1e18 , MOD = 1e9+7;

vector<ll> adj[N] , level(N) , tin(N);
ll timer = 0;
vector<vector<ll>> up(N,vector<ll>(log2(N)+5));

void dfs1(ll s , ll p){

	timer++;
	tin[s] = timer;

	for(auto u : adj[s]){
		if(u == p) continue;

		level[u] = level[s]+1;
		up[u][0] = s;
		for(ll i = 1; i <= log2(N); i++) up[u][i] = up[up[u][i-1]][i-1];

		dfs1(u,s);
	}
}

ll jump(ll a , ll d){
	for(ll i = 0; i <= log2(N); i++){
		if(d&(1ll<<i)){
			a = up[a][i];
		}
	}

	return a;
}

ll lca(ll a , ll b){

	if(level[a] > level[b]) swap(a,b);
	b = jump(b,level[b]-level[a]);

	if(a == b) return a;

	for(ll i = log2(N); i >= 0; i--){
		if(up[a][i] != up[b][i]){

			a = up[a][i];
			b = up[b][i];
		}
	}

	return up[a][0];
}

bool comp(ll a , ll b){
	return tin[a] < tin[b];
}

vector<ll> cnt(N),sum(N);

void dfs2(ll s , ll p){

	sum[s] = cnt[s];
	for(auto u : adj[s]){
		if(u == p) continue;
		dfs2(u,s);
		sum[s] += sum[u];
	}
}

void solve(){

	ll n,m,k;
	cin >> n >> m >> k;

	vector<tuple<ll,ll,ll>> edge;

	for(ll i = 1; i < n; i++){
		ll a,b;
		cin >> a >> b;

		adj[a].push_back(b);
		adj[b].push_back(a);

		edge.push_back(make_tuple(a,b,i));
	}

	level[1] = 0;
	for(ll i = 0; i <= log2(N); i++) up[1][i] = 0;
	dfs1(1,0);

	for(ll i = 1; i <= m; i++){
		ll s;
		cin >> s;

		vector<ll> node;
		for(ll j = 1; j <= s; j++){
			ll x;
			cin >> x;

			node.push_back(x);
		}

		sort(node.begin(),node.end(),comp);

		node.push_back(node[0]);

		for(ll i = 1; i <= s; i++){
			ll a = node[i-1];
			ll b = node[i];
			ll l = lca(a,b);

			cnt[a]++;
			cnt[b]++;
			cnt[l] -= 2;
		}
	}

	dfs2(1,0);

	vector<ll> ans;

	for(auto u : edge){
		ll a,b,ind;
		tie(a,b,ind) = u;

		if(level[a] > level[b]) swap(a,b);
		ll cur = sum[b];
		cur /= 2;

		if(cur >= k){
			ans.push_back(ind);
		}
	}

	cout << ans.size() << "\n";
	for(auto u : ans) cout << u << " ";
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25392 KB Output is correct
2 Correct 21 ms 26196 KB Output is correct
3 Correct 21 ms 26200 KB Output is correct
4 Correct 16 ms 25396 KB Output is correct
5 Correct 19 ms 25392 KB Output is correct
6 Correct 21 ms 26492 KB Output is correct
7 Correct 21 ms 26136 KB Output is correct
8 Correct 20 ms 26172 KB Output is correct
9 Correct 23 ms 26196 KB Output is correct
10 Correct 20 ms 25300 KB Output is correct
11 Correct 17 ms 25364 KB Output is correct
12 Correct 15 ms 25300 KB Output is correct
13 Correct 21 ms 25312 KB Output is correct
14 Correct 18 ms 25300 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25392 KB Output is correct
2 Correct 21 ms 26196 KB Output is correct
3 Correct 21 ms 26200 KB Output is correct
4 Correct 16 ms 25396 KB Output is correct
5 Correct 19 ms 25392 KB Output is correct
6 Correct 21 ms 26492 KB Output is correct
7 Correct 21 ms 26136 KB Output is correct
8 Correct 20 ms 26172 KB Output is correct
9 Correct 23 ms 26196 KB Output is correct
10 Correct 20 ms 25300 KB Output is correct
11 Correct 17 ms 25364 KB Output is correct
12 Correct 15 ms 25300 KB Output is correct
13 Correct 21 ms 25312 KB Output is correct
14 Correct 18 ms 25300 KB Output is correct
15 Correct 34 ms 26220 KB Output is correct
16 Correct 34 ms 26228 KB Output is correct
17 Correct 36 ms 26284 KB Output is correct
18 Correct 23 ms 26600 KB Output is correct
19 Correct 20 ms 26204 KB Output is correct
20 Correct 33 ms 26376 KB Output is correct
21 Correct 37 ms 26216 KB Output is correct
22 Correct 16 ms 25328 KB Output is correct
23 Correct 21 ms 26108 KB Output is correct
24 Correct 21 ms 26108 KB Output is correct
25 Correct 16 ms 25276 KB Output is correct
26 Correct 16 ms 25300 KB Output is correct
27 Correct 28 ms 26512 KB Output is correct
28 Correct 20 ms 26140 KB Output is correct
29 Correct 21 ms 26196 KB Output is correct
30 Correct 21 ms 26136 KB Output is correct
31 Correct 16 ms 25316 KB Output is correct
32 Correct 16 ms 25300 KB Output is correct
33 Correct 18 ms 25300 KB Output is correct
34 Correct 16 ms 25300 KB Output is correct
35 Correct 20 ms 25364 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 39400 KB Output is correct
2 Correct 16 ms 25300 KB Output is correct
3 Correct 144 ms 38492 KB Output is correct
4 Correct 121 ms 37292 KB Output is correct
5 Correct 126 ms 39520 KB Output is correct
6 Correct 95 ms 39616 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 34908 KB Output is correct
2 Correct 116 ms 31960 KB Output is correct
3 Correct 131 ms 31668 KB Output is correct
4 Correct 119 ms 31612 KB Output is correct
5 Correct 123 ms 31612 KB Output is correct
6 Correct 96 ms 34940 KB Output is correct
7 Correct 98 ms 34760 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 34908 KB Output is correct
2 Correct 116 ms 31960 KB Output is correct
3 Correct 131 ms 31668 KB Output is correct
4 Correct 119 ms 31612 KB Output is correct
5 Correct 123 ms 31612 KB Output is correct
6 Correct 96 ms 34940 KB Output is correct
7 Correct 98 ms 34760 KB Output is correct
8 Correct 123 ms 35016 KB Output is correct
9 Correct 116 ms 35028 KB Output is correct
10 Correct 114 ms 39664 KB Output is correct
11 Correct 98 ms 39592 KB Output is correct
12 Correct 100 ms 31892 KB Output is correct
13 Correct 107 ms 31848 KB Output is correct
14 Correct 130 ms 31624 KB Output is correct
15 Correct 125 ms 31616 KB Output is correct
16 Correct 130 ms 31664 KB Output is correct
17 Correct 120 ms 31612 KB Output is correct
18 Correct 131 ms 31692 KB Output is correct
19 Correct 111 ms 31976 KB Output is correct
20 Correct 121 ms 35284 KB Output is correct
21 Correct 103 ms 35700 KB Output is correct
22 Correct 124 ms 35344 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25392 KB Output is correct
2 Correct 21 ms 26196 KB Output is correct
3 Correct 21 ms 26200 KB Output is correct
4 Correct 16 ms 25396 KB Output is correct
5 Correct 19 ms 25392 KB Output is correct
6 Correct 21 ms 26492 KB Output is correct
7 Correct 21 ms 26136 KB Output is correct
8 Correct 20 ms 26172 KB Output is correct
9 Correct 23 ms 26196 KB Output is correct
10 Correct 20 ms 25300 KB Output is correct
11 Correct 17 ms 25364 KB Output is correct
12 Correct 15 ms 25300 KB Output is correct
13 Correct 21 ms 25312 KB Output is correct
14 Correct 18 ms 25300 KB Output is correct
15 Correct 34 ms 26220 KB Output is correct
16 Correct 34 ms 26228 KB Output is correct
17 Correct 36 ms 26284 KB Output is correct
18 Correct 23 ms 26600 KB Output is correct
19 Correct 20 ms 26204 KB Output is correct
20 Correct 33 ms 26376 KB Output is correct
21 Correct 37 ms 26216 KB Output is correct
22 Correct 16 ms 25328 KB Output is correct
23 Correct 21 ms 26108 KB Output is correct
24 Correct 21 ms 26108 KB Output is correct
25 Correct 16 ms 25276 KB Output is correct
26 Correct 16 ms 25300 KB Output is correct
27 Correct 28 ms 26512 KB Output is correct
28 Correct 20 ms 26140 KB Output is correct
29 Correct 21 ms 26196 KB Output is correct
30 Correct 21 ms 26136 KB Output is correct
31 Correct 16 ms 25316 KB Output is correct
32 Correct 16 ms 25300 KB Output is correct
33 Correct 18 ms 25300 KB Output is correct
34 Correct 16 ms 25300 KB Output is correct
35 Correct 20 ms 25364 KB Output is correct
36 Correct 136 ms 39400 KB Output is correct
37 Correct 16 ms 25300 KB Output is correct
38 Correct 144 ms 38492 KB Output is correct
39 Correct 121 ms 37292 KB Output is correct
40 Correct 126 ms 39520 KB Output is correct
41 Correct 95 ms 39616 KB Output is correct
42 Correct 100 ms 34908 KB Output is correct
43 Correct 116 ms 31960 KB Output is correct
44 Correct 131 ms 31668 KB Output is correct
45 Correct 119 ms 31612 KB Output is correct
46 Correct 123 ms 31612 KB Output is correct
47 Correct 96 ms 34940 KB Output is correct
48 Correct 98 ms 34760 KB Output is correct
49 Correct 123 ms 35016 KB Output is correct
50 Correct 116 ms 35028 KB Output is correct
51 Correct 114 ms 39664 KB Output is correct
52 Correct 98 ms 39592 KB Output is correct
53 Correct 100 ms 31892 KB Output is correct
54 Correct 107 ms 31848 KB Output is correct
55 Correct 130 ms 31624 KB Output is correct
56 Correct 125 ms 31616 KB Output is correct
57 Correct 130 ms 31664 KB Output is correct
58 Correct 120 ms 31612 KB Output is correct
59 Correct 131 ms 31692 KB Output is correct
60 Correct 111 ms 31976 KB Output is correct
61 Correct 121 ms 35284 KB Output is correct
62 Correct 103 ms 35700 KB Output is correct
63 Correct 124 ms 35344 KB Output is correct
64 Correct 110 ms 35232 KB Output is correct
65 Correct 137 ms 31716 KB Output is correct
66 Correct 146 ms 31656 KB Output is correct
67 Correct 138 ms 31844 KB Output is correct
68 Correct 101 ms 32120 KB Output is correct
69 Correct 96 ms 32040 KB Output is correct
70 Correct 119 ms 35844 KB Output is correct
71 Correct 112 ms 34676 KB Output is correct
72 Correct 16 ms 25428 KB Output is correct
73 Correct 24 ms 26104 KB Output is correct
74 Correct 20 ms 26196 KB Output is correct
75 Correct 16 ms 25368 KB Output is correct
76 Correct 16 ms 25396 KB Output is correct
77 Correct 21 ms 26512 KB Output is correct
78 Correct 20 ms 26180 KB Output is correct
79 Correct 19 ms 26120 KB Output is correct
80 Correct 21 ms 26120 KB Output is correct
81 Correct 16 ms 25400 KB Output is correct
82 Correct 18 ms 25348 KB Output is correct
83 Correct 18 ms 25308 KB Output is correct
84 Correct 15 ms 25356 KB Output is correct
85 Correct 16 ms 25400 KB Output is correct
86 Correct 36 ms 26200 KB Output is correct
87 Correct 36 ms 26308 KB Output is correct
88 Correct 34 ms 26376 KB Output is correct
89 Correct 21 ms 26440 KB Output is correct
90 Correct 20 ms 26160 KB Output is correct
91 Correct 34 ms 26376 KB Output is correct
92 Correct 35 ms 26180 KB Output is correct
93 Correct 20 ms 25288 KB Output is correct
94 Correct 145 ms 39404 KB Output is correct
95 Correct 131 ms 38496 KB Output is correct
96 Correct 139 ms 37268 KB Output is correct
97 Correct 124 ms 39524 KB Output is correct
98 Correct 98 ms 39644 KB Output is correct
99 Correct 134 ms 31608 KB Output is correct
100 Correct 116 ms 31700 KB Output is correct
101 Correct 135 ms 31608 KB Output is correct
102 Correct 126 ms 31952 KB Output is correct
103 Correct 103 ms 34792 KB Output is correct
104 Correct 96 ms 35600 KB Output is correct
105 Correct 112 ms 34704 KB Output is correct
106 Correct 119 ms 35228 KB Output is correct
107 Correct 115 ms 34968 KB Output is correct
108 Correct 102 ms 39668 KB Output is correct
109 Correct 101 ms 39748 KB Output is correct
110 Correct 100 ms 31952 KB Output is correct
111 Correct 104 ms 31948 KB Output is correct
112 Correct 134 ms 31636 KB Output is correct
113 Correct 114 ms 31680 KB Output is correct