How Many Tables HDU - 1213
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了How Many Tables HDU - 1213相关的知识,希望对你有一定的参考价值。
One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.
For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.
InputThe input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.
OutputFor each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
Sample Input
2 5 3 1 2 2 3 4 5 5 1 2 5
Sample Output
2 4
以上是关于How Many Tables HDU - 1213的主要内容,如果未能解决你的问题,请参考以下文章
HDU - 1213 How Many Tables(并查集)
HDU - 1213 How Many Tables [并查集]