Submission #981486

#	Time	Username	Problem	Language	Result	Execution time	Memory
981486		tamir1	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	151 ms	24148 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j]==3) return 0;
		}
	}
	if(n==1){
		build({{0}});
		return 1;
	}
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(n,0);
		if(i==0){
			row[i+1]=1;
		}
		else if(i==n-1){
			row[i-1]=1;
		}
		else{
			row[i-1]=1;
			row[i+1]=1;
		}
		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