Submission #73587

#TimeUsernameProblemLanguageResultExecution timeMemory
73587MKopchevFriend (IOI14_friend)C++14
16 / 100
3 ms956 KiB
#include<bits/stdc++.h>
#include "friend.h"
using namespace std;
int findSample(int n,int confidence[],int host[],int protocol[])
{
    int sum=confidence[0],maxi=confidence[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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...