Submission #438678

#	Time	Username	Problem	Language	Result	Execution time	Memory
438678		prvocislo	Friend (IOI14_friend)	C++17	35 / 100	2 ms	332 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;

int findSample(int n,int c[],int h[],int t[]){
	vector<int> p(n, 0), q(n, 0);
	for (int i = 0; i < n; i++) p[i] = c[i];
	for (int i = n - 1; i > 0; i--)
	{
		if (t[i] == 0) 
		{
			p[h[i]] = p[h[i]] + q[i];
			q[h[i]] = max(q[h[i]] + q[i], q[h[i]] + p[i]);
		}
		if (t[i] == 1)
		{
			p[h[i]] = p[h[i]] + p[i];
			q[h[i]] = q[h[i]] + q[i];
		}
		if (t[i] == 2)
		{
			p[h[i]] = max(p[h[i]] + q[i], q[h[i]] + p[i]);
			q[h[i]] = q[h[i]] + q[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