Submission #73585

#TimeUsernameProblemLanguageResultExecution timeMemory
73585MKopchevFriend (IOI14_friend)C++14
8 / 100
4 ms832 KiB
#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 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...