Submission #1303609

---

Source Code Expand

#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const int inf = 999999999;
const double pi = acos(-1);

#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))

ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}

///////////////////////////////////////////////////////////////////////////
vector<vector<int>> v;

int  dfs(vector<int> it){
    if(it.size() == 0){
        return 1;
    }else if(it.size() == 1){
        return (2 * dfs(v[it[0]])) + 1; 
    }

    int ma = -inf,mi = inf;
    for(auto itit : it){
        int c = dfs(v[itit]);
        ma = max(ma,c);
        mi = min(mi,c);
    }

    return ma + mi + 1;
}

int main(){
	int n;
    cin >> n;

    v.resize(n+1);

    rep(i,0,n-1){
        int b;
        cin >> b;
        v[b-1].push_back(i+1);
    }

    cout << dfs(v[0]) << endl;
    
	return 0;
}

Submission Info

Judge Result