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 <bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>> p) {
int n = p.size();
// vector<int> rep(n);
vector<vector<int>> answer;
for (int i = 0; i < n; i++) {
vector<int> row;
row.assign(n,0);
if(i>0)row[i-1]=1;
if(i<n-1)row[i+1]=1;
answer.push_back(row);
}
build(answer);
return 1;
}
// 1, 1, 2, 2
// 1, 1, 2, 2
// 2, 2, 1, 2
// 2, 2, 2, 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... |