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"
#include <algorithm>
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>=0; i--) {
if (protocol[i]==0) {
ans+=confidence[i];
confidence[host[i]]=max(0,confidence[host[i]]-confidence[i]);
}
if (protocol[i]==1) {
confidence[host[i]]+=confidence[i];
}
if (protocol[i]==2) {
confidence[host[i]]=max(confidence[host[i]],confidence[i]);
}
}
return ans;
}
# | 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... |