Submission #304596

#TimeUsernameProblemLanguageResultExecution timeMemory
304596ocarimaConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
258 ms22136 KiB
#include "supertrees.h"
#include <vector>

int construct(std::vector<std::vector<int> > p) {
	int n = p.size();


	std::vector<std::vector<int> > answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		if (i > 0) row[i-1] = 1;
		if (i < n - 1) row[i+1] = 1;
		answer.push_back(row);
	}

	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...