Submission #1041879

#TimeUsernameProblemLanguageResultExecution timeMemory
1041879MarwenElarbiConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
96 ms23896 KiB
#include <bits/stdc++.h> #include "supertrees.h" using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); std::vector<std::vector<int>> ans(n,vector<int> (n,0)); 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...