# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883813 | imarn | Cat in a tree (BOI17_catinatree) | C++14 | 64 ms | 139604 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define pii pair<long long,int>
#define f first
#define pb push_back
#define s second
using namespace std;
const int N=2e5+5;
vector<int>g[N];
deque<int>dq[N];
int ans=0;
int k;
void dfs(int u=0,int p=0){
dq[u].pb(1);
for(auto v:g[u]){
if(v==p)continue;
dfs(v,u);dq[v].push_front(dq[v].front());
if(dq[v].size()>dq[u].size())swap(dq[u],dq[v]);
deque<int>x;
for(int i=0;i<dq[v].size();i++){
int a=max(k-i,i);x.pb(dq[v][i]);
if(a<dq[u].size())x[i]=max(x[i],dq[v][i]+dq[u][a]);
}int mx=0;
for(int i=(int)dq[v].size()-1;i>=0;i--){
mx=max(mx,x[i]);
dq[u][i] = max(dq[u][i],mx);
}
}
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;cin>>n>>k;
for(int i=1,u;i<=n-1;i++)cin>>u,g[u].pb(i),g[i].pb(u);
dfs();cout<<dq[0].front();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |