#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 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... |