Submission #697461

#TimeUsernameProblemLanguageResultExecution timeMemory
697461DeepessonFriend (IOI14_friend)C++17
8 / 100
1 ms316 KiB
#include <bits/stdc++.h> // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int sum=0; for(int i=0;i!=n;++i)sum=std::max(sum,confidence[i]); return sum; }
#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...