Submission #329535

#TimeUsernameProblemLanguageResultExecution timeMemory
329535pggpConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
252 ms23532 KiB
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

int construct(vector< vector < int > > p){
	int n = p.size();
	vector < vector < int > > b;
	b.resize(n);
	for (int i = 0; i < n; ++i)
	{
		b[i].resize(n);
		for (int j = 0; j < n; ++j)
		{
			b[i][j] = 0;
			if(j == i + 1 or i == j + 1){
				b[i][j] = 1;
			}
		}
	}
	build(b);
	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...