Submission #1078695

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078695		Faisal_Saqib	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	348 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> tree_case(n,vector<int>(n,1));
	if(p==tree_case)
	{
		for(int i=1;i<n;i++)
			for(int j=0;j<n;j++)
				tree_case[i][j]=0;
		build(tree_case);
		return 1;
	}
	else
	{
		// Forest case
	}
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	build(answer);
	return 1;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4