Submission #1167026

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167026		HappyCapybara	Friend (IOI14_friend)	C++17	100 / 100	16 ms	2192 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]){
	vector<int> a(n), b(n, 0);
	for (int i=0; i<n; i++) a[i] = confidence[i];
	for (int i=n-1; i>=1; i--){
		if (protocol[i] == 0){
			a[host[i]] += b[i];
			b[host[i]] += max(a[i], b[i]);
		}
		if (protocol[i] == 1){
			a[host[i]] = max(a[host[i]]+max(a[i], b[i]), a[i]+b[host[i]]);
			b[host[i]] += b[i];
		}
		if (protocol[i] == 2){
			a[host[i]] = max(a[host[i]]+b[i], a[i]+b[host[i]]);
			b[host[i]] += b[i];
		}
	}
	return max(a[0], b[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