Submission #116282

#	Time	Username	Problem	Language	Result	Execution time	Memory
116282		nvmdava	Friend (IOI14_friend)	C++17	100 / 100	35 ms	3448 KiB

friend

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

int ie[100005], oe[100005];

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