Codeforces Round #468 (Div. 2) D. Peculiar apple-tree(找规律)

D. Peculiar apple-tree
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In Arcady’s garden there grows a peculiar apple-tree that fruits one time per year. Its peculiarity can be explained in following way: there are n inflorescences, numbered from 1 to n. Inflorescence number 1 is situated near base of tree and any other inflorescence with number i (i > 1) is situated at the top of branch, which bottom is pi-th inflorescence and pi < i.

Once tree starts fruiting, there appears exactly one apple in each inflorescence. The same moment as apples appear, they start to roll down along branches to the very base of tree. Each second all apples, except ones in first inflorescence simultaneously roll down one branch closer to tree base, e.g. apple in a-th inflorescence gets to pa-th inflorescence. Apples that end up in first inflorescence are gathered by Arcady in exactly the same moment. Second peculiarity of this tree is that once two apples are in same inflorescence they annihilate. This happens with each pair of apples, e.g. if there are 5 apples in same inflorescence in same time, only one will not be annihilated and if there are 8 apples, all apples will be annihilated. Thus, there can be no more than one apple in each inflorescence in each moment of time.

Help Arcady with counting number of apples he will be able to collect from first inflorescence during one harvest.
Input

First line of input contains single integer number n (2 ≤ n ≤ 100 000) — number of inflorescences.

Second line of input contains sequence of n - 1 integer numbers p2, p3, …, pn (1 ≤ pi < i), where pi is number of inflorescence into which the apple from i-th inflorescence rolls down.
Output

Single line of output should contain one integer number: amount of apples that Arcady will be able to collect from first inflorescence during one harvest.
Examples
Input
Copy

3
1 1

Output

1

Input
Copy

5
1 2 2 2

Output

3

Input
Copy

18
1 1 1 4 4 3 2 2 2 10 8 9 9 9 10 10 4

Output

4

Note

In first example Arcady will be able to collect only one apple, initially situated in 1st inflorescence. In next second apples from 2nd and 3rd inflorescences will roll down and annihilate, and Arcady won’t be able to collect them.

In the second example Arcady will be able to collect 3 apples. First one is one initially situated in first inflorescence. In a second apple from 2nd inflorescence will roll down to 1st (Arcady will collect it) and apples from 3rd, 4th, 5th inflorescences will roll down to 2nd. Two of them will annihilate and one not annihilated will roll down from 2-nd inflorescence to 1st one in the next second and Arcady will collect it.

又是一道再给两分钟就能做出来的题.
题解:我们可以想到,每一层最多只能收取树根一个苹果,当每一层的奇偶(受上一层影响,我们可以看作是上一层是否可以产生苹果)与初始不同时,结果也不同,所以可以设置一个变量p,当奇偶性不同时,p=!p即可

#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define pb push_back
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rep1(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
const int N=1e5+100;
int arr[N],ce[N],pr[N];
int vis[N];
int pp,cnt=1,mx;
vector<int >G[N];
void dfs(int k,int c)
{
    int len=G[k].size();
    ce[c+1]+=len;
    int s=0;
    if(len==0)
        return ;
    for(int i=0;i<len;i++)
    {
        int y=G[k][i];
        dfs(y,c+1);
    }
    if(vis[k]%2!=0)
        pr[c]++;
    mx=max(mx,c);
}
int main()
{
    ios::sync_with_stdio(false);
    int n;
    cin>>n;
    mx=0;
    pp=1;
    ce[1]=1;
    for(int i=2;i<=n;i++)
    {
        cin>>arr[i];
        G[arr[i]].pb(i);
        vis[arr[i]]++;
    }
    dfs(1,1);
    for(int i=1;i<=mx+1;i++)
    {
       // cout<<pr[i]<<' '<<ce[i]<<endl;
        if(pr[i]%2!=ce[i]%2)
            pp=!pp;
        cnt+=pp;
    }
    cout<<cnt<<endl;
    return 0;
}