Submission #702077

#TimeUsernameProblemLanguageResultExecution timeMemory
702077PCTprobability친구 (IOI14_friend)C++17
100 / 100
24 ms6164 KiB
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
using ll = long long;
#define pb push_back
vector<int> g[100000];
int dp[100000][2];
ll con[100000];
int findSample(int n, int confidence[], int host[], int protocol[]){
  for(int i=0;i<n;i++) con[i]=confidence[i];
  for(int i=0;i<n;i++) dp[i][1]=con[i];
  for(int i=n-1;i>=1;i--){
    dp[i][1]=max(dp[i][1],dp[i][0]);
    if(protocol[i]==0){
      dp[host[i]][0]+=dp[i][1];
      dp[host[i]][1]+=dp[i][0];
    }
    if(protocol[i]==1){
      dp[host[i]][0]+=dp[i][0];
      dp[host[i]][1]+=dp[i][1];
    }
    if(protocol[i]==2){
      dp[host[i]][1]=max(dp[host[i]][0]+dp[i][1],dp[host[i]][1]+dp[i][0]);
      dp[host[i]][0]+=dp[i][0];
    }
    dp[host[i]][1]=max(dp[host[i]][1],dp[host[i]][0]);
  }
  return max(dp[0][1],dp[0][0]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...