제출 #1124250

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