# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1162116 | just | 슈퍼트리 잇기 (IOI20_supertrees) | C++20 | 109 ms | 21980 KiB |
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;
#define vec vector
int construct(vec<vec<int>> p) {
int n = p.size();
vec<vec<int>> b(n, vec<int>(n, 0));
for (int i = 0; i < n - 1; i++) {
b[i][i + 1] = 1;
b[i + 1][i] = 1;
}
build(b);
return 1;
}
#ifndef EVAL
int main() {}
#endif
# | 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... |