Submission #233237

#	Time	Username	Problem	Language	Result	Execution time	Memory
233237		spdskatr	Friend (IOI14_friend)	C++14	100 / 100	39 ms	2304 KiB

friend

#include "friend.h"
#include <algorithm>

int dp[100005][2];
int findSample(int n,int confidence[],int host[],int protocol[]){
	for (int i = 0; i < n; i++) dp[i][0] = confidence[i];
	for (int i = n-1; i >= 1; i--) {
		if (protocol[i] == 0) {
			dp[host[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] += dp[i][1];
		} else {
			dp[host[i]][0] = std::max(dp[host[i]][0] + dp[i][1], dp[i][0] + dp[host[i]][1]);
			dp[host[i]][1] += dp[i][1];
		}
		dp[host[i]][0] = std::max(dp[host[i]][0], dp[host[i]][1]);
	}
	return dp[0][0];
}

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