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 <vector>
#include<bits/stdc++.h>
using namespace std;
vector<vector<int> >erg;
int construct(vector<vector<int>> p) {
int n = p.size();
for(int i = 0 ; i < n ; i++){
erg.push_back(vector<int>() );
for(int j = 0 ; j < n ; j++){
erg[i].push_back(0);
}
}
for(int i = 0 ; i < n - 1 ; i++){
erg[i][i + 1] = 1;
erg[i + 1][i] = 1;
}
build(erg);
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... |