제출 #403943

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
403943		monus1042	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	300 ms	24052 KiB

supertrees

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

const int NAX = 1002;
vector<int> parent(NAX, -1);

int Find(int u){
	if (parent[u] == -1) return u;
	return parent[u] = Find(parent[u]);
}

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);
	}
	// solve:
	for (int i=0; i<n; i++){
		for (int j=0; j<n; j++){
			if (i==j) continue;
			if (p[i][j] == 1){
				int x = Find(i), y = Find(j);
				if (x!=y){
					parent[x]=y;
					answer[i][j]=answer[j][i]=1;
				}
			}
		}
	}
	for (int i=0; i<n; i++){
		for (int j=0; j<n; j++){
			if (i==j) continue;
			int x = Find(i), y = Find(j);
			if (p[i][j] == 1){
				if (x!=y) return 0;
			}else{
				if (x==y) return 0;
			}
		}
	}
	build(answer);
	return 1;
}

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