Submission #133381

#	Time	Username	Problem	Language	Result	Execution time	Memory
133381		MohamedAhmed04	Friend (IOI14_friend)	C++14	100 / 100	38 ms	3064 KiB

friend

#include "friend.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

using namespace std ;

int findSample(int n,int confidence[],int host[],int protocol[])
{
	int ans = 0 ;
	int val[n] ;
	for(int i = 0 ; i < n ; ++i)
		val[i] = confidence[i] ;
	for(int i = n-1 ; i >= 0 ; --i)
	{
		if(protocol[i] == 0)
		{
			ans += val[i] ;
			val[host[i]] -= val[i] ;
			val[host[i]] = max(0 , val[host[i]]) ;
		}
		else if(protocol[i] == 1)
			val[host[i]] += val[i] ;	
		else if(protocol[i] == 2)
			val[host[i]] = max(val[host[i]] , val[i]) ;
	}
	ans += val[0] ;
	return ans ;
}

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