Submission #963670

# Submission time Handle Problem Language Result Execution time Memory
963670 2024-04-15T12:50:11 Z pcc Cat in a tree (BOI17_catinatree) C++17
100 / 100
31 ms 15700 KB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>

const int mxn = 2e5+10;
int N,D;
vector<int> tree[mxn];
pii dp[mxn];

void dfs(int now){
	dp[now] = pii(1,0);
	for(auto nxt:tree[now]){
		dfs(nxt);
		dp[now].fs += dp[nxt].fs;
		if(dp[now].sc+dp[nxt].sc+1<D){
			dp[now].fs--;
			dp[now].sc = max(dp[now].sc,dp[nxt].sc+1);
		}
		else{
			dp[now].sc = min(dp[now].sc,dp[nxt].sc+1);
		}
	}
	return;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>D;
	for(int i = 1;i<N;i++){
		int p;
		cin>>p;
		tree[p].push_back(i);
	}
	dfs(0);
	cout<<dp[0].fs;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6328 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 2 ms 6516 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6536 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6328 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 2 ms 6516 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6536 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6564 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6488 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 2 ms 6492 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 3 ms 6496 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6328 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 2 ms 6516 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6536 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6564 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6488 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 2 ms 6492 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 3 ms 6496 KB Output is correct
41 Correct 21 ms 11216 KB Output is correct
42 Correct 15 ms 8796 KB Output is correct
43 Correct 14 ms 8664 KB Output is correct
44 Correct 14 ms 8796 KB Output is correct
45 Correct 15 ms 8636 KB Output is correct
46 Correct 29 ms 10836 KB Output is correct
47 Correct 29 ms 11092 KB Output is correct
48 Correct 29 ms 11096 KB Output is correct
49 Correct 31 ms 11100 KB Output is correct
50 Correct 8 ms 7516 KB Output is correct
51 Correct 10 ms 7472 KB Output is correct
52 Correct 8 ms 7512 KB Output is correct
53 Correct 15 ms 8540 KB Output is correct
54 Correct 14 ms 8536 KB Output is correct
55 Correct 15 ms 8536 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 4 ms 8284 KB Output is correct
58 Correct 14 ms 14172 KB Output is correct
59 Correct 28 ms 15700 KB Output is correct
60 Correct 22 ms 11992 KB Output is correct
61 Correct 24 ms 11608 KB Output is correct