제출 #1015257

#제출 시각아이디문제언어결과실행 시간메모리
1015257amirhoseinfar1385Friend (IOI14_friend)C++17
8 / 100
1 ms604 KiB
#include "friend.h" #include<bits/stdc++.h> using namespace std; const int maxn=100000+10; // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int res=0; for(int i=0;i<n;i++){ res=max(res,confidence[i]); } return res; }
#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...