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


First line of input is 't' - Test cases. Follwed by N, the number of peers in the testcase ( 0 to N-1 ). 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 contains t line, the number of people, the organizers have to meet in person for each test case.



0 1
1 2




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.


t = 10
2 <= N <= 100000
0 <= e <= N/2

hide comments
imsaral: 2017-06-21 22:31:21

My first Graph Question
Took me around 1.5 hours/
But finally, AC in one go :)

ayushagg31: 2017-06-13 13:41:17

just count the connecting components and you are good to go!!!

Siddharth: 2017-04-09 08:42:57

AC code with C++ is WA with python.

saikat777: 2017-03-23 07:01:18

Nice warmup questions on graphs.
Good for beginners like me. :)

vunnamtej: 2017-03-20 13:57:11

Black in one go

abhishek181297: 2017-03-12 12:54:00

solved using DFS can anyone tell me what is this Union-Find Method

da_201501181: 2017-03-03 12:16:23

AC twice!!
DFS time 0.19 s
Union-Find 0.12 s

vengatesh15: 2017-01-25 07:18:15

Simple one..

surajmall: 2016-12-28 08:07:47

beginners in graph should try this :)

ajmale: 2016-11-16 19:59:07

easy one
but keep in mind it is undirected.

Added by:karthikeyan
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:own problem