제출 #421497

#제출 시각아이디문제언어결과실행 시간메모리
421497lakshith_슈퍼트리 잇기 (IOI20_supertrees)C++14
11 / 100
235 ms23916 KiB
#include "supertrees.h"
#include <vector>

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> g;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(n,0);
		g.push_back(row);
	}
	for(int i=0;i<n-1;i++)
		g[i][i+1] = g[i+1][i] = 1;
	build(g);
	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...