답안 #887853

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887853	2023-12-15T10:23:04 Z	amirhoseinfar1385	Cat in a tree (BOI17_catinatree)	C++17	51 / 100	25 ms	14552 KB

catinatree

#include<bits/stdc++.h>
using namespace std;
int n,d;
const int maxn=100000+10;
int dp[maxn];
vector<int>adj[maxn];
vector<pair<int,int>>alln;
void pre(int u=0,int len=0,int par=-1){
	alln.push_back(make_pair(len,u));
	for(auto x:adj[u]){
		if(x!=par){
			pre(x,len+1,u);
		}
	}
}
int res=0;
void upd(int u,int len,int par=-1){
	if(len<0||len<=dp[u]){
		return ;
	}
	dp[u]=len;
	for(auto x:adj[u]){
		if(x!=par){
			upd(x,len-1,u);
		}
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>d;
	d--;
	for(int i=1;i<=n-1;i++){
		int f;
		cin>>f;
		adj[f].push_back(i);
		adj[i].push_back(f);
	}
	for(int i=0;i<n;i++){
		dp[i]=-1;
	}
	pre();
	sort(alln.rbegin(),alln.rend());
	for(int i=0;i<n;i++){
		//cout<<alln[i].first<<" "<<alln[i].second<<" "<<dp[alln[i].second]<<"\n";
		if(dp[alln[i].second]==-1){
			res++;
			upd(alln[i].second,d);
		}
	}
	cout<<res<<"\n";
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2652 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2664 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2648 KB	Output is correct
11	Correct	1 ms	2648 KB	Output is correct
12	Correct	1 ms	2652 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2660 KB	Output is correct
15	Correct	1 ms	2648 KB	Output is correct
16	Correct	1 ms	2652 KB	Output is correct
17	Correct	1 ms	2652 KB	Output is correct
18	Correct	1 ms	2808 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2652 KB	Output is correct

Subtask #2

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2652 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2664 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2648 KB	Output is correct
11	Correct	1 ms	2648 KB	Output is correct
12	Correct	1 ms	2652 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2660 KB	Output is correct
15	Correct	1 ms	2648 KB	Output is correct
16	Correct	1 ms	2652 KB	Output is correct
17	Correct	1 ms	2652 KB	Output is correct
18	Correct	1 ms	2808 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2652 KB	Output is correct
21	Correct	1 ms	2816 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2652 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	1 ms	2652 KB	Output is correct
27	Correct	1 ms	2652 KB	Output is correct
28	Correct	1 ms	2652 KB	Output is correct
29	Correct	1 ms	2908 KB	Output is correct
30	Correct	1 ms	2652 KB	Output is correct
31	Correct	1 ms	2652 KB	Output is correct
32	Correct	1 ms	2908 KB	Output is correct
33	Correct	1 ms	2908 KB	Output is correct
34	Correct	1 ms	2652 KB	Output is correct
35	Correct	1 ms	2652 KB	Output is correct
36	Correct	1 ms	2908 KB	Output is correct
37	Correct	1 ms	2904 KB	Output is correct
38	Correct	1 ms	2904 KB	Output is correct
39	Correct	1 ms	2904 KB	Output is correct
40	Correct	1 ms	2904 KB	Output is correct

Subtask #3

0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2652 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2664 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2648 KB	Output is correct
11	Correct	1 ms	2648 KB	Output is correct
12	Correct	1 ms	2652 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2660 KB	Output is correct
15	Correct	1 ms	2648 KB	Output is correct
16	Correct	1 ms	2652 KB	Output is correct
17	Correct	1 ms	2652 KB	Output is correct
18	Correct	1 ms	2808 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2652 KB	Output is correct
21	Correct	1 ms	2816 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2652 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	1 ms	2652 KB	Output is correct
27	Correct	1 ms	2652 KB	Output is correct
28	Correct	1 ms	2652 KB	Output is correct
29	Correct	1 ms	2908 KB	Output is correct
30	Correct	1 ms	2652 KB	Output is correct
31	Correct	1 ms	2652 KB	Output is correct
32	Correct	1 ms	2908 KB	Output is correct
33	Correct	1 ms	2908 KB	Output is correct
34	Correct	1 ms	2652 KB	Output is correct
35	Correct	1 ms	2652 KB	Output is correct
36	Correct	1 ms	2908 KB	Output is correct
37	Correct	1 ms	2904 KB	Output is correct
38	Correct	1 ms	2904 KB	Output is correct
39	Correct	1 ms	2904 KB	Output is correct
40	Correct	1 ms	2904 KB	Output is correct
41	Runtime error	25 ms	14552 KB	Execution killed with signal 6
42	Halted	0 ms	0 KB	-