Submission #67475

#	Time	Username	Problem	Language	Result	Execution time	Memory
67475		win11905	Friend (IOI14_friend)	C++11	100 / 100	43 ms	7464 KiB

friend

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

#define pii pair<int, int>
#define x first
#define y second

const int N = 1e5+5;

pii dp[N];

int findSample(int n, int cof[], int host[], int pro[]) {
	for(int i = 0; i < n; ++i) dp[i].x = cof[i];
	for(int i = n-1; i; --i) {
		pii &v = dp[host[i]], &u = dp[i];
		if(pro[i] == 0) v = pii(v.x + u.y, max(v.y + u.x, v.y + u.y));
		if(pro[i] == 1) v = pii(max({v.x + u.y, u.x + v.y, v.x + u.x}), v.y + u.y);
		if(pro[i] == 2) v = pii(max(v.x + u.y, v.y + u.x), v.y + u.y);
	}
	return max(dp[0].x, dp[0].y);
}

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