//
// friend.cpp
// solution.cpp
//
// Created by Marko Petrov on 14.5.23.
//
#include "friend.h"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include <climits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int findSample(int n, int confidence[], int host[], int protocol[]){
int dp[n][2];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++){
dp[i][1] = confidence[i];
}
for(int i = n; i >= 0; i--){
//1 = choose
if (protocol[i] == 0){
dp[host[i]][0]+= max(dp[i][0], dp[i][1]);
dp[host[i]][1] += dp[i][0];
}else if (protocol[i] == 1){
dp[host[i]][1] += max(dp[i][1], dp[i][0]);
dp[host[i]][1] = max(dp[host[i]][1], dp[i][1] + dp[host[i]][0]);
dp[host[i]][0] += dp[i][0];
}else{
dp[host[i]][1] += dp[i][0];
dp[host[i]][1] = max(dp[host[i]][1], dp[host[i]][0] + dp[i][1]);
dp[host[i]][0] += dp[i][0];
}
}
return max(dp[0][0], dp[0][1]);
}
