Submission #16200

#	Time	Username	Problem	Language	Result	Execution time	Memory
16200		CodingBug	Friend (IOI14_friend)	C++98	100 / 100	35 ms	2256 KiB

friend

#include "friend.h"
#include <algorithm>
using namespace std;

// Find out best sample
int findSample(int n,int cf[],int h[],int pc[]){
	int i,c=0;
	for(i=n-1;i>0;i--){
        if(pc[i]==0){
            c+=cf[i];
            cf[h[i]]=max(cf[h[i]]-cf[i],0);
        }else if(pc[i]==1) cf[h[i]]+=cf[i];
        else cf[h[i]]=max(cf[h[i]],cf[i]);
	}
	return c+cf[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