제출 #719097

#제출 시각아이디문제언어결과실행 시간메모리
719097mseebacher친구 (IOI14_friend)C++17
8 / 100
2 ms340 KiB
#include "friend.h" #include <bits/stdc++.h> using namespace std; #define MAX_N (int) 1e3+10 vector<int> friends[MAX_N]; // Find out best sample 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; }
#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...