Submission #114913

#	Time	Username	Problem	Language	Result	Execution time	Memory
114913		luciocf	Friend (IOI14_friend)	C++14	35 / 100	3 ms	512 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"

using namespace std;

const int maxn = 1e5+10;

int dp[2][maxn];

int findSample(int n, int confidence[], int host[], int protocol[])
{
	for (int i = 0; i < n; i++)
		dp[1][i] = confidence[i];

	for (int i = n-1; i > 0; i--)
	{
		if (protocol[i] == 0)
		{
			dp[0][host[i]] += max(dp[0][i], dp[1][i]);

			dp[1][host[i]] += dp[0][i];
		}
		else if (protocol[i] == 1)
		{
			dp[0][host[i]] += dp[0][i];

			dp[1][host[i]] += max(dp[0][i], dp[1][i]);
		}
		else
		{
			int prev = dp[0][host[i]];

			dp[0][host[i]] += dp[0][i];

			dp[1][host[i]] = max(prev+dp[1][i], dp[1][host[i]]+dp[0][i]);
		}
	}

	return max(dp[0][0], dp[1][0]);
}

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