Submission #456157

#TimeUsernameProblemLanguageResultExecution timeMemory
456157KhizriConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
283 ms21996 KiB
#include "supertrees.h" #include <vector> int construct(std::vector<std::vector<int>> arr) { int n = arr.size(); std::vector<std::vector<int>> ans; for (int i = 0; i < n; i++) { std::vector<int> row; row.resize(n); ans.push_back(row); } for(int i=0;i<n-1;i++){ ans[i][i+1]=1; ans[i+1][i]=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...