oj.uz

Submission #937098

# Submission time Handle Problem Language Result Execution time Memory
937098 2024-03-03T13:23:44 Z lucri Cat in a tree (BOI17_catinatree) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
int pd[1510][1510],x,d,ans,n;
vector<vector<int>>a;
void calculeaza(int nod)
{
    int sum[1510],vmax[1510];
    for(int i=0;i<d;++i)
    {
        sum[i]=0;
        vmax[i]=-1000000000;
    }
    for(auto x:a[nod])
    {
        calculeaza(x);
        for(int i=0;i<d;++i)
        {
            sum[i]+=pd[x][i];
            if(i+2<=d)
                vmax[i]=max(vmax[i],pd[x][i]-pd[x][d-2-i]);
        }
    }
    pd[nod][0]=1+sum[d-1];
    for(int i=1;i<=d/2;++i)
        pd[nod][i]=vmax[i-1]+sum[d-i-1];
    for(int i=d/2+1;i<=d;++i)
        pd[nod][i]=sum[i-1];
}
int main()
{
    cin>>n>>d;
    a.resize(n+5);
    for(int i=1;i<n;++i)
    {
        cin>>x;
        a[x].push_back(i);
    }
    calculeaza(0);
    for(int i=0;i<=d;++i)
        ans=max(ans,pd[0][i]);
    cout<<ans;
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -