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 <cstdio>
using namespace std;
typedef vector<int> vi;
int abs_(int a) { return a > 0 ? a : -a; }
int construct(vector<vi> pp) {
int n = pp.size(), i, j;
vector<vi> aa(n);
for (i = 0; i < n; i++) {
aa[i].resize(n);
for (j = 0; j < n; j++)
aa[i][j] = abs_(i - j) == 1 ? 1 : 0;
}
build(aa);
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... |