| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1124257 | allin27x | 친구 (IOI14_friend) | C++20 | 0 ms | 324 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 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... | ||||
