제출 #312452

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