제출 #421123

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

int construct(vector<vector<int>> p){
    int N = (int)p.size(); 
    vector<vector<int>> b = vector<vector<int>>(N, vector<int>(N, 0));

    b[0][1] = 1;
    for(int i=1; i<N; i++){
        b[i][i-1] = 1;
        if(i+1 < N) b[i][i+1] = 1;
    }

    build(b);
    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...