Submission #866552

#	Time	Username	Problem	Language	Result	Execution time	Memory
866552		Onur_Ilgaz	친구 (IOI14_friend)	C++17	100 / 100	26 ms	3152 KiB

friend

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

// Find out best sample
int findSample(int n,int p[],int par[],int protocol[]){
	vector <int> q(n);
	for(int i = n-1; i > 0; i--) {
		int to = par[i];
		if(protocol[i] == 0) {
			p[to] = p[to] + q[i];
			q[to] = max(q[i], p[i]) + q[to];
		}
		if(protocol[i] == 1) {
			p[to] = max({p[to] + p[i], p[to] + q[i], p[i] + q[to]});
			q[to] = q[i] + q[to];
		}
		if(protocol[i] == 2) {
			p[to] = max(p[to] + q[i], p[i] + q[to]);
			q[to] = q[i] + q[to];
		}
	}
	return max(p[0], q[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