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[]){
//~ for(int i=1;i<n;i++){
//~ if(protocol[i]==0){
//~ v[host[i]].pb(i);
//~ v[i].pb(host[i]);
//~ continue;
//~ }
//~ if(protocol[i]==1){
//~ for(int j=0;j<(int)v[node].size();j++){
//~ }
//~ }
//~ }
int ans=0;
for(int i=0;i<n;i++){
ans+=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... |