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;
int findSample(int n,int confidence[],int host[],int protocol[])
{
int sum=0,maxi=0;
bool one=1,two=1;
for(int i=1;i<n;i++)
{
if(protocol[i]!=1)one=0;
if(protocol[i]!=2)two=0;
sum=sum+confidence[i];
maxi=max(maxi,confidence[i]);
}
if(one)return sum;
if(two)return maxi;
assert(0==1);
}
# | 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... |