Submission #1223779

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223779		thinknoexit	Friend (IOI14_friend)	C++20	100 / 100	15 ms	1804 KiB

friend

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

int findSample(int n, int c[], int h[], int p[]) {
	int ans = 0;
	for (int i = n - 1;i > 0;i--) {
		if (p[i] == 0) {
			ans += c[i];
			c[h[i]] = max(0, c[h[i]] - c[i]);
		}
		else if (p[i] == 1) {
			c[h[i]] += c[i];
		}
		else {
			c[h[i]] = max(c[h[i]], c[i]);
		}
	}
	return ans + c[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