Submission #456118

#TimeUsernameProblemLanguageResultExecution timeMemory
456118BT21tataConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
234 ms22024 KiB
#include "supertrees.h"
#include<bits/stdc++.h>

using namespace std;

int construct(vector<vector<int>> p)
{
	int n = p.size();
	vector<vector<int>> ans;
	ans.resize(n);
	for (int i = 0; i < n; i++)
	{
		ans[i].resize(n);
	}
	for(int i=0; i<n-1; i++)
		ans[i][i+1]=ans[i+1][i]=1;
	build(ans);
	return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...