Submission #783561

#TimeUsernameProblemLanguageResultExecution timeMemory
783561pravcoderConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
134 ms22020 KiB
#include "supertrees.h"
#include <vector>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> v2i;

int construct(v2i p) {
	int n = p.size();
	v2i answer;
	for (int i = 0; i < n; i++) {
		vi row;
		row.resize(n);
		answer.push_back(row);
	}
	//sub 1
	for (int i = 0; i < n - 1; i++)
	{
		answer[i][i+1] = 1;
		answer[i+1][i] = 1;
	}
	
	build(answer);
	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...