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 <vector>
using namespace std;
int construct(std::vector<std::vector<int> > p) {
int n = p.size();
std::vector<std::vector<int> > answer;
answer.resize(n);
for(int i=0;i<n;i++) answer[i].resize(n);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(i==j+1) answer[i][j]=1;
else if(i==j-1) answer[i][j]=1;
else answer[i][j]=0;
}
}
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... |