# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313469 | kylych03 | Friend (IOI14_friend) | C++14 | 3 ms | 2688 KiB |
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>
//#include "grader.cpp"
using namespace std;
// Find out best sample
bool f[3];
vector <int> g[100001];
int findSample(int n,int confidence[],int host[],int protocol[]){
int sum=0, mx=0;
f[0]=f[1]=f[2]=false;
for(int i = 1 ; i < n;i++){
f[protocol[i]]=true;
}
for(int i =0; i < n; i++){
sum +=confidence[i];
mx = max(mx, confidence[i] );
}
if( f[0]==false && f[2]==false )
return sum;
if( f[0]==false && f[1]==false )
return mx;
if(n<=10){
}
}
Compilation message (stderr)
# | 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... |