Submission #846876

#	Time	Username	Problem	Language	Result	Execution time	Memory
846876		detaomega	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	165 ms	23940 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;


int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer;


	for (int i = 0; i < n; i++) {
		
		std::vector<int> row;
		row.resize(n);

		for (int j = 0; j < n; j++) {
			if (abs(i - j) == 1) {
				row[j] = 1;
			} 
			else {
				row[j] = 0;
			}
		}
		answer.push_back(row);
	}
	build(answer);
	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