oj.uz

답안 #887838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887838 2023-12-15T09:51:15 Z amirhoseinfar1385 Cat in a tree (BOI17_catinatree) C++17
0 / 100
 1 ms 2660 KB 
#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]=d+1;
	}
	pre();
	sort(alln.rbegin(),alln.rend());
	for(int i=0;i<n;i++){
		if(dp[alln[i].second]==d+1){
			res++;
			upd(alln[i].second,d);
		}
	}
	cout<<res<<"\n";
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Incorrect 1 ms 2660 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Incorrect 1 ms 2660 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Incorrect 1 ms 2660 KB Output isn't correct
5 Halted 0 ms 0 KB -