Submission #158730

#	Time	Username	Problem	Language	Result	Execution time	Memory
158730		maruii	족보 (KOI18_family)	C++14	100 / 100	335 ms	47236 KiB

family

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define ff first
#define ss second

int N, M, K;
struct G {
	vector<int> edge[300005];
	int sz[300005], rep[300005];
	void dfs(int x) {
		if (x && x <= K) rep[x] = x, sz[x] = 1;
		for (auto i : edge[x]) {
			dfs(i);
			rep[x] = rep[i];
			sz[x] += sz[i];
		}
	}
} t1, t2;

int par[300005], sz[300005];
int fnd(int x) { return x == par[x] ? x : par[x] = fnd(par[x]); }
void uni(int x, int y) {
	x = fnd(x), y = fnd(y);
	if (x == y) return;
	par[y] = x;
	sz[x] += sz[y];
}

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> N >> M >> K;
	iota(par, par + K + 1, 0);
	fill(sz, sz + K + 1, 1);
	for (int i = 1; i <= N; ++i) {
		int x; cin >> x;
		t1.edge[x].push_back(i);
	}
	for (int i = 1; i <= M; ++i) {
		int x; cin >> x;
		t2.edge[x].push_back(i);
	}
	t1.dfs(0);
	t2.dfs(0);
	vector<pii> vec;
	for (int i = K + 1; i <= N; ++i) if (t1.edge[i].size() > 1) vec.emplace_back(t1.sz[i], i);
	for (int i = K + 1; i <= M; ++i) if (t2.edge[i].size() > 1) vec.emplace_back(t2.sz[i], -i);
	sort(vec.begin(), vec.end());
	for (auto i : vec) {
		int r;
		if (i.ss < 0) {
			i.ss = -i.ss;
			r = t2.rep[i.ss];
			for (auto j : t2.edge[i.ss]) uni(r, t2.rep[j]);
		}
		else {
			r = t1.rep[i.ss];
			for (auto j : t1.edge[i.ss]) uni(r, t1.rep[j]);
		}
		if (sz[fnd(r)] != i.ff) return !printf("NO");
	}
	printf("YES");
	return 0;
}

• Subtask 1: 17 / 17
• Subtask 2: 27 / 27
• Subtask 3: 15 / 15
• Subtask 4: 41 / 41