제출 #1048612

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1048612		IUA_Hasin	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	103 ms	24148 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h> 

#define ll				long long

using namespace std;


int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	if(n==1){
		vector<vector<int>> answer;
		answer.push_back({0});
		build(answer);
		return 1;
	}
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		if(i==0){
			for(int j=0; j<n; j++){
				if(j==1){
					row.push_back(1);
				} else {
					row.push_back(0);
				}
			}
		} else if(i!=n-1){
			for(int j=0; j<n; j++){
				if(j==i-1 || j==i+1){
					row.push_back(1);
				} else {
					row.push_back(0);
				}
			}
		} else {
			for(int j=0; j<n; j++){
				if(j==n-2){
					row.push_back(1);
				} else {
					row.push_back(0);
				}
			}
		}
		answer.push_back(row);
	}
	build(answer);
	return 1;
}



// 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);
// 		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