Submission #986944

#	Time	Username	Problem	Language	Result	Execution time	Memory
986944		zsombor	Friend (IOI14_friend)	C++17	100 / 100	25 ms	2644 KiB

friend

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

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

• Subtask 1: 11 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31