Submission #456157

#	Time	Username	Problem	Language	Result	Execution time	Memory
456157		Khizri	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	283 ms	21996 KiB

supertrees

#include "supertrees.h"
#include <vector>

int construct(std::vector<std::vector<int>> arr) {
	int n = arr.size();
	std::vector<std::vector<int>> ans;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		ans.push_back(row);
	}
	for(int i=0;i<n-1;i++){
		ans[i][i+1]=1;
		ans[i+1][i]=1;
	}
	build(ans);
	return 1;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4