This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
vector< vector<int> > ress;
ress.resize(n);
for (int i=0; i<n; i++) ress[i].resize(n);
for (int i=0; i<n; i++) for (int j=0; j<n; j++) ress[i][j]=0;
for (int i=0; i<n-1; i++)
{
ress[i][i+1]=1;
ress[i+1][i]=1;
}
build(ress);
return 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |