제출 #233236

#제출 시각아이디문제언어결과실행 시간메모리
233236spdskatr친구 (IOI14_friend)C++14
58 / 100
41 ms2296 KiB
#include "friend.h" #include <algorithm> int dp[100005][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 >= 1; i--) { if (protocol[i] == 0) { dp[host[i]][0] += dp[i][1]; dp[host[i]][1] += dp[i][0]; } else if (protocol[i] == 1) { dp[host[i]][0] += dp[i][0]; dp[host[i]][1] += dp[i][1]; } else { dp[host[i]][0] = std::max(dp[host[i]][0], dp[i][0]); dp[host[i]][1] += dp[i][1]; } dp[host[i]][0] = std::max(dp[host[i]][0], dp[host[i]][1]); } return 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...