제출 #868250

#제출 시각아이디문제언어결과실행 시간메모리
868250abcvuitunggioFriend (IOI14_friend)C++17
35 / 100
21 ms3156 KiB
#include "friend.h" #include <bits/stdc++.h> using namespace std; // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int val[n]={0}; for (int i=n-1;i;i--){ if (!protocol[i]){ confidence[host[i]]+=val[i]; val[host[i]]+=max(confidence[i],val[i]); continue; } val[host[i]]+=val[i]; int tmp=confidence[host[i]]; confidence[host[i]]=max(confidence[host[i]]+val[i],confidence[i]+val[host[i]]); if (protocol[i]==1) confidence[host[i]]=max(confidence[host[i]],tmp+confidence[i]); } return max(confidence[0],val[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...