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;
int construct(vector<vector<int>> p) {
// 1
int n = p.size();
vector<vector<int>> valasz;
valasz.resize(n);
for (int i=0; i<n; i++) valasz[i].resize(n);
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
valasz[i][j]=(abs(i-j)==1 ? 1 : 0);
}
}
build(valasz);
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... |