Submission #239637

#	Time	Username	Problem	Language	Result	Execution time	Memory
239637		super_j6	Friend (IOI14_friend)	C++14	100 / 100	42 ms	2740 KiB

friend

#include "friend.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

int findSample(int n, int a[], int p[], int b[]){
	int ret = 0;
	for(int i = n - 1; i; i--){
		switch(b[i]){
			case 0:
				ret += a[i];
				a[p[i]] = max(a[p[i]] - a[i], 0);
				break;
			case 1:
				a[p[i]] += a[i];
				break;
			case 2:
				a[p[i]] = max(a[p[i]], a[i]);
				break;
		}
	}
	
	return ret + a[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