제출 #393145

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393145		abdzag	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	271 ms	22128 KiB

supertrees

#include<bits/stdc++.h>
#include"supertrees.h"
#define rep(i,a,b) for(int i=a;i<int(b);i++)
#define rrep(i,a,b)for(int i=a;i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto& a: v)
typedef long long ll;
using namespace std;
const long long inf = 1e15;

vector<ll> p(2001);
vector<ll> Rank(2001);
ll Ufindset(ll i) {
	if (p[i] == i)return i;
	return p[i] = Ufindset(p[i]);
}
void UjoinSet(ll i, ll j) {
	ll si = Ufindset(i);
	ll sj = Ufindset(j);
	if (sj == si)return;
	if (Rank[sj] > Rank[si])swap(sj, si);
	p[sj] = si;
	if (Rank[sj] == Rank[si]) Rank[si]++;
}

int construct(vector<vector<int>> v) {
	rep(i, 0, 2001)p[i] = i;
	vector<vector<int>> b(v.size(), vector<int>(v.size()));
	rep(i, 0, v.size()) {
		ll root = p[i];
		ll last = i;
		ll two = 0;
		rep(j, 0, v.size()) {
			if (v[i][j]) {
				if (v[i][j] == 2)two++;
				if (j == i)continue;
				//if (p[j] != j)if (v[p[i]][j] != v[i][j] || !v[p[j]][i])return 0;
				if (p[j] == j) {
					if (v[i][j] == 1) {
						if (root == i) {
							UjoinSet(last, j);
							b[last][j] = 1;
							b[j][last] = 1;
						}
					}
				}
				last = j;
			}
			//else if (p[j] == p[i]) return 0;
		}
		if (two) {
			if (two == 1)return 0;
		}
	}

	rep(i, 0, v.size()) {
		ll root = p[i];
		ll last = i;
		ll two = 0;
		rep(j, 0, v.size()) {
			if (v[i][j]) {
				if (v[i][j] == 2)two++;
				if (j == i)continue;
				//if (p[j] != j)if (v[p[i]][j] != v[i][j] || !v[p[j]][i])return 0;
				if (v[i][j] == 2) {
					if (root == i) {
						UjoinSet(last, j);
						b[last][j] = 1;
						b[j][last] = 1;
					}
				}
				last = j;
			}
			//else if (p[j] == p[i]) return 0;
		}
		if (two) {
			if (two == 1)return 0;
			if (root == i) {
				UjoinSet(last, i);
				b[last][i] = 1;
				b[i][last] = 1;
			}
		}
	}
	build(b);
	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