ACdreamoj1056(带权并查集)

Bad Horse

Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)

Submit Statistic Next Problem

Problem Description

As the leader of the Evil League of Evil, Bad Horse has a lot of problems to deal with.

Most recently, there have been far too many arguments and far too much backstabbing in the League, so much so that Bad Horse has decided to split the league into two departments in order to separate troublesome members.

Being the Thoroughbred of Sin, Bad Horse isn't about to spend his valuable time figuring out how to split the League members by himself.

That what he's got you -- his loyal henchman -- for.

Input

The first line of the input gives the number of test cases, T (1 ≤ T ≤ 100).

T test cases follow.

Each test case starts with a positive integer M (1 ≤ M ≤ 100) on a line by itself -- the number of troublesome pairs of League members.

The next M lines each contain a pair of names, separated by a single space.

Each member name will consist of only letters and the underscore character "_".

Names are case-sensitive.

No pair will appear more than once in the same test case.

Each pair will contain two distinct League members.

Output

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is either "Yes" or "No", depending on whether the League members mentioned in the input can be split into two groups with neither of the groups containing a troublesome pair.

Sample Input

2
1
Dead_Bowie Fake_Thomas_Jefferson
3
Dead_Bowie Fake_Thomas_Jefferson
Fake_Thomas_Jefferson Fury_Leika
Fury_Leika Dead_Bowie

Sample Output

Case #1: Yes
Case #2: No

Source

codejam

Manager

KIDx

本题给定不能在同一个集合中的元素要求判断是否能分成两个不相交的集合。

可以用判断二分图的方法来判断，也可以用带权并查集的方法来完成。

带权的并查集处理这种相关性的问题时，一般权保存的是本元素和代表元素的关系。

在并查集路径压缩时修改了代表元素通过 rank[x]=(rank[x]+rank[t])%模 将rank[x]根据训x和其代表元素的关系改变成x和其原代表元素的代表元素的关系。

合并两个集合时需要更新其中一个代表元素的rank值将其rank值更新成同另一个集合的代表元素的关系，这个关系需要通过此时所给的两个元素的关系来判断。

<script src="https://code.csdn.net/snippets/448148.js"></script>