| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 741609 | vjudge1 | Friend (IOI14_friend) | C++98 | 0 ms | 0 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 <iostream>
#include<friend.h>
using namespace std;
int findSample(int n, int confidence[], int host[], int protocol[]);
{
long long int suma=0, maxx=-1;
for(int i=0; i<n; i++)
{
cin>>confidence[i];
if(confidence[i]>maxx)
maxx=confidence[i];
suma+=confidence[i];
}
bool kiki=true, mimi=true;
for(int i=0; i<n; i++)
{
cin>>protocol[i];
if(protocol[i]!=1)
kiki=false;
if(protocol[i]!=2)
mimi=false;
}
if(mimi)
return(maxx);
if(kiki)
return(suma);
}