제출 #397977

#제출 시각아이디문제언어결과실행 시간메모리
397977prvocislo친구 (IOI14_friend)C++17
8 / 100
1 ms332 KiB
#include <iostream> #include <vector> #include <algorithm> typedef long long ll; using namespace std; int findSample(int n, int c[], int h[], int p[]) { return *max_element(c, c + 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...