제출 #792036

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