Submission #1065867

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065867		Mr_Husanboy	Friend (IOI14_friend)	C++17	100 / 100	35 ms	3476 KiB

friend

#include "friend.h"
#include<vector>
#include <algorithm>
#include <iostream>
#include <assert.h>
using namespace std;
 
// Find out best sample
 

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

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