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>> x){
int Size=x.size();
vector<vector<int>> built;
for(int i=0;i<Size;i++){
vector<int> New;
for(int j=0;j<Size;j++){
New.push_back(0);
}
if(i==0){
New[i+1]=1;
}
else if(i==Size-1){
New[i-1]=1;
}
else{
New[i+1]=1;
New[i-1]=1;
}
built.push_back(New);
build(built);
}
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... |