Submission #1007631

#	Time	Username	Problem	Language	Result	Execution time	Memory
1007631		Khanhcsp2	Cat in a tree (BOI17_catinatree)	C++14	100 / 100	30 ms	18124 KiB

catinatree

#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=2e5+11;
int n, d;
vector<int> adj[N];
pii dp[N];
void dfs(int u)
{
    dp[u]={1, 0};
    for(int v:adj[u])
    {
        dfs(v);
        dp[u].fi+=dp[v].fi;
        if(dp[u].sc+dp[v].sc+1<d)
        {
            dp[u].fi--;
            dp[u].sc=max(dp[u].sc, dp[v].sc+1);
        }
        else dp[u].sc=min(dp[u].sc, dp[v].sc+1);
    }
}
void sol()
{
    cin >> n >> d;
    for(int i=2;i<=n;i++)
    {
        int x;
        cin >> x;
        adj[x+1].push_back(i);
    }
    dfs(1);
    cout << dp[1].fi;
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

• Subtask 1: 11 / 11
• Subtask 2: 40 / 40
• Subtask 3: 49 / 49