Submission #815118

#TimeUsernameProblemLanguageResultExecution timeMemory
815118LiudasFriend (IOI14_friend)C++17
8 / 100
1 ms260 KiB
#include "friend.h" #include<bits/stdc++.h> using namespace std; int findSample(int n,int confidence[],int host[],int protocol[]){ return (count(protocol, protocol + n, 1) == n ? accumulate(confidence, confidence + n, 0ll) : *max_element(confidence, confidence + n)); }
#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...