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>
#include<bits/stdc++.h>
using namespace std ;
int construct(vector<std::vector<int>> p) {
int n = p.size();
vector<std::vector<int>> answer;
//ঠিক সেই ক্ষেত্রে p[i][j] = 1
for (int i = 0; i < n; i++) {
vector<int> row (0 , 0);
row.resize(n);
answer.push_back(row);
}
for(int i = 0 ; i < n - 1; i ++)
answer[i][i + 1] = 1 , answer[i + 1][i] = 1 ;
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... |