제출 #1299916

#제출 시각아이디문제언어결과실행 시간메모리
1299916opeleklanos슈퍼트리 잇기 (IOI20_supertrees)C++20
11 / 100
88 ms22016 KiB
#include <iostream>
#include <vector>
#include "supertrees.h"
using namespace std;

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