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 <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
//void build(vector<vector<int> >);
int construct(vector<vector<int> > p) {
vector<vector<int> > ans;
int N = p.size();
ans.resize(N);
int i;
for(i=0;i<N;i++) ans[i].resize(N);
for(i=0;i<N-1;i++) {
ans[i][i+1] = 1;
ans[i+1][i] = 1;
}
build(ans);
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... |