Submission #133695

#	Time	Username	Problem	Language	Result	Execution time	Memory
133695		antimirage	Friend (IOI14_friend)	C++14	100 / 100	37 ms	2680 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

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