제출 #1041879

#제출 시각아이디문제언어결과실행 시간메모리
1041879MarwenElarbi슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
96 ms23896 KiB
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
    std::vector<std::vector<int>> ans(n,vector<int> (n,0));
    for (int i = 0; i < n-1; i++) {
        ans[i][i+1]=1;
        ans[i+1][i]=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...