Submission #734989

#TimeUsernameProblemLanguageResultExecution timeMemory
734989MODDIConnecting Supertrees (IOI20_supertrees)C++14
0 / 100
1 ms340 KiB
#include "supertrees.h"
//#include "grader.cpp"
#include <vector>
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(0, n);
		if(i + 1 < n)
			row[i+1] = 1;
		if(i - 1 >= 0)
			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...