Submission #428553

#	Time	Username	Problem	Language	Result	Execution time	Memory
428553		TLP39	Friend (IOI14_friend)	C++14	35 / 100	38 ms	3412 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

int n;

///not chosen,chosen
int dp[100010][2];
int findSample(int N,int confidence[],int host[],int protocol[]){
    n=N;
    for(int i=0;i<n;i++)
    {
        dp[i][0]=0;
        dp[i][1]=confidence[i];
    }
    for(int i=n-1;i>0;i--)
    {
        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]][0]+=dp[i][0];
            dp[host[i]][1]=max(dp[host[i]][1]+max(dp[i][0],dp[i][1]),dp[host[i]][0]+dp[i][1]);
        }
        else
        {
            dp[host[i]][0]+=dp[i][0];
            dp[host[i]][1]=max(dp[host[i]][1]+dp[i][0],dp[host[i]][0]+dp[i][1]);
        }
    }
    return max(dp[0][0],dp[0][1]);
}

• Subtask 1: 0 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31