Submission #779109

#TimeUsernameProblemLanguageResultExecution timeMemory
779109JosiaConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
1 ms212 KiB
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>


using namespace std;


int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.assign(n, 0);
		if (n!=1) row[(i+1)%n]=1;
		if (n!=1) row[(i+n-1)%n]=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...