제출 #1343710

#제출 시각아이디문제언어결과실행 시간메모리
1343710ElyesChaabouni슈퍼트리 잇기 (IOI20_supertrees)C++20
11 / 100
92 ms22024 KiB
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
int construct(vector<vector<int>> p){
    int n=p[0].size();
    vector<vector<int>> ans(n,vector<int>());
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(j==i+1||j==i-1)ans[i].push_back(1);
            else ans[i].push_back(0);
        }
    }
    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...