Submission #1034167

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034167		Gray	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	0 ms	348 KiB

supertrees

#include "supertrees.h"
#include <vector>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define ln "\n"
#define pll pair<ll, ll>

struct DSU{
	vector<ll> p;
	ll n;
	DSU(ll N){
		n=N;
		p.resize(n, -1);
	}
	ll get(ll x){
		return p[x]==-1?x:p[x]=get(p[x]);
	}
	bool unite(ll a, ll b){
		a=get(a);
		b=get(b);
		if (a==b) return 0;
		p[a]=b;
		return 1;
	}
};

int construct(std::vector<std::vector<int>> p) {
	ll n = (ll)p.size();
	bool pos=1;
	DSU tr(n);
	vector<vector<int>> ans(n, vector<int>(n, 0));
	for (ll i=0; i<n; i++){
		for (ll j=0; j<n; j++){
			if (i==j) continue;
			if (p[i][j]){
				if (tr.unite(i, j)) ans[i][j]=1;
			}
		}
	}
	for (ll i=0; i<n; i++){
		for (ll j=0; j<n; j++){
			if (tr.get(i)==tr.get(j) and i!=j and p[i][j]==0){
				pos=0;
			}
		}
	}
	if (!pos) 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