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 <iostream>
#include <vector>
#include "supertrees.h"
using namespace std;
int construct(vector<vector<int>> p){
int N = (int)p.size();
vector<vector<int>> b = vector<vector<int>>(N, vector<int>(N, 0));
b[0][1] = 1;
for(int i=1; i<N; i++){
b[i][i-1] = 1;
if(i+1 < N) b[i][i+1] = 1;
}
build(b);
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... |