Submission #300193

#TimeUsernameProblemLanguageResultExecution timeMemory
300193VladaMG98Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
241 ms22100 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<std::vector<int>> p) { int n = p.size(); vector<vector<int>> answer; for (int i = 0; i < n; i++) { vector<int> row(n, 0); if (i > 0) row[i - 1] = 1; if (i < n - 1) row[i + 1] = 1; answer.push_back(row); } 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...