제출 #1065821

#제출 시각아이디문제언어결과실행 시간메모리
1065821Mr_Husanboy친구 (IOI14_friend)C++17
0 / 100
1 ms348 KiB
#include "friend.h" #include<vector> #include <algorithm> #include <iostream> #include <assert.h> using namespace std; // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ vector<array<int, 2>> dp(n); for(int i = n - 1; i > 0; i --){ int par = host[i]; dp[par][0] += max(dp[i][0], dp[i][1]); dp[par][1] += dp[i][0]; } return max(dp[0][0], dp[0][1]); }
#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...