Submission #706184

#	Time	Username	Problem	Language	Result	Execution time	Memory
706184		LittleCube	Friend (IOI14_friend)	C++14	35 / 100	24 ms	3008 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll p[100002], q[100002];

// Find out best sample
int findSample(int n, int confidence[], int host[], int protocol[])
{
	for (int i = n - 1; i >= 0; i--)
		p[i] = confidence[i], q[i] = 0;
	for (int i = n - 1; i > 0; i--)
	{
		if (protocol[i] == 0)
		{
			q[host[i]] = max(q[host[i]] + q[i], q[host[i]] + p[i]);
			p[host[i]] = p[host[i]] + q[i];
		}
		else if (protocol[i] == 1)
		{
			q[host[i]] += q[i];
			p[host[i]] = max({p[host[i]] + q[i], p[host[i]] + p[i], q[host[i]] + p[i]});
		}
		else
		{
			q[host[i]] += q[i];
			p[host[i]] = max({p[host[i]] + q[i], q[host[i]] + p[i]});
		}
	}
	return max(p[0], q[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