Codeforces 930 A. Peculiar Apple-tree (DFS)

Topic:

Code:

#include <bits\stdc++.h>using namespacestd;intb[100010];//B[i] Indicates the number of tidbits from the I step of the 1th trailerMap <int, List <int> > m;//M[i] Indicates the trailer label of the first I-Trailer connectionintAns =0;voidDfsintConintStep) {B[step]++;  for(List <int>::iterator it = M[con].begin (); It! = M[con].end (); it++) {DFS (*it, step+1); }    }intMain () {intN, Key; CIN>>N;  for(inti =2; I <= N; i++) {cin>>key;    M[key].push_back (i); } DFS (1,0);  for(inti =0; I <100010; i++) {ans+ = b[i]%2; } cout<< ans <<Endl; return 0;}

Codeforces 930 A. Peculiar Apple-tree (DFS)