oj.uz

Submission #503033

# Submission time Handle Problem Language Result Execution time Memory
503033 2022-01-07T03:16:54 Z sumit_kk10 Railway (BOI17_railway) C++17
100 / 100
 176 ms 37052 KB 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL) 
#define ll long long
#define F first 
#define S second
using namespace std;
const int N = 100005, MOD = 1e9 + 7;
vector<ll> graph[N];
ll pre[N], dp[N][20], n, m, s, lvl[N], tin[N], tout[N], timer = 0, u[N], v[N];
 
void dfs(int source, int par, int level){
	dp[source][0] = par;
	lvl[source] = level;
	tin[source] = ++timer;
	for(auto k : graph[source])
		if(k != par)
			dfs(k, source, level + 1);
	tout[source] = timer;
}
 
void init(){
	dfs(1, -1, 0);
	for(int i = 1; i < 20; ++i)
		for(int j = 1; j <= n; ++j)
			if(dp[j][i - 1] != -1)
				dp[j][i] = dp[dp[j][i - 1]][i - 1];
}
 
ll LCA(int u, int v){
	if(lvl[u] > lvl[v]) swap(u, v);
	ll d = lvl[v] - lvl[u];
	while(d){
		int jump = log2(d);
		v = dp[v][jump];
		d -= pow(2, jump);
	}
	if(v == u) 
		return v;
	for(int i = 19; i >= 0; --i){
		if(dp[v][i] != -1 && dp[v][i] != dp[u][i]){
			u = dp[u][i];
			v = dp[v][i];
		}
	}
	return dp[v][0];
}
 
bool cmp(int x, int y){
	return tin[x] < tin[y];
}
 
void edges(int node, int par){
	for(auto k : graph[node]){
		if(k == par) continue;
		edges(k, node);
		pre[node] += pre[k];
	}
}
 
void solve(){
	cin >> n >> m >> s;
	for(int i = 1; i <= n - 1; ++i){
		cin >> u[i] >> v[i];
		graph[u[i]].push_back(v[i]);
		graph[v[i]].push_back(u[i]);
	}
	memset(dp, -1, sizeof dp);
	init();
	while(m--){
		int r;
		cin >> r;
		vector<int> a;
		for(int i = 0; i < r; ++i){
			int x;
			cin >> x;
			a.push_back(x);
		}
		sort(a.begin(), a.end(), cmp);
		a.push_back(a[0]);
		for(int i = 0; i < r; ++i){
			int p = LCA(a[i], a[i + 1]);
			pre[a[i]]++;
			pre[a[i + 1]]++;
			pre[p] -= 2;
		}
	}
	edges(1, 0);
	vector<int> ans;
	for(int i = 1; i <= n - 1; ++i){
		if(lvl[u[i]] > lvl[v[i]])
			swap(u[i], v[i]);
		int x = pre[v[i]];
		if(x >= 2*s)
			ans.push_back(i);
	}
	cout << ans.size() << '\n';
	for(auto k : ans) cout << k << ' ';
}
 
int main() {
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
    	solve();
	return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:104:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  104 |     while(t--)
      |     ^~~~~
railway.cpp:106:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  106 |  return 0;
      |  ^~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 18288 KB Output is correct
2 Correct 14 ms 19268 KB Output is correct
3 Correct 13 ms 19268 KB Output is correct
4 Correct 8 ms 18252 KB Output is correct
5 Correct 8 ms 18252 KB Output is correct
6 Correct 12 ms 19740 KB Output is correct
7 Correct 13 ms 19320 KB Output is correct
8 Correct 13 ms 19192 KB Output is correct
9 Correct 11 ms 19224 KB Output is correct
10 Correct 8 ms 18252 KB Output is correct
11 Correct 10 ms 18292 KB Output is correct
12 Correct 9 ms 18288 KB Output is correct
13 Correct 9 ms 18280 KB Output is correct
14 Correct 8 ms 18284 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 18288 KB Output is correct
2 Correct 14 ms 19268 KB Output is correct
3 Correct 13 ms 19268 KB Output is correct
4 Correct 8 ms 18252 KB Output is correct
5 Correct 8 ms 18252 KB Output is correct
6 Correct 12 ms 19740 KB Output is correct
7 Correct 13 ms 19320 KB Output is correct
8 Correct 13 ms 19192 KB Output is correct
9 Correct 11 ms 19224 KB Output is correct
10 Correct 8 ms 18252 KB Output is correct
11 Correct 10 ms 18292 KB Output is correct
12 Correct 9 ms 18288 KB Output is correct
13 Correct 9 ms 18280 KB Output is correct
14 Correct 8 ms 18284 KB Output is correct
15 Correct 28 ms 19640 KB Output is correct
16 Correct 27 ms 19572 KB Output is correct
17 Correct 25 ms 19652 KB Output is correct
18 Correct 13 ms 19692 KB Output is correct
19 Correct 13 ms 19272 KB Output is correct
20 Correct 25 ms 19824 KB Output is correct
21 Correct 27 ms 19824 KB Output is correct
22 Correct 9 ms 18268 KB Output is correct
23 Correct 12 ms 19276 KB Output is correct
24 Correct 12 ms 19276 KB Output is correct
25 Correct 8 ms 18252 KB Output is correct
26 Correct 8 ms 18304 KB Output is correct
27 Correct 13 ms 19740 KB Output is correct
28 Correct 14 ms 19280 KB Output is correct
29 Correct 11 ms 19276 KB Output is correct
30 Correct 12 ms 19276 KB Output is correct
31 Correct 8 ms 18288 KB Output is correct
32 Correct 8 ms 18252 KB Output is correct
33 Correct 9 ms 18252 KB Output is correct
34 Correct 8 ms 18252 KB Output is correct
35 Correct 8 ms 18252 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 36648 KB Output is correct
2 Correct 8 ms 18252 KB Output is correct
3 Correct 176 ms 36308 KB Output is correct
4 Correct 143 ms 35772 KB Output is correct
5 Correct 143 ms 36580 KB Output is correct
6 Correct 131 ms 37052 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 32268 KB Output is correct
2 Correct 119 ms 28816 KB Output is correct
3 Correct 113 ms 28408 KB Output is correct
4 Correct 102 ms 28520 KB Output is correct
5 Correct 110 ms 28524 KB Output is correct
6 Correct 113 ms 32452 KB Output is correct
7 Correct 117 ms 32384 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 32268 KB Output is correct
2 Correct 119 ms 28816 KB Output is correct
3 Correct 113 ms 28408 KB Output is correct
4 Correct 102 ms 28520 KB Output is correct
5 Correct 110 ms 28524 KB Output is correct
6 Correct 113 ms 32452 KB Output is correct
7 Correct 117 ms 32384 KB Output is correct
8 Correct 128 ms 32376 KB Output is correct
9 Correct 116 ms 32416 KB Output is correct
10 Correct 118 ms 36768 KB Output is correct
11 Correct 144 ms 36684 KB Output is correct
12 Correct 69 ms 28232 KB Output is correct
13 Correct 83 ms 28392 KB Output is correct
14 Correct 109 ms 28392 KB Output is correct
15 Correct 93 ms 28356 KB Output is correct
16 Correct 105 ms 28512 KB Output is correct
17 Correct 118 ms 28660 KB Output is correct
18 Correct 94 ms 28484 KB Output is correct
19 Correct 106 ms 28912 KB Output is correct
20 Correct 117 ms 32632 KB Output is correct
21 Correct 130 ms 32796 KB Output is correct
22 Correct 151 ms 32708 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 18288 KB Output is correct
2 Correct 14 ms 19268 KB Output is correct
3 Correct 13 ms 19268 KB Output is correct
4 Correct 8 ms 18252 KB Output is correct
5 Correct 8 ms 18252 KB Output is correct
6 Correct 12 ms 19740 KB Output is correct
7 Correct 13 ms 19320 KB Output is correct
8 Correct 13 ms 19192 KB Output is correct
9 Correct 11 ms 19224 KB Output is correct
10 Correct 8 ms 18252 KB Output is correct
11 Correct 10 ms 18292 KB Output is correct
12 Correct 9 ms 18288 KB Output is correct
13 Correct 9 ms 18280 KB Output is correct
14 Correct 8 ms 18284 KB Output is correct
15 Correct 28 ms 19640 KB Output is correct
16 Correct 27 ms 19572 KB Output is correct
17 Correct 25 ms 19652 KB Output is correct
18 Correct 13 ms 19692 KB Output is correct
19 Correct 13 ms 19272 KB Output is correct
20 Correct 25 ms 19824 KB Output is correct
21 Correct 27 ms 19824 KB Output is correct
22 Correct 9 ms 18268 KB Output is correct
23 Correct 12 ms 19276 KB Output is correct
24 Correct 12 ms 19276 KB Output is correct
25 Correct 8 ms 18252 KB Output is correct
26 Correct 8 ms 18304 KB Output is correct
27 Correct 13 ms 19740 KB Output is correct
28 Correct 14 ms 19280 KB Output is correct
29 Correct 11 ms 19276 KB Output is correct
30 Correct 12 ms 19276 KB Output is correct
31 Correct 8 ms 18288 KB Output is correct
32 Correct 8 ms 18252 KB Output is correct
33 Correct 9 ms 18252 KB Output is correct
34 Correct 8 ms 18252 KB Output is correct
35 Correct 8 ms 18252 KB Output is correct
36 Correct 143 ms 36648 KB Output is correct
37 Correct 8 ms 18252 KB Output is correct
38 Correct 176 ms 36308 KB Output is correct
39 Correct 143 ms 35772 KB Output is correct
40 Correct 143 ms 36580 KB Output is correct
41 Correct 131 ms 37052 KB Output is correct
42 Correct 143 ms 32268 KB Output is correct
43 Correct 119 ms 28816 KB Output is correct
44 Correct 113 ms 28408 KB Output is correct
45 Correct 102 ms 28520 KB Output is correct
46 Correct 110 ms 28524 KB Output is correct
47 Correct 113 ms 32452 KB Output is correct
48 Correct 117 ms 32384 KB Output is correct
49 Correct 128 ms 32376 KB Output is correct
50 Correct 116 ms 32416 KB Output is correct
51 Correct 118 ms 36768 KB Output is correct
52 Correct 144 ms 36684 KB Output is correct
53 Correct 69 ms 28232 KB Output is correct
54 Correct 83 ms 28392 KB Output is correct
55 Correct 109 ms 28392 KB Output is correct
56 Correct 93 ms 28356 KB Output is correct
57 Correct 105 ms 28512 KB Output is correct
58 Correct 118 ms 28660 KB Output is correct
59 Correct 94 ms 28484 KB Output is correct
60 Correct 106 ms 28912 KB Output is correct
61 Correct 117 ms 32632 KB Output is correct
62 Correct 130 ms 32796 KB Output is correct
63 Correct 151 ms 32708 KB Output is correct
64 Correct 124 ms 32600 KB Output is correct
65 Correct 113 ms 28508 KB Output is correct
66 Correct 104 ms 28392 KB Output is correct
67 Correct 101 ms 28404 KB Output is correct
68 Correct 62 ms 28184 KB Output is correct
69 Correct 80 ms 28140 KB Output is correct
70 Correct 124 ms 32884 KB Output is correct
71 Correct 117 ms 32304 KB Output is correct
72 Correct 8 ms 18268 KB Output is correct
73 Correct 17 ms 19276 KB Output is correct
74 Correct 11 ms 19212 KB Output is correct
75 Correct 7 ms 18252 KB Output is correct
76 Correct 8 ms 18288 KB Output is correct
77 Correct 15 ms 19748 KB Output is correct
78 Correct 11 ms 19276 KB Output is correct
79 Correct 11 ms 19220 KB Output is correct
80 Correct 10 ms 19276 KB Output is correct
81 Correct 8 ms 18292 KB Output is correct
82 Correct 7 ms 18252 KB Output is correct
83 Correct 10 ms 18252 KB Output is correct
84 Correct 9 ms 18276 KB Output is correct
85 Correct 7 ms 18252 KB Output is correct
86 Correct 32 ms 19636 KB Output is correct
87 Correct 25 ms 19692 KB Output is correct
88 Correct 31 ms 19696 KB Output is correct
89 Correct 13 ms 19732 KB Output is correct
90 Correct 12 ms 19360 KB Output is correct
91 Correct 23 ms 19756 KB Output is correct
92 Correct 26 ms 19700 KB Output is correct
93 Correct 9 ms 18252 KB Output is correct
94 Correct 149 ms 36688 KB Output is correct
95 Correct 151 ms 36332 KB Output is correct
96 Correct 142 ms 35748 KB Output is correct
97 Correct 137 ms 36556 KB Output is correct
98 Correct 111 ms 37048 KB Output is correct
99 Correct 106 ms 28508 KB Output is correct
100 Correct 100 ms 28516 KB Output is correct
101 Correct 95 ms 28520 KB Output is correct
102 Correct 139 ms 28840 KB Output is correct
103 Correct 116 ms 32372 KB Output is correct
104 Correct 118 ms 32748 KB Output is correct
105 Correct 125 ms 32404 KB Output is correct
106 Correct 121 ms 32648 KB Output is correct
107 Correct 114 ms 32324 KB Output is correct
108 Correct 111 ms 36684 KB Output is correct
109 Correct 115 ms 36828 KB Output is correct
110 Correct 68 ms 28228 KB Output is correct
111 Correct 68 ms 28268 KB Output is correct
112 Correct 91 ms 28484 KB Output is correct
113 Correct 86 ms 28440 KB Output is correct