Submission #1087027

#TimeUsernameProblemLanguageResultExecution timeMemory
1087027SulAConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
1 ms348 KiB
#include "supertrees.h" #include <iostream> #include <vector> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer(n, vector<int>(n, 0)); for (int i = 0; i < n-1; i++) { answer[i][i+1] = answer[i+1][i] = 1; } for (auto& row : answer) { for (int x : row) cout << x << " "; cout << "\n"; } 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...