Submission #1200485

#TimeUsernameProblemLanguageResultExecution timeMemory
1200485AzeTurk810Connecting Supertrees (IOI20_supertrees)C++20
11 / 100
109 ms22000 KiB
#include "supertrees.h"
#include <bits/stdc++.h>
// using namespace std;

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);
		for (int j = 0; j < n; j++)
		{
			if(j == i + 1 || j == i - 1) {
				row[j] = true;
			} else {
				row[j] = false;
			}
		}
		
		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...