CAM5  prayatna PR
help the Prayatna pr team
Well, the annual technical symposium of Department of Computer Technology is around the corner. All that we need, to make it a grand success is Publicity among the peer groups ( ofCourse the sponsors too :P ). We decided to share the job between the student groups. As per the plan we decided to meet people in person and influence them to attend Prayatna. But to meet them we have to go to various student groups. To do so, we had to cut our classes. But being studious. students refused to cut more classes. Instead of meeting every one in person we decided to meet few people such that the person to whom we pass the news will spread it to all his friends. And those friends will pass it to other friends and so on. Your task is to find the number of people to be met by the organizers to spread the news.
Caution: Large I/O
Input
First line of input is 't'  Test cases. Follwed by N, the number of peers in the testcase ( 0 to N1 ). followed by the number of friend description 'e'. Following are 'e' descriptions of type "a b" denoting 'a' friends with 'b'. If 'a' is friends with 'b' then 'b' is friends with 'a'.
Output
Output contains t line, the number of people, the organizers have to meet in person for each test case.
Example
Input: 2 4 2 0 1 1 2 3 0 Output: 2 3
Explanation
case 1 : 0 is friends with 1; 1 is friends with 2; so if we pass the news to 0 & 3, news will pass it to the entire N peers.
case 2 : no one is friends with any one. So we have to meet every one in person.
Constraints
t = 10
2 <= N <= 100000
0 <= e <= N/2
hide comments
tungtd95:
20161116 07:52:27
my 1st grap problem, finally AC. tks everyone 

karan_batra:
20160829 10:34:42
Easy one. AC in one go. :D 

cnexans:
20160801 02:35:59
AC in the 2nd try. One "&" can change TLE to AC. 

Sarthak Munshi:
20160709 19:25:40
should moved to tutorial under graphs . 

avisheksanvas:
20160707 05:11:53
caution: large I/O!


Shubhransh Srivastav:
20160628 19:41:38
200th :)


macbox:
20160607 08:02:16
Use Disjoint Sets makes solution easy 

entcat:
20160528 22:23:47
Not a directed graph. cost me 1 WA. 

pamyjeela:
20160516 08:39:24
AC in one go 

sinth:
20160417 13:29:46
why WA? any tricky test case to suggest!!! 
Added by:  karthikeyan 
Date:  20120111 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  own problem 