This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |