Submission #430692

#	Time	Username	Problem	Language	Result	Execution time	Memory
430692		frodakcin	Friend (IOI14_friend)	C++17	100 / 100	33 ms	3396 KiB

friend

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

template<typename T> bool ckmax(T& a, const T& b) {return b>a?a=b,1:0;}
template<typename T> bool ckmin(T& a, const T& b) {return b<a?a=b,1:0;}

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[])
{
	std::vector<std::array<int, 2> > dp(n);
	//0) I am not used
	//1) I am used
	for(int i=0;i<n;++i)
		dp[i]={0, confidence[i]};
	for(int i=n-1;i>0;--i)
	{
		int h = host[i];
		if(protocol[i] == 0)
		{
			dp[h][0] += std::max(dp[i][0], dp[i][1]);
			dp[h][1] += dp[i][0];
		}
		else if(protocol[i] == 1)
		{
			dp[h][1] += std::max(dp[i][0], dp[i][1]);
			ckmax(dp[h][1], dp[h][0]+dp[i][1]);
			dp[h][0] += dp[i][0];
		}
		else if(protocol[i] == 2)
		{
			dp[h][1] += dp[i][0];
			ckmax(dp[h][1], dp[h][0]+dp[i][1]);
			dp[h][0] += dp[i][0];
		}
	}
	return std::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