# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1124249 | allin27x | 친구 (IOI14_friend) | C++20 | 0 ms | 324 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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |