#468 div2 D. Peculiar apple-tree

最新推荐文章于 2019-09-21 14:58:58 发布

白白不狼

最新推荐文章于 2019-09-21 14:58:58 发布

阅读量456

点赞数

分类专栏： Codefocres dfs bfs

本文链接：https://blog.csdn.net/ac_blood/article/details/79452983

版权

dfs bfs 同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

Codefocres

9 篇文章 0 订阅

订阅专栏

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 p_i-th inflorescence and p_i < 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 p_a-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 p₂, p₃, ..., p_n (1 ≤ p_i < i), where p_i 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

Input

Copy

5
1 2 2 2

Output

Input

Copy

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

Output

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.

题意：一颗苹果树，每个开花的位置都会结一个苹果，花的位置序列已经给出，结果之后，苹果会向下落、序列1的位置在最下面只有落到序列1位置的苹果可以摘，苹果下落时有两种规则

1、两个苹果相撞就会消失

2、苹果下一次出现的位置为当前花序对应的pi值

问一个能摘到多少个苹果

思路：把树建起来，用dfs自下向上跑一遍，然后算出每一层有多少苹果，最后计算两两相消之后剩下的苹果数量

ac代码

#include<bits/stdc++.h>

using namespace std;

struct A
{
    queue<int>q;
};

A a[100005];
int b[100005];
int dept;

void dfs(int x,int dep)
{
    while(!a[x].q.empty())
    {
        int head = a[x].q.front();
        a[x].q.pop();
        b[dep+1]++;
        dfs(head,dep+1);
    }
}

int main()
{

    int n;
    memset(b,0,sizeof(b));
    scanf("%d",&n);
    for(int i = 2; i <= n; i++)
    {
        int temp;
        scanf("%d",&temp);
        a[temp].q.push(i);
    }

dept = 0;
dfs(1,dept);

int sum = 1;

for(int i = 0; i <= n; i++)
{
    sum+=b[i]%2;
}
    printf("%d\n",sum);
    return 0;
}

ps：代码写的很粗糙因为不是一次想出来的修改了很多地方有些残余还没有清除......