oj.uz

Submission #310770

# Submission time Handle Problem Language Result Execution time Memory
310770 2020-10-07T21:04:46 Z eggag32 Railway (BOI17_railway) C++17
100 / 100
 263 ms 42352 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
const int mxN = 1e5 + 5;

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int n, m, k;
vi g[mxN];
vi ans;
vector<vi> up;
int st[mxN], fin[mxN], sta[mxN];
int num = 0, l = 1;

void dfs(int cur, int prev = 0){
	st[cur] = num++;
	up[cur][0] = prev;
	repn(i, 1, l + 1) up[cur][i] = up[up[cur][i - 1]][i - 1];
	for(int x : g[cur]) if(x != prev) dfs(x, cur);
	fin[cur] = num++;
}

bool upper(int a, int b){
	return st[a] <= st[b] && fin[a] >= fin[b];
}

int lca(int a, int b){
	if(upper(a, b)) return a;
	if(upper(b, a)) return b;
	for(int i = l; i >= 0; i--) if(!upper(up[a][i], b)) a = up[a][i];
	return up[a][0];
}

map<pi, int> ind;

void dfs1(int cur, int prev){
	for(int x : g[cur]) if(x != prev){
		dfs1(x, cur);
		sta[cur] += sta[x];
	}
	if(sta[cur] >= (2 * k) && prev != -1) ans.pb(ind[mp(cur, prev)]);
}

bool cmp(int a, int b){
	return st[a] > st[b];
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	cin >> n >> m >> k;
	rep(i, n - 1){
		int a, b;
		cin >> a >> b;
		a--, b--;
		ind[mp(a, b)] = ind[mp(b, a)] = i;
		g[a].pb(b);
		g[b].pb(a);
	}
	up.resize(n + 1);
	while((1 << l) <= n) l++;
	rep(i, n) up[i].resize(l + 1);
	dfs(0);
	rep(i, m){
		int s;
		cin >> s;
		int lc;
		vi nw(s, 0);
		map<int, int> p;
		rep(j, s){
			cin >> nw[j];
			nw[j]--;
			p[nw[j]] = 1;
			if(!j) lc = nw[j];
			else lc = lca(lc, nw[j]);
		}
		sort(all(nw), cmp);
		rep(j, s){
			int a = nw[j], b = nw[(j + 1) % s];
			int c = lca(a, b);
			sta[a]++, sta[b]++;
			sta[c]-=2;
		}
	}
	dfs1(0, -1);
	cout << (int)(ans.size()) << endl;
	sort(all(ans));
	for(int x : ans) cout << x + 1 << " ";
	cout << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 14 ms 5504 KB Output is correct
3 Correct 14 ms 5504 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 14 ms 6016 KB Output is correct
7 Correct 14 ms 5632 KB Output is correct
8 Correct 11 ms 5504 KB Output is correct
9 Correct 13 ms 5504 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 14 ms 5504 KB Output is correct
3 Correct 14 ms 5504 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 14 ms 6016 KB Output is correct
7 Correct 14 ms 5632 KB Output is correct
8 Correct 11 ms 5504 KB Output is correct
9 Correct 13 ms 5504 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 34 ms 5888 KB Output is correct
16 Correct 36 ms 5888 KB Output is correct
17 Correct 37 ms 6008 KB Output is correct
18 Correct 14 ms 6016 KB Output is correct
19 Correct 16 ms 5632 KB Output is correct
20 Correct 37 ms 6136 KB Output is correct
21 Correct 37 ms 6016 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 14 ms 5504 KB Output is correct
24 Correct 14 ms 5504 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 14 ms 6100 KB Output is correct
28 Correct 14 ms 5632 KB Output is correct
29 Correct 12 ms 5504 KB Output is correct
30 Correct 13 ms 5504 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 40596 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 143 ms 40316 KB Output is correct
4 Correct 133 ms 39672 KB Output is correct
5 Correct 149 ms 40688 KB Output is correct
6 Correct 161 ms 40948 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 34936 KB Output is correct
2 Correct 243 ms 30584 KB Output is correct
3 Correct 249 ms 30200 KB Output is correct
4 Correct 245 ms 30200 KB Output is correct
5 Correct 244 ms 30200 KB Output is correct
6 Correct 197 ms 34812 KB Output is correct
7 Correct 199 ms 34824 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 34936 KB Output is correct
2 Correct 243 ms 30584 KB Output is correct
3 Correct 249 ms 30200 KB Output is correct
4 Correct 245 ms 30200 KB Output is correct
5 Correct 244 ms 30200 KB Output is correct
6 Correct 197 ms 34812 KB Output is correct
7 Correct 199 ms 34824 KB Output is correct
8 Correct 211 ms 34852 KB Output is correct
9 Correct 208 ms 36344 KB Output is correct
10 Correct 153 ms 41968 KB Output is correct
11 Correct 153 ms 41840 KB Output is correct
12 Correct 185 ms 31608 KB Output is correct
13 Correct 182 ms 31480 KB Output is correct
14 Correct 241 ms 31480 KB Output is correct
15 Correct 258 ms 31616 KB Output is correct
16 Correct 256 ms 31736 KB Output is correct
17 Correct 240 ms 31608 KB Output is correct
18 Correct 249 ms 31612 KB Output is correct
19 Correct 243 ms 32236 KB Output is correct
20 Correct 193 ms 36600 KB Output is correct
21 Correct 191 ms 36724 KB Output is correct
22 Correct 195 ms 36600 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 14 ms 5504 KB Output is correct
3 Correct 14 ms 5504 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 14 ms 6016 KB Output is correct
7 Correct 14 ms 5632 KB Output is correct
8 Correct 11 ms 5504 KB Output is correct
9 Correct 13 ms 5504 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 34 ms 5888 KB Output is correct
16 Correct 36 ms 5888 KB Output is correct
17 Correct 37 ms 6008 KB Output is correct
18 Correct 14 ms 6016 KB Output is correct
19 Correct 16 ms 5632 KB Output is correct
20 Correct 37 ms 6136 KB Output is correct
21 Correct 37 ms 6016 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 14 ms 5504 KB Output is correct
24 Correct 14 ms 5504 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 14 ms 6100 KB Output is correct
28 Correct 14 ms 5632 KB Output is correct
29 Correct 12 ms 5504 KB Output is correct
30 Correct 13 ms 5504 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 150 ms 40596 KB Output is correct
37 Correct 2 ms 2688 KB Output is correct
38 Correct 143 ms 40316 KB Output is correct
39 Correct 133 ms 39672 KB Output is correct
40 Correct 149 ms 40688 KB Output is correct
41 Correct 161 ms 40948 KB Output is correct
42 Correct 214 ms 34936 KB Output is correct
43 Correct 243 ms 30584 KB Output is correct
44 Correct 249 ms 30200 KB Output is correct
45 Correct 245 ms 30200 KB Output is correct
46 Correct 244 ms 30200 KB Output is correct
47 Correct 197 ms 34812 KB Output is correct
48 Correct 199 ms 34824 KB Output is correct
49 Correct 211 ms 34852 KB Output is correct
50 Correct 208 ms 36344 KB Output is correct
51 Correct 153 ms 41968 KB Output is correct
52 Correct 153 ms 41840 KB Output is correct
53 Correct 185 ms 31608 KB Output is correct
54 Correct 182 ms 31480 KB Output is correct
55 Correct 241 ms 31480 KB Output is correct
56 Correct 258 ms 31616 KB Output is correct
57 Correct 256 ms 31736 KB Output is correct
58 Correct 240 ms 31608 KB Output is correct
59 Correct 249 ms 31612 KB Output is correct
60 Correct 243 ms 32236 KB Output is correct
61 Correct 193 ms 36600 KB Output is correct
62 Correct 191 ms 36724 KB Output is correct
63 Correct 195 ms 36600 KB Output is correct
64 Correct 206 ms 36548 KB Output is correct
65 Correct 261 ms 31736 KB Output is correct
66 Correct 263 ms 31480 KB Output is correct
67 Correct 248 ms 31504 KB Output is correct
68 Correct 191 ms 31480 KB Output is correct
69 Correct 188 ms 31484 KB Output is correct
70 Correct 205 ms 36852 KB Output is correct
71 Correct 202 ms 36216 KB Output is correct
72 Correct 2 ms 2688 KB Output is correct
73 Correct 14 ms 5504 KB Output is correct
74 Correct 14 ms 5504 KB Output is correct
75 Correct 2 ms 2688 KB Output is correct
76 Correct 2 ms 2688 KB Output is correct
77 Correct 14 ms 6016 KB Output is correct
78 Correct 14 ms 5632 KB Output is correct
79 Correct 11 ms 5504 KB Output is correct
80 Correct 13 ms 5504 KB Output is correct
81 Correct 2 ms 2688 KB Output is correct
82 Correct 2 ms 2688 KB Output is correct
83 Correct 2 ms 2688 KB Output is correct
84 Correct 2 ms 2688 KB Output is correct
85 Correct 2 ms 2688 KB Output is correct
86 Correct 36 ms 5888 KB Output is correct
87 Correct 37 ms 6008 KB Output is correct
88 Correct 36 ms 6008 KB Output is correct
89 Correct 14 ms 6016 KB Output is correct
90 Correct 14 ms 5632 KB Output is correct
91 Correct 35 ms 6136 KB Output is correct
92 Correct 39 ms 6016 KB Output is correct
93 Correct 2 ms 2688 KB Output is correct
94 Correct 148 ms 41836 KB Output is correct
95 Correct 142 ms 41460 KB Output is correct
96 Correct 132 ms 40952 KB Output is correct
97 Correct 149 ms 41840 KB Output is correct
98 Correct 164 ms 42352 KB Output is correct
99 Correct 247 ms 31608 KB Output is correct
100 Correct 240 ms 31608 KB Output is correct
101 Correct 246 ms 31608 KB Output is correct
102 Correct 236 ms 32076 KB Output is correct
103 Correct 193 ms 36344 KB Output is correct
104 Correct 192 ms 36724 KB Output is correct
105 Correct 195 ms 36344 KB Output is correct
106 Correct 199 ms 36472 KB Output is correct
107 Correct 202 ms 36344 KB Output is correct
108 Correct 152 ms 41968 KB Output is correct
109 Correct 153 ms 41840 KB Output is correct
110 Correct 182 ms 31480 KB Output is correct
111 Correct 190 ms 31484 KB Output is correct
112 Correct 244 ms 31480 KB Output is correct
113 Correct 241 ms 31480 KB Output is correct