Submission #544378

#	Time	Username	Problem	Language	Result	Execution time	Memory
544378		sliviu	Friend (IOI14_friend)	C++17	35 / 100	1 ms	340 KiB

friend

#include <bits/stdc++.h>

using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]) {
	vector<pair<int, int>> dp(n);
	for (int i = 0; i < n; ++i)
		dp[i].first = confidence[i];
	for (int i = n - 1; i; --i) {
		int cur = host[i], last = i;
		if (protocol[i] == 0)
			dp[cur] = {dp[cur].first + dp[last].second,dp[cur].second + max(dp[last].first,dp[last].second)};
		else if (protocol[i] == 1)
			dp[cur] = {dp[cur].first + max(dp[last].first,dp[last].second),dp[cur].second + max(dp[last].first,dp[last].second)};
		else
			dp[cur] = {max(dp[cur].first + dp[last].second,dp[cur].second + dp[last].first),dp[cur].second + dp[last].second};
	}
	return max(dp[0].first, dp[0].second);
}

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