제출 #1287034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1287034		nathlol2	Connecting Supertrees (IOI20_supertrees)	C++20	0 / 100	1 ms	344 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int N;
int pa[1005];
int _find(int x){
	if(x == pa[x]) return x;
	return pa[x] = _find(pa[x]);
}
void _union(int x, int y){
	x = _find(x), y = _find(y);
	if(x != y) pa[x] = y;
}
int construct(std::vector<std::vector<int>> p) {
	for(int i = 0;i<1005;i++) pa[i] = i;
	N = p.size();
	vector<vector<int>> ans(N, vector<int>(N, 0));
	vector<vector<int>> g(N);
	vector<bool> v(N, 0);
	for(int i = 0;i<N;i++){
		for(int j = 0;j<N;j++){
			if(i == j) continue;
			if(p[i][j]){
				g[i].push_back(j);
			}
		}
	}
	for(int i = 0;i<N;i++){
		if(v[i]) continue;
		v[i] = 1;
		int pv = i;
		for(auto x : g[i]){
			v[x] = 1;
			_union(x, pv);
			ans[pv][x] = 1;
			ans[x][pv] = 1;
			pv = x;
		}
		if(g[i].size() != 0) ans[i][pv] = ans[pv][i] = 1;
	}
	for(int i = 0;i<N;i++){
		for(int j = 0;j<N;j++){
			if(p[i][j]){
				if(_find(i) != _find(j)) return 0;
			}else{
				if(_find(i) == _find(j)) return 0;
			}
		}
	}
	build(ans);
	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