Submission #1228779

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228779		PlayVoltz	Friend (IOI14_friend)	C++20	100 / 100	17 ms	3084 KiB

friend

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

int findSample(int n, int c[], int h[], int p[]){
	vector<vector<int> > dp(2, vector<int>(n, 0));
	for (int i=0; i<n; ++i)dp[1][i]=c[i];
	for (int i=n-1;i;--i){
		if (!p[i])dp[0][h[i]]+=max(dp[1][i], dp[0][i]), dp[1][h[i]]+=dp[0][i];
		else if (p[i]==1)dp[1][h[i]]=max(dp[1][h[i]]+max(dp[0][i], dp[1][i]), dp[0][h[i]]+dp[1][i]), dp[0][h[i]]+=dp[0][i];
		else dp[1][h[i]]=max(dp[1][h[i]]+dp[0][i], dp[0][h[i]]+dp[1][i]), dp[0][h[i]]+=dp[0][i];
	}
	return max(dp[0][0], dp[1][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