제출 #1079155

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079155		7mody	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	1 ms	348 KiB

supertrees

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

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	vector<int> arr;
	vector<bool> found(n);
	for(int i = 0; i < n;i++){
		if(p[i][i] != 1) return 0;
		for(int j = 0; j < n;j++){
			if(p[i][j] != p[j][i]) return 0;
			if(p[i][j] == 2){
				if(!found[i]){
					arr.push_back(i);
					found[i] = true;
				} if(!found[j]){
					arr.push_back(j);
					found[j] = true;
				}
			}
		}
	}
	if(arr.size()) arr.push_back(arr[0]);
	int m = int(arr.size());
	for(int i = 0; i < m;i++){
		for(int j = 0; j < m;j++){
			if(i==j) continue;
			if(p[i][j] != 2) return 0;
		}
	}

	for(int i = 0; i < int(arr.size()) - 1;i++){
		answer[arr[i]][arr[i+1]] = answer[arr[i+1]][arr[i]] = 1;
	}

	build(answer);
	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