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 <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]==0){
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[i],tmp+confidence[i]);
}
return max(confidence[0],val[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... |