Submission #363667

#	Time	Username	Problem	Language	Result	Execution time	Memory
363667		silverfish	Friend (IOI14_friend)	C++14	16 / 100	1 ms	512 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1e5+1;
 
int dp[N][2];
 
int findSample(int n, int conf[],int host[],int protocol[]){

	for(int i = 0; i < n; ++i) dp[i][1] = conf[i];
	for(int i = n-1; i >= 1; --i){

		if(protocol[i] == 0){
			dp[host[i]][0] = max({dp[i][0], dp[i][1], dp[host[i]][0]});
			dp[host[i]][1] += dp[i][0];
		}else if(protocol[i] == 1){
			dp[host[i]][0] += dp[i][1];
			dp[host[i]][1] += max(dp[i][1], dp[i][0]);
		}else if(protocol[i] == 2){
			dp[host[i]][0] = max({dp[i][0], dp[i][1], dp[host[i]][0]});
			dp[host[i]][1] += dp[i][1] - conf[i];
		}
	}

	return max(dp[0][0], dp[0][1]);
}

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