#include "friend.h"
#include<vector>
#include <algorithm>
#include <iostream>
#include <assert.h>
using namespace std;
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
vector<array<int, 2>> dp(n);
for(int i = 0; i < n; i ++) dp[i][1] = confidence[i], dp[i][0] = 0;
for(int i = n - 1; i > 0; i --){
int par = host[i];
if(protocol[i] == 0){
dp[par][0] += max(dp[i][0], dp[i][1]);
dp[par][1] += dp[i][0];
}else if(protocol[i] == 2){
dp[par][1] = max(dp[par][1] + dp[i][0], dp[par][0] + dp[i][1]);
dp[par][0] += dp[i][0];
}else{
dp[par][1] = max({dp[par][1] + dp[i][0], dp[par][0] + dp[i][1], dp[par][1] + dp[i][1]});
dp[par][0] += dp[i][0];
}
}
return max(dp[0][0], dp[0][1]);
}
