Submission #155154

#	Time	Username	Problem	Language	Result	Execution time	Memory
155154		Mercenary	Friend (IOI14_friend)	C++14	100 / 100	37 ms	3428 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

using namespace std;
const int maxn = 1e5 + 5;

int dp[maxn][2];

int findSample(int n,int confidence[],int host[],int protocol[]){
    for(int i = 0 ; i < n ; ++i){
        dp[i][0] = confidence[i];
    }
    for(int i = n - 1 ; i > 0 ; --i){
        int u = host[i];
        if(protocol[i] == 0){
            dp[u][0] += dp[i][1];
            dp[u][1] += max(dp[i][0] , dp[i][1]);
        }else if(protocol[i] == 1){
            dp[u][0] = max(dp[i][0] + max(dp[u][0] , dp[u][1]) , dp[i][1] + dp[u][0]);
            dp[u][1] += dp[i][1];
        }else{
            dp[u][0] = max(dp[u][0] + dp[i][1] , dp[u][1] + dp[i][0]);
            dp[u][1] += dp[i][1];
        }
    }
    return max(dp[0][0],dp[0][1]);
}

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