제출 #1168934

#제출 시각아이디문제언어결과실행 시간메모리
1168934anmattroiFriend (IOI14_friend)C++17
8 / 100
1 ms328 KiB
#include "friend.h" #include <bits/stdc++.h> #define maxn 100005 using namespace std; int findSample(int n, int confidence[], int host[], int protocol[]){ int ans = 0; for (int i = 0; i < n; i++) ans = max(ans, confidence[i]); return ans; } /* 6 13 3 6 20 10 15 0 0 0 1 1 2 2 1 0 0 */
#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...