Submission #301804

#TimeUsernameProblemLanguageResultExecution timeMemory
301804VEGAnnConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
249 ms22104 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer; for (int i = 0; i < n; i++) { std::vector<int> row; row.resize(n); if (i + 1 < n) row[i + 1] = 1; if (i - 1 >= 0) 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...