| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1353425 | nikulid | 슈퍼트리 잇기 (IOI20_supertrees) | C++20 | 0 ms | 348 KiB |
#include "supertrees.h"
#include <vector>
using namespace std;
int construct(vector<vector<int>> p) {
int n = p.size();
// assume test case 1.
vector<vector<int>> answer(n, vector<int>(n,0));
answer[0] = vector<int>(n,1);
build(answer);
return 1;
}
| # | 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... | ||||
