Submission #846876

#TimeUsernameProblemLanguageResultExecution timeMemory
846876detaomegaConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
165 ms23940 KiB
#include "supertrees.h" #include <bits/stdc++.h> #include <vector> using namespace std; 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); for (int j = 0; j < n; j++) { if (abs(i - j) == 1) { row[j] = 1; } else { row[j] = 0; } } 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...