oj.uz

Submission #171258

# Submission time Handle Problem Language Result Execution time Memory
171258 2019-12-28T06:13:51 Z alishahali1382 Railway (BOI17_railway) C++14
100 / 100
 190 ms 23792 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010, LOG=18;

int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN];
int par[MAXN][LOG], h[MAXN];
int stt[MAXN], fnt[MAXN], timer=1;
int sum[MAXN];
int parid[MAXN];
vector<pii> G[MAXN];

void dfs1(int node){
	stt[node]=timer++;
	for (int i=1; i<LOG; i++) par[node][i]=par[par[node][i-1]][i-1];
	for (pii p:G[node]) if (p.first!=par[node][0]){
		par[p.first][0]=node;
		parid[p.first]=p.second;
		dfs1(p.first);
	}
	fnt[node]=timer;
}

inline bool is_par(int u, int v){
	return stt[u]<=stt[v] && fnt[v]<=fnt[u];
}

int Lca(int x, int y){
	if (stt[x]>stt[y]) swap(x, y);
	if (fnt[y]<=fnt[x]) return x;
	for (int i=LOG-1; i>=0; i--) if (!is_par(par[x][i], y)) x=par[x][i];
	return par[x][0];
}

int dfs2(int node){
	for (pii p:G[node]) if (p.first!=par[node][0]) sum[node]+=dfs2(p.first);
	return sum[node];
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m>>k;
	for (int i=1; i<n; i++){
		cin>>u>>v;
		G[u].pb({v, i});
		G[v].pb({u, i});
	}
	par[1][0]=1;
	dfs1(1);
	while (m--){
		cin>>t;
		for (int i=0; i<t; i++) cin>>A[i];
		sort(A, A+t, [](int i, int j){
			return stt[i]<stt[j];
		});
		for (int i=0; i<t; i++){
			int x=A[i], y=A[(i+1)%t], lca=Lca(x, y);
			//cerr<<"lca : "<<x<<' '<<y<<' '<<lca<<endl;
			sum[x]++;
			sum[y]++;
			sum[lca]-=2;
		}
	}
	dfs2(1);
	//for (int i=2; i<=n; i++) debug2(i, sum[i]/2)
	
	vector<int> out;
	for (int i=2; i<=n; i++) if (sum[i]>=2*k) out.pb(parid[i]);
	sort(all(out));
	cout<<out.size()<<'\n';
	for (int i:out) cout<<i<<' ';
	
	return 0;
}
/*
14 8 0
1 2
2 3
2 7
3 4
3 5
3 6
1 8
8 9
9 11
11 12
11 13
9 10
9 14

5 3 13 9 1 4
5 7 6 9 14 5
2 12 13
2 7 9
3 10 12 13
3 6 5 4
3 7 3 9
3 10 13 5

*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2832 KB Output is correct
2 Correct 12 ms 4088 KB Output is correct
3 Correct 10 ms 4004 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 7 ms 2680 KB Output is correct
6 Correct 12 ms 4472 KB Output is correct
7 Correct 12 ms 4060 KB Output is correct
8 Correct 9 ms 4060 KB Output is correct
9 Correct 18 ms 4088 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 5 ms 2680 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2832 KB Output is correct
2 Correct 12 ms 4088 KB Output is correct
3 Correct 10 ms 4004 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 7 ms 2680 KB Output is correct
6 Correct 12 ms 4472 KB Output is correct
7 Correct 12 ms 4060 KB Output is correct
8 Correct 9 ms 4060 KB Output is correct
9 Correct 18 ms 4088 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 5 ms 2680 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct
15 Correct 35 ms 4472 KB Output is correct
16 Correct 42 ms 4472 KB Output is correct
17 Correct 39 ms 4572 KB Output is correct
18 Correct 12 ms 4492 KB Output is correct
19 Correct 7 ms 4088 KB Output is correct
20 Correct 36 ms 4600 KB Output is correct
21 Correct 40 ms 4600 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 10 ms 4088 KB Output is correct
24 Correct 10 ms 4088 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 11 ms 4472 KB Output is correct
28 Correct 11 ms 4088 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 12 ms 4112 KB Output is correct
31 Correct 5 ms 2680 KB Output is correct
32 Correct 5 ms 2680 KB Output is correct
33 Correct 5 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 23404 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 83 ms 23156 KB Output is correct
4 Correct 77 ms 22524 KB Output is correct
5 Correct 84 ms 23468 KB Output is correct
6 Correct 92 ms 23792 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 19912 KB Output is correct
2 Correct 128 ms 17272 KB Output is correct
3 Correct 135 ms 16888 KB Output is correct
4 Correct 130 ms 16784 KB Output is correct
5 Correct 136 ms 16760 KB Output is correct
6 Correct 97 ms 20080 KB Output is correct
7 Correct 102 ms 19960 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 19912 KB Output is correct
2 Correct 128 ms 17272 KB Output is correct
3 Correct 135 ms 16888 KB Output is correct
4 Correct 130 ms 16784 KB Output is correct
5 Correct 136 ms 16760 KB Output is correct
6 Correct 97 ms 20080 KB Output is correct
7 Correct 102 ms 19960 KB Output is correct
8 Correct 133 ms 20088 KB Output is correct
9 Correct 125 ms 20088 KB Output is correct
10 Correct 111 ms 23700 KB Output is correct
11 Correct 87 ms 23440 KB Output is correct
12 Correct 97 ms 16556 KB Output is correct
13 Correct 120 ms 16760 KB Output is correct
14 Correct 165 ms 16800 KB Output is correct
15 Correct 138 ms 16704 KB Output is correct
16 Correct 132 ms 16888 KB Output is correct
17 Correct 127 ms 16872 KB Output is correct
18 Correct 131 ms 16888 KB Output is correct
19 Correct 126 ms 17144 KB Output is correct
20 Correct 124 ms 20220 KB Output is correct
21 Correct 133 ms 20468 KB Output is correct
22 Correct 102 ms 20220 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2832 KB Output is correct
2 Correct 12 ms 4088 KB Output is correct
3 Correct 10 ms 4004 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 7 ms 2680 KB Output is correct
6 Correct 12 ms 4472 KB Output is correct
7 Correct 12 ms 4060 KB Output is correct
8 Correct 9 ms 4060 KB Output is correct
9 Correct 18 ms 4088 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 5 ms 2680 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct
15 Correct 35 ms 4472 KB Output is correct
16 Correct 42 ms 4472 KB Output is correct
17 Correct 39 ms 4572 KB Output is correct
18 Correct 12 ms 4492 KB Output is correct
19 Correct 7 ms 4088 KB Output is correct
20 Correct 36 ms 4600 KB Output is correct
21 Correct 40 ms 4600 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 10 ms 4088 KB Output is correct
24 Correct 10 ms 4088 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 11 ms 4472 KB Output is correct
28 Correct 11 ms 4088 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 12 ms 4112 KB Output is correct
31 Correct 5 ms 2680 KB Output is correct
32 Correct 5 ms 2680 KB Output is correct
33 Correct 5 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct
36 Correct 89 ms 23404 KB Output is correct
37 Correct 3 ms 2680 KB Output is correct
38 Correct 83 ms 23156 KB Output is correct
39 Correct 77 ms 22524 KB Output is correct
40 Correct 84 ms 23468 KB Output is correct
41 Correct 92 ms 23792 KB Output is correct
42 Correct 104 ms 19912 KB Output is correct
43 Correct 128 ms 17272 KB Output is correct
44 Correct 135 ms 16888 KB Output is correct
45 Correct 130 ms 16784 KB Output is correct
46 Correct 136 ms 16760 KB Output is correct
47 Correct 97 ms 20080 KB Output is correct
48 Correct 102 ms 19960 KB Output is correct
49 Correct 133 ms 20088 KB Output is correct
50 Correct 125 ms 20088 KB Output is correct
51 Correct 111 ms 23700 KB Output is correct
52 Correct 87 ms 23440 KB Output is correct
53 Correct 97 ms 16556 KB Output is correct
54 Correct 120 ms 16760 KB Output is correct
55 Correct 165 ms 16800 KB Output is correct
56 Correct 138 ms 16704 KB Output is correct
57 Correct 132 ms 16888 KB Output is correct
58 Correct 127 ms 16872 KB Output is correct
59 Correct 131 ms 16888 KB Output is correct
60 Correct 126 ms 17144 KB Output is correct
61 Correct 124 ms 20220 KB Output is correct
62 Correct 133 ms 20468 KB Output is correct
63 Correct 102 ms 20220 KB Output is correct
64 Correct 117 ms 20204 KB Output is correct
65 Correct 164 ms 16888 KB Output is correct
66 Correct 190 ms 16896 KB Output is correct
67 Correct 141 ms 16704 KB Output is correct
68 Correct 94 ms 16504 KB Output is correct
69 Correct 102 ms 16548 KB Output is correct
70 Correct 114 ms 20596 KB Output is correct
71 Correct 126 ms 19832 KB Output is correct
72 Correct 4 ms 2680 KB Output is correct
73 Correct 11 ms 4088 KB Output is correct
74 Correct 10 ms 4092 KB Output is correct
75 Correct 4 ms 2680 KB Output is correct
76 Correct 3 ms 2708 KB Output is correct
77 Correct 10 ms 4472 KB Output is correct
78 Correct 11 ms 4088 KB Output is correct
79 Correct 9 ms 4088 KB Output is correct
80 Correct 13 ms 4088 KB Output is correct
81 Correct 5 ms 2680 KB Output is correct
82 Correct 4 ms 2680 KB Output is correct
83 Correct 2 ms 2680 KB Output is correct
84 Correct 4 ms 2680 KB Output is correct
85 Correct 5 ms 2684 KB Output is correct
86 Correct 35 ms 4472 KB Output is correct
87 Correct 35 ms 4472 KB Output is correct
88 Correct 34 ms 4472 KB Output is correct
89 Correct 13 ms 4472 KB Output is correct
90 Correct 17 ms 4088 KB Output is correct
91 Correct 32 ms 4728 KB Output is correct
92 Correct 38 ms 4472 KB Output is correct
93 Correct 4 ms 2680 KB Output is correct
94 Correct 87 ms 23408 KB Output is correct
95 Correct 81 ms 23156 KB Output is correct
96 Correct 86 ms 22648 KB Output is correct
97 Correct 86 ms 23528 KB Output is correct
98 Correct 89 ms 23764 KB Output is correct
99 Correct 156 ms 16928 KB Output is correct
100 Correct 128 ms 16760 KB Output is correct
101 Correct 133 ms 16820 KB Output is correct
102 Correct 135 ms 17112 KB Output is correct
103 Correct 104 ms 19960 KB Output is correct
104 Correct 106 ms 20356 KB Output is correct
105 Correct 105 ms 19936 KB Output is correct
106 Correct 129 ms 20216 KB Output is correct
107 Correct 123 ms 19960 KB Output is correct
108 Correct 85 ms 23536 KB Output is correct
109 Correct 87 ms 23468 KB Output is correct
110 Correct 104 ms 16632 KB Output is correct
111 Correct 101 ms 16604 KB Output is correct
112 Correct 132 ms 16740 KB Output is correct
113 Correct 149 ms 16760 KB Output is correct