Submission #993715

#	Time	Username	Problem	Language	Result	Execution time	Memory
993715		firewater	Friend (IOI14_friend)	C++14	35 / 100	1 ms	1332 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
#define ll long long
#define N 100100
using namespace std;
// Find out best sample

int x,f[N],g[N];
int findSample(int n,int confidence[],int host[],int protocol[]){
	memset(f,0,sizeof(f));
	memset(g,0,sizeof(g));
	for(int i=0;i<n;++i)
		f[i]=confidence[i];
	for(int i=n-1;i>0;--i){
		x=host[i];
		if(protocol[i]==0)f[x]+=g[i],g[x]+=max(f[i],g[i]);
		else if(protocol[i]==1)f[x]+=max(f[i],g[i]),g[x]+=g[i];
		else f[x]=max(f[x]+g[i],g[x]+max(g[i],f[i])),g[x]+=g[i];
	}
	return max(f[0],g[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