Submission #974004

#TimeUsernameProblemLanguageResultExecution timeMemory
974004AliHasanliConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
147 ms23212 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int> > p) { int n = p.size(); vector<vector<int> > answer(n, vector<int>(n, 0)); for(int i=0;i<n;i++) for(int j=0;j<n;j++) 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...