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"
#include <vector>
using namespace std;
typedef vector<int> vi;
int construct(vector<vector<int>> p) {
int n = p.size();
vector<std::vector<int>> adj(n, vi(n, 0));
for(int i=0;i<n;i++) adj[i][i] = 0;
for(int i=0;i<n-1;i++){
adj[i][i+1] = 1;
adj[i+1][i] = 1;
}
build(adj);
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... |