Submission #800169

#	Time	Username	Problem	Language	Result	Execution time	Memory
800169		pavement	Friend (IOI14_friend)	C++17	100 / 100	22 ms	2592 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;

// Find out best sample
int findSample(int n, int confidence[], int host[], int protocol[]) {
	int ans = 0;
	for (int i = n - 1; i >= 1; i--) {
		if (protocol[i] == 0) {
			ans += confidence[i];
			confidence[host[i]] = max(0, confidence[host[i]] - confidence[i]);
		} else if (protocol[i] == 1) {
			confidence[host[i]] += confidence[i];
		} else {
			confidence[host[i]] = max(confidence[host[i]], confidence[i]);
		}
	}
	return ans + confidence[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