Submission #1124249

#TimeUsernameProblemLanguageResultExecution timeMemory
1124249allin27xFriend (IOI14_friend)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> using namespace std; #include "friend.h" #define int long long signed findSample(signed n, signed c[],signed a[],signed b[]){ int mx = 0; for (int i=0; i<n; i++) mx = max(mx,(int) c[a[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...