Submission #874276

#	Time	Username	Problem	Language	Result	Execution time	Memory
874276		siewjh	Friend (IOI14_friend)	C++17	100 / 100	21 ms	3412 KiB

friend

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

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