Submission #981486

#TimeUsernameProblemLanguageResultExecution timeMemory
981486tamir1Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
151 ms24148 KiB
#include "supertrees.h" #include <vector> #include <bits/stdc++.h> using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(p[i][j]==3) return 0; } } if(n==1){ build({{0}}); return 1; } std::vector<std::vector<int>> answer; for (int i = 0; i < n; i++) { std::vector<int> row(n,0); if(i==0){ row[i+1]=1; } else if(i==n-1){ row[i-1]=1; } else{ row[i-1]=1; row[i+1]=1; } answer.push_back(row); } 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...