Submission #973954

#TimeUsernameProblemLanguageResultExecution timeMemory
973954AliHasanliConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
1 ms348 KiB
#include "supertrees.h" #include <vector> #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer; answer.resize(n); for(int i=0;i<n;i++) answer.resize(n); for(int i=0;i<n;i++) for(int j=0;j<n;j++) { answer[i][j]=0; if(p[i][j]>=3)return 0; } for(int i=0;i<n-1;i++) answer[i][i+1]=1,answer[i+1][i]=1; 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...