Submission #829501

#	Time	Username	Problem	Language	Result	Execution time	Memory
829501		KoD	Friend (IOI14_friend)	C++17	100 / 100	26 ms	3464 KiB

friend

#include "friend.h"
#include <algorithm>
#include <vector>
using namespace std;

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