Submission #1258408

#TimeUsernameProblemLanguageResultExecution timeMemory
1258408tritranminh2808Cat in a tree (BOI17_catinatree)C++20
0 / 100
3 ms4928 KiB
#include <bits/stdc++.h> using namespace std; vector <int> adj[200005]; int sz[2000005]; bool vst[200005]; // int depg[200005]; int d; int cnt=1; int f[200005];// khoang cach den thang gan nhat trong nhanh u ma chon duoc int dis=0; void dfs(int u, int v){ // cout << u << dis << " "; if(dis==d) { cnt++; dis=0; } for(auto i:adj[u]){ if(i==v) continue; dis++; dfs(i,u); } // dis--; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n >> d; for(int i=1;i<n;i++){ int u; cin>> u; adj[u].push_back(i); adj[i].push_back(u); } dfs(0,-1); cout << cnt; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...