Codeforces Hello 2018 B.Christmas Spruce

Description

Consider a rooted tree. A rooted tree has one special vertex called the root. All edges are directed from the root. Vertex u is called a child of vertex v and vertex v is called a parent of vertex u if there exists a directed edge from v to u. A vertex is called a leaf if it doesn’t have children and has a parent.

Let’s call a rooted tree a spruce if its every non-leaf vertex has at least 3 leaf children. You are given a rooted tree, check whether it’s a spruce.

The definition of a rooted tree can be found here.

Input

The first line contains one integer n — the number of vertices in the tree (3 ≤ n ≤ 1 000). Each of the next n - 1 lines contains one integer pi (1 ≤ i ≤ n - 1) — the index of the parent of the i + 1-th vertex (1 ≤ pi ≤ i).

Vertex 1 is the root. It’s guaranteed that the root has at least 2 children.

Output

Print “Yes” if the tree is a spruce and “No” otherwise.

Examples

input
4
1
1
1
output
Yes
input
7
1
1
1
2
2
2
output
No
input
8
1
1
1
1
3
3
3
output
Yes

题目大意

判断所给的数据是否满足所有的非叶节点都包含有三个或者三个以上的叶子节点.若是，输出Yes；否则，输出No。

解题思路

在容器中存储每个节点所有的子节点，对于后边出现过的即不是叶子节点的再删除掉。最后当每个节点容器大小>=3或者=0的话就符合条件，但对于13 1 2 2 2 1 6 6 6 1 10 10 10每个节点都不存在叶子节点的情况进行标记。

代码实现

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 1007
bool flag[maxn];
int pre[maxn];
set<int>p[maxn];
int main()
{
    ios::sync_with_stdio(false);
    int n;
    cin>>n;
    int i=2;
    memset(flag,false,sizeof(flag));
    while(i<=n)
    {
        int t;
        cin>>t;
        flag[t]=true;
        pre[i]=t;
        p[t].insert(i);
        if(t!=1)
            p[pre[t]].erase(t);
        i++;
    }
    bool l=false;
    for(int i=1;i<=n;i++)
        if(!((flag[i]==true&&p[i].size()>=3)||(flag[i]==false&&p[i].size()==0)))
        {
            cout<<"No"<<endl;
            l=true;
            break;
        }
    if(!l)
        cout<<"Yes"<<endl;
    return 0;
}