Submission #652019

#TimeUsernameProblemLanguageResultExecution timeMemory
652019mychecksedad슈퍼트리 잇기 (IOI20_supertrees)C++17
0 / 100
1 ms304 KiB
#include "supertrees.h" #include <bits/stdc++.h> int construct(std::vector<std::vector<int>> p) { int n = p.size(); std::vector<std::vector<int>> answer; for (int i = 0; i < n; i++) { std::vector<int> row; row.resize(n); answer.push_back(row); } bool ok = 1; build(answer); return ok; }
#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...