Submission #1046522

#	Time	Username	Problem	Language	Result	Execution time	Memory
1046522		Sharky	Friend (IOI14_friend)	C++17	100 / 100	14 ms	2380 KiB

friend

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

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