| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1237606 | lunarecho | 슈퍼트리 잇기 (IOI20_supertrees) | C++20 | 0 ms | 328 KiB |
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long;
int construct(vector<vector<int>> p) {
int n = p.size();
if(n == 1)
{
build({{0}});
return 0;
}
vector<vector<int>> ways(n,vector<int>(n,0));
for(int i=1;i<n;++i)
{
ways[0][i] = 1;
ways[i][0] = 1;
}
build(ways);
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... | ||||
