Submission #233232

#	Time	Username	Problem	Language	Result	Execution time	Memory
233232		anonymous	Friend (IOI14_friend)	C++14	35 / 100	5 ms	384 KiB

friend

#include "friend.h"
#include <iostream>
// Find out best sample
int dp[100005][2];
int findSample(int n,int confidence[],int host[],int protocol[]){
	for (int i=n-1; i>=0; i--) {
        dp[i][0] = confidence[i];
	}
	for (int i=n-1; i>0; i--) {
        if (protocol[i] == 0) {
            dp[host[i]][0] += dp[i][1];
            dp[host[i]][1] += std::max(dp[i][0],dp[i][1]);
        } else if (protocol[i] == 1) {
            dp[host[i]][0] += dp[i][0];
            dp[host[i]][1] += dp[i][1];
        } else {
            dp[host[i]][1] += dp[i][1];
            dp[host[i]][0] = std::max(dp[host[i]][0] + dp[i][1], dp[host[i]][1] + dp[i][0]);
        }
	}
	return(std::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