| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1046437 | tolbi | Holiday (IOI14_holiday) | C++17 | 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.
#define tol(bi) (1LL<<((int)(bi)))
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
int dp[n][2];
for (int i = 0; i < n; ++i)
{
dp[i][0]=0;
dp[i][1]=confidence[i];
}
for (int i = n-1; i >= 1; i--){
int nd = host[i];
if (protocol[i]==0){
dp[nd][0]+=max(dp[i][1],dp[i][0]);
dp[nd][1]+=dp[i][0];
}
else if (protocol[i]==1){
dp[nd][1]=max(dp[nd][1]+max(dp[i][0],dp[i][1]),dp[nd][0]+dp[i][1]);
dp[nd][0]+=dp[i][0];
}
else {
dp[nd][1]=max(dp[nd][1]+dp[i][0],dp[nd][0]+dp[i][1]);
dp[nd][0]+=dp[i][0];
}
}
return max(dp[0][0],dp[0][1]);
}