Submission #825813

#	Time	Username	Problem	Language	Result	Execution time	Memory
825813		loctildore	Friend (IOI14_friend)	C++14	100 / 100	24 ms	3068 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
// trans rights
#define ll long long
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x), end(x)
#define MOD 1000000009
int p[100069], q[100069];

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; i--) {
		int x = host[i];
		if (!protocol[i]) {
			p[x] += q[i];
			q[x] += max(p[i], q[i]);
		}
		else {
			if (protocol[i] == 1) {
				p[x] = max(p[x] + p[i], max(p[x] + q[i], q[x] + p[i]));
			}
			else p[x] = max(p[x] + q[i], q[x] + p[i]);
			q[x] += 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