Submission #483152

#TimeUsernameProblemLanguageResultExecution timeMemory
483152rc_catuntaConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
192 ms22148 KiB
#include "supertrees.h" #include <vector> #include <iostream> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer; answer.assign(n,vector<int>(n)); for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(j-i==1 or i-j==1){ answer[i][j]=1; } } } /*for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cout<<answer[i][j]<<" "; } cout<<endl; }*/ build(answer); 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...