제출 #302760

#제출 시각아이디문제언어결과실행 시간메모리
302760Jarif_Rahman슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
253 ms22264 KiB
#include "supertrees.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
int construct(vector<vector<int>> p){
    int n = p.size();
    vector <vector<int>> v(n, vector<int>(n, 0));
    for(int i = 0; i < n - 1; i++){
        v[i][i+1] = 1;
        v[i+1][i] = 1;
    }
    build(v);
    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...