C. Tree Infection(递归,模拟)

原文:

A tree is a connected graph without cycles. A rooted tree has a special vertex called the root. The parent of a vertex vv (different from root) is the previous to vv vertex on the shortest path from the root to the vertex vv. Children of the vertex vv are all vertices for which vv is the parent.

You are given a rooted tree with nn vertices. The vertex 11 is the root. Initially, all vertices are healthy.

Each second you do two operations, the spreading operation and, after that, the injection operation:

1. Spreading: for each vertex vv, if at least one child of vv is infected, you can spread the disease by infecting at most one other child of vv of your choice.
2. Injection: you can choose any healthy vertex and infect it.

This process repeats each second until the whole tree is infected. You need to find the minimal number of seconds needed to infect the whole tree.

Input

The input consists of multiple test cases. The first line contains a single integer tt (1≤t≤1041≤t≤104) — the number of test cases. Description of the test cases follows.

The first line of each test case contains a single integer nn (2≤n≤2⋅1052≤n≤2⋅105) — the number of the vertices in the given tree.

The second line of each test case contains n−1n−1 integers p2,p3,…,pnp2,p3,…,pn (1≤pi≤n1≤pi≤n), where pipi is the ancestor of the ii-th vertex in the tree.

It is guaranteed that the given graph is a tree.

It is guaranteed that the sum of nn over all test cases doesn't exceed 2⋅1052⋅105.

Output

For each test case you should output a single integer — the minimal number of seconds needed to infect the whole tree.

Example

input

Copy

5
7
1 1 1 2 2 4
5
5 5 1 4
2
1
3
3 1
6
1 1 1 1 1

output

Copy

4
4
2
3
4

Note

The image depicts the tree from the first test case during each second.

A vertex is black if it is not infected. A vertex is blue if it is infected by injection during the previous second. A vertex is green if it is infected by spreading during the previous second. A vertex is red if it is infected earlier than the previous second.

正在上传…重新上传取消

Note that you are able to choose which vertices are infected by spreading and by injections.

思路:

1,模拟操作,分类,先注入感染,后处理剩下的,对其感染,注入,

2,注意循环处理那些已感染结束的节点,pop掉

代码:

#include<bits/stdc++.h>
using namespace std;
#define int long long
// typedef long long ll
#define pu push_back
#define rep(i,m,n) for(int i=m;i<=n;++i)
#define atp(i,m,n) for(int i=m;i>=n;--i)
#define pii pair<int,int>
#define pll pair<long,long>
#define vi vector<int>
const int maxj =2e5+100,mod = 998244353,inf=0x3f3f3f3f ;
int ans=0;
void proc(vector<int>&a){//层级关系,有时情况过于复杂,只能模拟,当然应该是有优化的模拟
    if(a.empty())return ;
    int pos=0;
    int len=a.size();
    rep(i,0,len-1){
        if(a[i]==a[0])pos=i;
        else break;
    }
    a[pos]--;//插入
    ++ans;
    rep(i,0,len-1)//同一秒统一父节点,同时减一
    --a[i];
    while(a.back()<=0&&!a.empty())a.pop_back();//注意非空
    proc(a);
}
int32_t main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t;
    cin>>t;
    while(t--){//模拟,递归
    int n;
    cin>>n;ans=0;
    vector<int>a(n);
    rep(i,1,n-1){//输入个数不对
        int x;
        cin>>x;
        ++a[--x];//位数模拟
    }
    a.emplace_back(1);//n==1
    sort(a.rbegin(),a.rend());
    while(a.back()<=0&&!a.empty())a.pop_back();
    int len=a.size();
    rep(i,0,len-1){//模拟插入
        ans++;
        a[i]=a[i]-(len-i);
    }
    sort(a.rbegin(),a.rend());
    while(a.back()<=0&&!a.empty())a.pop_back();
    proc(a);
    cout<<ans<<'\n';
    }
    return 0;
}