제출 #722281

#제출 시각아이디문제언어결과실행 시간메모리
722281speedyArda친구 (IOI14_friend)C++14
100 / 100
25 ms2640 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 ans=0; for(int i = n - 1; i >= 1; i--) { int h = host[i]; if(protocol[i] == 0) { ans += confidence[i]; if(confidence[i] > confidence[h]) { confidence[h] = 0; } else { confidence[h] -= confidence[i]; } } else if(protocol[i] == 1) { confidence[h] += confidence[i]; } else if(protocol[i] == 2) { confidence[h] = max(confidence[h], confidence[i]); } if(i == 1) ans += confidence[h]; } return ans; }
#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...