Submission #1846994

---

Source Code Expand

#include <bits/stdc++.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)

typedef long long ll;
typedef pair<int,int> P;
typedef pair<P,int> PP;

struct edge {
	int to,cost;
	edge(int t,int c):to(t),cost(c) {}
};

//int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1};

ll mypow(ll x,ll n,ll m) {	//xのn乗をmで割った余り
	if(n==0) return 1;
	if(n%2==0) return mypow(x*x%m,n/2,m);
	else return x*mypow(x,n-1,m)%m;
}

//-----------------------------------------------------------------------------

int n;
int b[20];
vector<int> g[20];

int dfs(int idx) {
	int res=1;
	int mi=INF,ma=0;
	REP(i,g[idx].size()) {
		int num=dfs(g[idx][i]);
		mi=min(mi,num),ma=max(ma,num);
	}
	if(g[idx].size()>0) return res+mi+ma;
	else return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n;
	REP(i,n-1) {
		int a; cin>>a;
		a--;
		g[a].pb(i+1);
	}
	cout<<dfs(0)<<endl;

	return 0;
}

Submission Info

Judge Result