#include "supertrees.h"
#include <vector>
using namespace std;
#define pb push_back
int construct(vector<vector<int>> p) {
int n = p.size();
vector<vector<int>> answer;
// test case 1 (line city)
vector<int> ns(n);
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
ns[j]=(j == i-1 || j == i+1);
}
answer.pb(ns);
}
build(answer);
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... |