Submission #603414

#TimeUsernameProblemLanguageResultExecution timeMemory
603414TigryonochekkConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
225 ms23916 KiB
#include <iostream>
#include "supertrees.h"
#include <vector>
using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		if (i) 
			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...