Submission #693986

#TimeUsernameProblemLanguageResultExecution timeMemory
693986T0p_Connecting Supertrees (IOI20_supertrees)C++14
11 / 100
166 ms23932 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; for (int i=0 ; i<n ; i++) { vector<int> tmp; for (int j=0 ; j<n ; j++) tmp.push_back((i+1 == j || i-1 == j ? 1 : 0)); ans.push_back(tmp); } 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...