# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155148 | Mercenary | Friend (IOI14_friend) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int dp[maxn][2];
vector<int> v[maxn];
int findSample(int n,int confidence[],int host[],int protocol[]){
for(int i = 1 ; i < n ; ++i){
v[host[i]].pb(i);
}
for(int i = n - 1 ; i >= 0 ; --i){
dp[i][0] = confidence[i];
for(int c : v[i]){
if(protocol[c] == 0){
dp[i][0] += dp[c][1];
dp[i][1] += dp[i][0];
}else if(protocol[c] == 1){
dp[i][0] += dp[c][0];
dp[i][1] += dp[c][1];
}else{
dp[i][0] = dp[c][1];
dp[i][1] = dp[c][1];
}
}
}
return max(dp[0][0],dp[0][1]);
}