제출 #1124257

#제출 시각아이디문제언어결과실행 시간메모리
1124257allin27x친구 (IOI14_friend)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> using namespace std; #include "friend.h" int findSample(int n, int c[],int h[],int t[]){ int mx = 0; for (int i=1; i<n; i++) mx = max(mx,c[h[i]]+ c[i]); return max(mx, *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...