제출 #479663

#제출 시각아이디문제언어결과실행 시간메모리
479663zsombor친구 (IOI14_friend)C++17
100 / 100
38 ms2612 KiB
#include "friend.h" // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int ans = 0; for (int i = n; i > 0; i--) { if (protocol[i] == 0) { if (confidence[host[i]] - confidence[i] > 0) { confidence[host[i]] -= confidence[i]; } else { confidence[host[i]] = 0; } ans += confidence[i]; } if (protocol[i] == 1) confidence[host[i]] += confidence[i]; if (protocol[i] == 2 && confidence[i] > confidence[host[i]]) confidence[host[i]] = confidence[i]; } return ans + confidence[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...