Submission #364978

#	Time	Username	Problem	Language	Result	Execution time	Memory
364978		Farrius	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	1 ms	364 KiB

supertrees

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

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> sol(n, vector<int>(n));
	for (int i = 0; i < n; i++) {
		sol[i][i] = 1;
		if (i < n - 1) sol[i][i + 1] = 1;
	}
	build(sol);
	return 1;
}

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