제출 #231885

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
231885		AlexLuchianov	친구 (IOI14_friend)	C++14	100 / 100	37 ms	3448 KiB

friend

#include "friend.h"
#include <iostream>

using namespace std;

// Find out best sample
int const nmax = 100000;

pair<int, int> dp[1 + nmax];

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;0 < i; i--){
    int par = host[i];
    if(protocol[i] == 0)
      dp[par] = {dp[par].first + dp[i].second, dp[par].second + dp[i].first};
    else if(protocol[i] == 1)
      dp[par] = {dp[par].first + dp[i].first, dp[par].second + dp[i].second};
    else if(protocol[i] == 2)
      dp[par] = {dp[par].first + dp[i].first, max(dp[par].first + dp[i].second, dp[par].second + dp[i].first)};
    dp[par].second = max(dp[par].first, dp[par].second);
  }

  return dp[0].second;
}

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