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 <bits/stdc++.h>
#include "friend.h"
using namespace std;
/*******************/
// Find out best sample
#define pi pair<int,int>
#define ll long long
#define f first
#define s second
#define pb push_back
int findSample(int n,int confidence[],int host[],int protocol[]){
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... |