| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1312921 | tuncay_pasha | 슈퍼트리 잇기 (IOI20_supertrees) | C++20 | 86 ms | 22000 KiB |
#include "supertrees.h"
#include <vector>
using namespace std;
int construct(std::vector<std::vector<int>> p)
{
int n = size(p.front());
vector<vector<int>> ans(n, vector<int>(n, 0));
for (int i = 1; i < n; ++i) ans[0][i] = ans[i][0] = 1;
build(ans);
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... | ||||
