Submission #298200

#	Time	Username	Problem	Language	Result	Execution time	Memory
298200		mieszko11b	Friend (IOI14_friend)	C++14	100 / 100	37 ms	3448 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

int p[100007], q[100007];

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