Submission #114498

#	Time	Username	Problem	Language	Result	Execution time	Memory
114498		E869120	Friend (IOI14_friend)	C++14	100 / 100	31 ms	3200 KiB

friend

#include "friend.h"
#include <iostream>
#include <algorithm>
using namespace std;
int x1[100009], x2[100009];
int findSample(int n, int confidence[], int host[], int protocol[]) {
	for (int i = 0; i < n; i++) x1[i] = confidence[i];
	for (int i = n - 1; i >= 1; i--) {
		if (protocol[i] == 2) { int D1 = max({ x1[host[i]] + x2[i], x2[host[i]] + x1[i] }), D2 = x2[host[i]] + x2[i]; x1[host[i]] = D1; x2[host[i]] = D2; }
		if (protocol[i] == 1) { int D1 = max({ x1[host[i]] + x1[i], x1[host[i]] + x2[i], x2[host[i]] + x1[i] }), D2 = x2[host[i]] + x2[i]; x1[host[i]] = D1; x2[host[i]] = D2; }
		if (protocol[i] == 0) { int D1 = max({ x2[host[i]] + x1[i], x2[host[i]] + x2[i] }), D2 = x1[host[i]] + x2[i]; x1[host[i]] = D2; x2[host[i]] = D1; }
	}
	return max(x1[0], x2[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