oj.uz

Submission #383253

# Submission time Handle Problem Language Result Execution time Memory
383253 2021-03-29T10:32:49 Z ritul_kr_singh Railway (BOI17_railway) C++17
100 / 100
 606 ms 35936 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << " " <<
#define nl << "\n"

struct segtree{
	int sz = 1;
	vector<bool> a;
	segtree(int n){
		while(sz < n) sz *= 2;
		a.assign(2*sz, false);
	}
	void update(int i, int x, int lx, int rx){
		if(rx-lx==1) return void(a[x] = !a[x]);
		int mx = (lx+rx)/2;
		if(i<mx) update(i, 2*x+1, lx, mx);
		else update(i, 2*x+2, mx, rx);
		a[x] = max(a[2*x+1], a[2*x+2]);
	}
	void update(int i){ update(i, 0, 0, sz); }
	bool get(int l, int r, int x, int lx, int rx){
		if(r<=lx or rx<=l) return false;
		if(l<=lx and rx<=r) return a[x];
		int mx = (lx+rx)/2;
		return get(l, r, 2*x+1, lx, mx) or get(l, r, 2*x+2, mx, rx);
	}
	bool get(int l, int r){ return get(l, r+1, 0, 0, sz); }
};

vector<vector<pair<int, int>>> g;
vector<array<int, 18>> p;
vector<int> t0, t1, dp, ans;
int dfsTimer = 0;

void dfs0(int u, int parent){
	t0[u] = dfsTimer++;
	p[u][0] = parent;
	for(int i=1; i<18; ++i) p[u][i] = p[p[u][i-1]][i-1];
	for(auto e : g[u]) if(e.first != parent) dfs0(e.first, u);
	t1[u] = dfsTimer++;
}

bool isAncestor(int u, int v){
	return t0[u]<=t0[v] and t1[v]<=t1[u];
}

int dfs1(int u){
	for(auto edge : g[u]){
		int v = edge.first, e = edge.second;
		if(v==p[u][0]) continue;
		ans[e] = dfs1(v);
		dp[u] += ans[e];
	}
	return dp[u];
}

int lca(int u, int v){
	if(isAncestor(u, v)) return u;
	for(int i=17; i>=0; --i)
		while(u and !isAncestor(p[u][i], v)) u = p[u][i];
	return p[u][0];
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, m, k, x, y; cin >> n >> m >> k;
	g.resize(n), p.resize(n), t0.resize(n), t1.resize(n);
	dp.assign(n, 0), ans.resize(n);
	for(int i=1; i<n; ++i){
		cin >> x >> y; --x, --y;
		g[x].emplace_back(y, i);
		g[y].emplace_back(x, i);
	}
	dfs0(0, 0);
	segtree st(n+n);
	while(m--){
		int s; cin >> s;
		vector<int> curr(s), updated;
		for(int &i : curr) cin >> i, --i;
		int x = curr[0];
		for(int i : curr) x = lca(x, i);

		for(int i : curr){
			int u = i;
			if(st.get(t0[u], t1[u])) continue;
			for(int j=17; j>=0; --j)
				while(u and isAncestor(x, p[u][j]) and !st.get(t0[p[u][j]], t1[p[u][j]]))
					u = p[u][j];
			st.update(t0[i]);
			updated.push_back(t0[i]);
			++dp[i];
			if(u != x) u = p[u][0];
			--dp[u];
		}
		for(int i : updated) st.update(i);
	}
	dfs1(0);
	vector<int> res;
	for(int i=1; i<n; ++i) if(ans[i]>=k) res.push_back(i);
	// for(int i : ans) cout << i << ' ';
	// cout nl;
	cout << res.size() nl;
	for(int i : res) cout << i << ' ';	
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 11 ms 2924 KB Output is correct
3 Correct 9 ms 2796 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 12 ms 3436 KB Output is correct
7 Correct 10 ms 3052 KB Output is correct
8 Correct 8 ms 2924 KB Output is correct
9 Correct 8 ms 2924 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 372 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 11 ms 2924 KB Output is correct
3 Correct 9 ms 2796 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 12 ms 3436 KB Output is correct
7 Correct 10 ms 3052 KB Output is correct
8 Correct 8 ms 2924 KB Output is correct
9 Correct 8 ms 2924 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 372 KB Output is correct
15 Correct 104 ms 3308 KB Output is correct
16 Correct 101 ms 3436 KB Output is correct
17 Correct 106 ms 3436 KB Output is correct
18 Correct 16 ms 3436 KB Output is correct
19 Correct 11 ms 3052 KB Output is correct
20 Correct 84 ms 3560 KB Output is correct
21 Correct 92 ms 3308 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 9 ms 2924 KB Output is correct
24 Correct 9 ms 2924 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 13 ms 3564 KB Output is correct
28 Correct 12 ms 3052 KB Output is correct
29 Correct 9 ms 2924 KB Output is correct
30 Correct 9 ms 2924 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 366 ms 33768 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 372 ms 35036 KB Output is correct
4 Correct 373 ms 34552 KB Output is correct
5 Correct 606 ms 35544 KB Output is correct
6 Correct 501 ms 35936 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 29036 KB Output is correct
2 Correct 242 ms 25580 KB Output is correct
3 Correct 232 ms 25068 KB Output is correct
4 Correct 217 ms 25196 KB Output is correct
5 Correct 233 ms 25068 KB Output is correct
6 Correct 260 ms 29292 KB Output is correct
7 Correct 261 ms 29036 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 29036 KB Output is correct
2 Correct 242 ms 25580 KB Output is correct
3 Correct 232 ms 25068 KB Output is correct
4 Correct 217 ms 25196 KB Output is correct
5 Correct 233 ms 25068 KB Output is correct
6 Correct 260 ms 29292 KB Output is correct
7 Correct 261 ms 29036 KB Output is correct
8 Correct 358 ms 29292 KB Output is correct
9 Correct 352 ms 29292 KB Output is correct
10 Correct 539 ms 34144 KB Output is correct
11 Correct 509 ms 34016 KB Output is correct
12 Correct 195 ms 24680 KB Output is correct
13 Correct 177 ms 24680 KB Output is correct
14 Correct 248 ms 25068 KB Output is correct
15 Correct 255 ms 25068 KB Output is correct
16 Correct 243 ms 25196 KB Output is correct
17 Correct 224 ms 25068 KB Output is correct
18 Correct 206 ms 25068 KB Output is correct
19 Correct 277 ms 25708 KB Output is correct
20 Correct 262 ms 29416 KB Output is correct
21 Correct 271 ms 29672 KB Output is correct
22 Correct 278 ms 29548 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 11 ms 2924 KB Output is correct
3 Correct 9 ms 2796 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 12 ms 3436 KB Output is correct
7 Correct 10 ms 3052 KB Output is correct
8 Correct 8 ms 2924 KB Output is correct
9 Correct 8 ms 2924 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 372 KB Output is correct
15 Correct 104 ms 3308 KB Output is correct
16 Correct 101 ms 3436 KB Output is correct
17 Correct 106 ms 3436 KB Output is correct
18 Correct 16 ms 3436 KB Output is correct
19 Correct 11 ms 3052 KB Output is correct
20 Correct 84 ms 3560 KB Output is correct
21 Correct 92 ms 3308 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 9 ms 2924 KB Output is correct
24 Correct 9 ms 2924 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 13 ms 3564 KB Output is correct
28 Correct 12 ms 3052 KB Output is correct
29 Correct 9 ms 2924 KB Output is correct
30 Correct 9 ms 2924 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 366 ms 33768 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 372 ms 35036 KB Output is correct
39 Correct 373 ms 34552 KB Output is correct
40 Correct 606 ms 35544 KB Output is correct
41 Correct 501 ms 35936 KB Output is correct
42 Correct 274 ms 29036 KB Output is correct
43 Correct 242 ms 25580 KB Output is correct
44 Correct 232 ms 25068 KB Output is correct
45 Correct 217 ms 25196 KB Output is correct
46 Correct 233 ms 25068 KB Output is correct
47 Correct 260 ms 29292 KB Output is correct
48 Correct 261 ms 29036 KB Output is correct
49 Correct 358 ms 29292 KB Output is correct
50 Correct 352 ms 29292 KB Output is correct
51 Correct 539 ms 34144 KB Output is correct
52 Correct 509 ms 34016 KB Output is correct
53 Correct 195 ms 24680 KB Output is correct
54 Correct 177 ms 24680 KB Output is correct
55 Correct 248 ms 25068 KB Output is correct
56 Correct 255 ms 25068 KB Output is correct
57 Correct 243 ms 25196 KB Output is correct
58 Correct 224 ms 25068 KB Output is correct
59 Correct 206 ms 25068 KB Output is correct
60 Correct 277 ms 25708 KB Output is correct
61 Correct 262 ms 29416 KB Output is correct
62 Correct 271 ms 29672 KB Output is correct
63 Correct 278 ms 29548 KB Output is correct
64 Correct 284 ms 31212 KB Output is correct
65 Correct 292 ms 26988 KB Output is correct
66 Correct 297 ms 26860 KB Output is correct
67 Correct 263 ms 26860 KB Output is correct
68 Correct 180 ms 25964 KB Output is correct
69 Correct 149 ms 25964 KB Output is correct
70 Correct 315 ms 31596 KB Output is correct
71 Correct 359 ms 30700 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 9 ms 2924 KB Output is correct
74 Correct 10 ms 2924 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 11 ms 3436 KB Output is correct
78 Correct 10 ms 3052 KB Output is correct
79 Correct 8 ms 2924 KB Output is correct
80 Correct 8 ms 2924 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 2 ms 364 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 108 ms 3308 KB Output is correct
87 Correct 104 ms 3436 KB Output is correct
88 Correct 104 ms 3436 KB Output is correct
89 Correct 13 ms 3436 KB Output is correct
90 Correct 11 ms 3052 KB Output is correct
91 Correct 88 ms 3432 KB Output is correct
92 Correct 102 ms 3332 KB Output is correct
93 Correct 1 ms 364 KB Output is correct
94 Correct 375 ms 35680 KB Output is correct
95 Correct 368 ms 35060 KB Output is correct
96 Correct 362 ms 34284 KB Output is correct
97 Correct 583 ms 35680 KB Output is correct
98 Correct 510 ms 35936 KB Output is correct
99 Correct 218 ms 27116 KB Output is correct
100 Correct 237 ms 26988 KB Output is correct
101 Correct 245 ms 26988 KB Output is correct
102 Correct 241 ms 27372 KB Output is correct
103 Correct 288 ms 31084 KB Output is correct
104 Correct 261 ms 31720 KB Output is correct
105 Correct 243 ms 30828 KB Output is correct
106 Correct 358 ms 31208 KB Output is correct
107 Correct 357 ms 31036 KB Output is correct
108 Correct 510 ms 35808 KB Output is correct
109 Correct 564 ms 35684 KB Output is correct
110 Correct 178 ms 26088 KB Output is correct
111 Correct 189 ms 26088 KB Output is correct
112 Correct 249 ms 26860 KB Output is correct
113 Correct 262 ms 26860 KB Output is correct