Submission #403449

#TimeUsernameProblemLanguageResultExecution timeMemory
403449victoriadConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
262 ms24056 KiB
#include "supertrees.h" #include <vector> #include <cmath> #include <cstdio> using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); vector<vector<int> >r(n); for(int i=0;i<n;i++){ for(int k=0;k<n;k++){ int x=0; if(i>0 && k==i-1){ x=1; } else if(i<n-1 && k==i+1){ x=1; } r[i].push_back(x); } } build(r); 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...