Submission #741786

#	Time	Username	Problem	Language	Result	Execution time	Memory
741786		bane	Friend (IOI14_friend)	C++17	100 / 100	34 ms	6920 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
 
using namespace std;
int findSample(int n, int confidence[], int host[], int protocol[]){
	vector <vector <int>> dp(n, vector<int>(2, 0));
	for(int i = 0; i < n; i++)dp[i][1] = confidence[i];
	for (int i = n - 1; i>=1; --i) {
		if (!protocol[i]) {
			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]][1] += max(dp[i][0], dp[i][1]);
			dp[host[i]][1] = max(dp[host[i]][1], dp[host[i]][0] + dp[i][1]);
			dp[host[i]][0] += dp[i][0];
		} else {
			dp[host[i]][1] += dp[i][0];
			dp[host[i]][1] = max(dp[host[i]][1], dp[host[i]][0] + dp[i][1]);
			dp[host[i]][0] += dp[i][0];
 
		}
	}
	return max(dp[0][0], dp[0][1]);
}

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