Submission #783564

#TimeUsernameProblemLanguageResultExecution timeMemory
783564ShithilaConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
136 ms22028 KiB
#include "supertrees.h" #include <vector> using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); vector<vector<int>> ans(n,vector<int>(n,0)); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(i+1==j) { ans[i][j]=1; } else if(i-1==j) { ans[i][j]=1; } else ans[i][j]=0; } } 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...