Submission #360209

# Submission time Handle Problem Language Result Execution time Memory
360209 2021-01-27T19:16:23 Z iamsleepy Cat in a tree (BOI17_catinatree) C++14
100 / 100
178 ms 21728 KB
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=2e5+5;
const int inf=1e9;
int d;
int level[mxn];
set<pii> st;
vector<int> adj[mxn];
int par[mxn];
int near[mxn];
void dfs(int cur,int prev,int dist,int x) {
	if(dist >= d) return;
	if(st.find({level[cur],cur}) != st.end()) st.erase({level[cur],cur});
	for(int u : adj[cur]) {
		if(u == prev || (cur == x && level[u] > level[cur]) ) continue;
		dfs(u,cur,dist + 1,x);
	}
}

bool check(int cur,int dist) {
	if(dist >= d) return true;
	if(dist + near[cur] < d) return false;
	if(par[cur] == cur) return true;
	return check(par[cur],dist + 1);
}

void update(int cur,int dist) {
	if(dist >= d) return;
	near[cur] = min(near[cur],dist);
	update(par[cur],dist + 1);

}

void DFS(int cur,int prev) {
	level[cur] = level[prev] + 1;
	par[cur] = prev;
	for(int u : adj[cur]) {
		if(u != prev) DFS(u,cur);
	}
}


int main() {
	int n;
	cin>>n;

	cin>>d;
	for(int i = 1; i < n; i++) {
		int u;
		cin>>u;
		adj[u].push_back(i);
		adj[i].push_back(u);
	}

	for(int i = 0; i <= n; i++) near[i] = inf;

	level[0] = 0;
	DFS(0,0);
	vector<pii> v;
	for(int i = 0; i < n; i++) v.push_back({level[i],i});
	sort(v.begin(),v.end());
    
	int res = 0;
	for(int i = v.size() - 1; i >= 0; i--) {
		int u = v[i].second;
		bool f = check(u,0);

		if(f) {
			res++;
			update(u,0);
		}
	}
	cout<<res<<endl;




}
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 3 ms 4972 KB Output is correct
6 Correct 4 ms 4972 KB Output is correct
7 Correct 4 ms 4972 KB Output is correct
8 Correct 4 ms 4972 KB Output is correct
9 Correct 4 ms 4972 KB Output is correct
10 Correct 4 ms 4972 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 3 ms 4972 KB Output is correct
13 Correct 4 ms 4972 KB Output is correct
14 Correct 3 ms 4972 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 4 ms 4972 KB Output is correct
17 Correct 4 ms 4972 KB Output is correct
18 Correct 4 ms 4972 KB Output is correct
19 Correct 3 ms 4972 KB Output is correct
20 Correct 3 ms 4972 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 3 ms 4972 KB Output is correct
6 Correct 4 ms 4972 KB Output is correct
7 Correct 4 ms 4972 KB Output is correct
8 Correct 4 ms 4972 KB Output is correct
9 Correct 4 ms 4972 KB Output is correct
10 Correct 4 ms 4972 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 3 ms 4972 KB Output is correct
13 Correct 4 ms 4972 KB Output is correct
14 Correct 3 ms 4972 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 4 ms 4972 KB Output is correct
17 Correct 4 ms 4972 KB Output is correct
18 Correct 4 ms 4972 KB Output is correct
19 Correct 3 ms 4972 KB Output is correct
20 Correct 3 ms 4972 KB Output is correct
21 Correct 4 ms 5228 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5100 KB Output is correct
25 Correct 4 ms 5120 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 4 ms 5100 KB Output is correct
29 Correct 4 ms 5100 KB Output is correct
30 Correct 4 ms 5100 KB Output is correct
31 Correct 5 ms 5120 KB Output is correct
32 Correct 4 ms 5100 KB Output is correct
33 Correct 4 ms 5100 KB Output is correct
34 Correct 4 ms 5100 KB Output is correct
35 Correct 4 ms 5100 KB Output is correct
36 Correct 4 ms 5100 KB Output is correct
37 Correct 4 ms 5100 KB Output is correct
38 Correct 4 ms 5100 KB Output is correct
39 Correct 4 ms 5100 KB Output is correct
40 Correct 4 ms 5228 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 3 ms 4972 KB Output is correct
6 Correct 4 ms 4972 KB Output is correct
7 Correct 4 ms 4972 KB Output is correct
8 Correct 4 ms 4972 KB Output is correct
9 Correct 4 ms 4972 KB Output is correct
10 Correct 4 ms 4972 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 3 ms 4972 KB Output is correct
13 Correct 4 ms 4972 KB Output is correct
14 Correct 3 ms 4972 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 4 ms 4972 KB Output is correct
17 Correct 4 ms 4972 KB Output is correct
18 Correct 4 ms 4972 KB Output is correct
19 Correct 3 ms 4972 KB Output is correct
20 Correct 3 ms 4972 KB Output is correct
21 Correct 4 ms 5228 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5100 KB Output is correct
25 Correct 4 ms 5120 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 4 ms 5100 KB Output is correct
29 Correct 4 ms 5100 KB Output is correct
30 Correct 4 ms 5100 KB Output is correct
31 Correct 5 ms 5120 KB Output is correct
32 Correct 4 ms 5100 KB Output is correct
33 Correct 4 ms 5100 KB Output is correct
34 Correct 4 ms 5100 KB Output is correct
35 Correct 4 ms 5100 KB Output is correct
36 Correct 4 ms 5100 KB Output is correct
37 Correct 4 ms 5100 KB Output is correct
38 Correct 4 ms 5100 KB Output is correct
39 Correct 4 ms 5100 KB Output is correct
40 Correct 4 ms 5228 KB Output is correct
41 Correct 119 ms 16608 KB Output is correct
42 Correct 78 ms 11196 KB Output is correct
43 Correct 76 ms 11132 KB Output is correct
44 Correct 74 ms 11112 KB Output is correct
45 Correct 74 ms 11112 KB Output is correct
46 Correct 169 ms 17264 KB Output is correct
47 Correct 178 ms 17120 KB Output is correct
48 Correct 174 ms 17120 KB Output is correct
49 Correct 176 ms 17120 KB Output is correct
50 Correct 53 ms 11368 KB Output is correct
51 Correct 60 ms 11500 KB Output is correct
52 Correct 56 ms 11368 KB Output is correct
53 Correct 109 ms 17632 KB Output is correct
54 Correct 113 ms 17760 KB Output is correct
55 Correct 115 ms 17632 KB Output is correct
56 Correct 5 ms 5228 KB Output is correct
57 Correct 15 ms 7404 KB Output is correct
58 Correct 58 ms 15340 KB Output is correct
59 Correct 143 ms 21728 KB Output is correct
60 Correct 119 ms 16868 KB Output is correct
61 Correct 132 ms 16608 KB Output is correct