# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071659 | Mardonbekhazratov | Friend (IOI14_friend) | C++17 | 1 ms | 600 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 <iostream>
#include <vector>
#include <array>
using namespace std;
int findSample(int n,int confidence[],int host[],int protocol[]){
vector<array<int,2>>dp(n,{0,0});
for(int i=0;i<n;i++) dp[i][1]=confidence[i];
for(int i=n-1;i>0;i--){
int x=host[i];
if(protocol[i]==0){
dp[x][1]+=dp[i][0];
dp[x][0]+=max(dp[i][0],dp[i][1]);
}
else if(protocol[i]&1){
dp[x][1]+=max(dp[i][1],dp[i][0]);
dp[x][0]+=dp[i][0];
}
else{
dp[x][1]=max(dp[x][1]+dp[i][0],dp[i][1]+dp[x][0]);
dp[x][0]+=dp[i][0];
}
// cout<<x<<' '<<dp[x][0]<<' '<<dp[x][1]<<'\n';
}
return max(dp[0][0],dp[0][1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |