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) {
    //subtask 1: star graph
	int n = p.size();
    // vector<vector<int>> ans();
    vector<vector<int>> ans(n, vector<int> (n));  
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            if(i==j) ans[i][j] = 1;
            else ans[i][j] = 0;
        }
    }
    for(int i=0; i<n; i++){
        ans[i][0] = 1;
        ans[0][i] = 1;
    }
    build(ans);
	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... |