Submission #927911

#	Time	Username	Problem	Language	Result	Execution time	Memory
927911		TAhmed33	Friend (IOI14_friend)	C++98	100 / 100	25 ms	3412 KiB

friend

#include <bits/stdc++.h>
using namespace std;
int findSample (int n, int confidence[], int host[], int protocol[]) {
	int p[n] = {}, q[n] = {};
	for (int i = 0; i < n; i++) p[i] = confidence[i];
	for (int i = n - 1; i >= 1; i--) {
		int p1 = p[i], q1 = q[i];
		if (protocol[i] == 2) {
			p[host[i]] = max(p[host[i]] + q1, p1 + q[host[i]]);
			q[host[i]] += q1;
		} else if (protocol[i] == 1) {
			p[host[i]] = max({q[host[i]] + p1, p[host[i]] + q1, p1 + p[host[i]]});
			q[host[i]] += q1;
		} else {
			p[host[i]] += q1;
			q[host[i]] += max(p1, q1);
		}
	}
	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