제출 #432082

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