Submission #1231103

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231103		Malix	Cat in a tree (BOI17_catinatree)	C++20	51 / 100	72 ms	19904 KiB

catinatree

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

vii a;
int dist[1500][1500],vis[1500];

void dfs(int s,int x){
    vis[x]=1;
    for(auto u:a[x])if(!vis[u]){
        dist[s][u]=dist[s][x]+1;
        dfs(s,u);
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,d;cin>>n>>d;
    a.resize(n);
    REP(i,1,n){
        int x;cin>>x;
        a[x].PB(i);
        a[i].PB(x);
    }
    REP(i,0,n){
        memset(vis,0,sizeof(vis));
        dist[i][i]=0;
        dfs(i,i);
    }
    priority_queue<pi> pq;
    vi arr;
    REP(i,0,n)pq.push({dist[0][i],i});
    while(!pq.empty()){
        int x=pq.top().S;
        pq.pop();
        bool f=1;
        for(auto u:arr)if(dist[u][x]<d)f=0;
        if(f)arr.PB(x);
    }
    cout<<arr.size();
}

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