Submission #304860

#TimeUsernameProblemLanguageResultExecution timeMemory
304860daveeedConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
257 ms22136 KiB
#include "supertrees.h" #include <vector> const int MAXN = 1000; 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); } for(int i = 1; i < n; i++){ answer[0][i] = 1; answer[i][0] = 1; } build(answer); 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...