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;
typedef vector<int> vi;
int construct(std::vector<std::vector<int>> p) {
vector<vi> bu;
int n=p.size();
bu.resize(n);
for(int i=0;i<n;i++) for(int j=0;j<n;j++) bu[i].push_back(0);
for(int i=0;i<n-1;i++){
bu[i][i+1]=bu[i+1][i]=1;
}
build(bu);
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... |