Submission #731267

#TimeUsernameProblemLanguageResultExecution timeMemory
731267TheSahibConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
164 ms23928 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> ans(n, vector<int>(n)); for (int i = 0; i < n; i++) { if(i != 0){ ans[i][i - 1] = 1; } if(i != n - 1){ ans[i][i + 1] = 1; } } build(ans); 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...