제출 #427296

#제출 시각아이디문제언어결과실행 시간메모리
427296magmag슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
228 ms23928 KiB
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;

void build(vector<vi> b);

int construct(vector<vi> p) {
    int n = p.size();

    vector<vi> ans(n, vi(n, 0));

    for (int i = 1; i < n; ++i) {
        ans[0][i] = 1;
        ans[i][0] = 1;
    }
    build(ans);
    return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...