Submission #223365

#	Time	Username	Problem	Language	Result	Execution time	Memory
223365		staniewzki	Friend (IOI14_friend)	C++17	100 / 100	40 ms	3448 KiB

friend

#include<bits/stdc++.h>
using namespace std;
 
#define REP(i, n) for(int i = 0; i < n; i++)

using PII = pair<int, int>;
#define ST first
#define ND second

int findSample(int n, int confidence[], int host[], int protocol[]){
	vector<PII> dp(n);
	REP(i, n) dp[i] = {confidence[i], 0};
	for(int i = n - 1; i >= 1; i--) {
		int j = host[i];
		if(protocol[i] == 0) {
			dp[j] = {
				dp[j].ST + dp[i].ND,
				dp[j].ND + max(dp[i].ST, dp[i].ND)
			};
		}
		else if(protocol[i] == 1) {
			dp[j] = {
				max({dp[j].ST + dp[i].ST, dp[j].ST + dp[i].ND, dp[j].ND + dp[i].ST}),
				dp[i].ND + dp[j].ND
			};
		}
		else if(protocol[i] == 2) {
			dp[j] = {
				max(dp[j].ST + dp[i].ND, dp[j].ND + dp[i].ST),
				dp[j].ND + dp[i].ND
			};
		}
	}
	return max(dp[0].ST, dp[0].ND);
}

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