Submission #137708

#	Time	Username	Problem	Language	Result	Execution time	Memory
137708		mohammedehab2002	Friend (IOI14_friend)	C++11	100 / 100	37 ms	2680 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
int findSample(int n,int a[],int p[],int t[])
{
	int ans=0;
	for (int i=n-1;i>=0;i--)
	{
		if (a[i]<0)
		continue;
		if (!t[i])
		{
			ans+=a[i];
			a[p[i]]-=a[i];
		}
		else if (t[i]==1)
		a[p[i]]=max(a[p[i]],0)+a[i];
		else
		a[p[i]]=max(a[p[i]],a[i]);
	}
	return ans+max(a[0],0);
}

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