Submission #721913

#TimeUsernameProblemLanguageResultExecution timeMemory
721913danikoynovConnecting Supertrees (IOI20_supertrees)C++14
0 / 100
1 ms300 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, 0); answer.push_back(row); } for (int i = 0; i < n; i ++) for (int j = 0; j < n; j ++) { if (abs(i - j)) answer[i][j] = 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...