# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1069205 | NeroZein | Friend (IOI14_friend) | C++17 | 1 ms | 2396 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;
int dp[100009][2][2];
int findSample(int n,int confidence[],int host[],int protocol[]){
for(int i=n-1;i>=0;i--) {
dp[i][1][0]+=confidence[i];
dp[i][1][1]+=confidence[i];
if(i==0)break;
int par=host[i];
if(protocol[i]==0)
{
dp[par][0][1] += dp[i][0][1];//ok
dp[par][0][0] += max(dp[i][1][1], dp[i][0][1]);//ok
dp[par][1][0] += dp[i][0][0];//ok
dp[par][1][1] += dp[i][0][0];//ok
}
if(protocol[i]==1)
{
dp[par][0][1]=max(dp[par][1][0] + dp[i][1][1], dp[par][0][1]+dp[i][0][0]);//ok
dp[par][0][0] = max(dp[par][1][0] + dp[i][0][1], dp[par][0][0] + dp[i][0][0]);//ok
dp[par][1][1] = max(dp[par][1][1] + dp[i][0][1], dp[par][1][0] + dp[i][1][1]);//ok
dp[par][1][0] += dp[i][0][1];//ok
}
if(protocol[i]==2)
{
dp[par][0][0]+=dp[i][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... |