Submission #94502

#	Time	Username	Problem	Language	Result	Execution time	Memory
94502		fjzzq2002	Friend (IOI14_friend)	C++14	100 / 100	32 ms	3576 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define SZ 666666
int f[SZ],g[SZ];
int findSample(int n,int c[],int fa[],int p[]){
	for(int i=0;i<n;++i) f[i]=c[i];
	for(int i=n-1;i>0;--i)
	{
		int t=fa[i];
		if(p[i]==0)
			f[t]+=g[i],g[t]+=max(f[i],g[i]);
		else if(p[i]==1)
			f[t]=max(f[t]+max(f[i],g[i]),g[t]+f[i]),g[t]+=g[i];
		else
			f[t]=max(f[t]+g[i],g[t]+f[i]),g[t]+=g[i];
	}
	return max(f[0],g[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