FRNDCIRC - FRIEND CIRCLE
Lucy has made too many friends but she does not know how many friends are in her circle. Assume that every relation is mutual. If Lucy is Patty's friend, then Patty is also Lucy's friend. Your task is to help Lucy in keeping track of each person's circle size.
Input Specification
The first line of input contains one integer T (T<=10) specifying the number of test cases to follow. Each test case begins with a line containing an integer N (N<=100000), the number of new relations. Each of the following N lines contains couple of strings denoting the names of two people who have just formed relation, separated by a space. Names will have no more than 20 characters.
Output Specification
Print a line containing one integer, the number of people in the combined circle of two people who have just become friends.
Input
1 4 Lucy Patty Patty Alice Alice Mira Tiffany Jayden
Output
22 3 4 2
hide comments
|
naruto09:
2016-02-06 09:21:12
very beautiful problem..;) those getting tle in c++ .. try using unordered map instead of map.. |
|
Liquid_Science:
2016-02-04 16:57:04
Java coder leave this, do FOXLINGS instead, this need somee serious IO optimizations.
|
|
xpshekhar:
2016-01-03 02:12:23
1
|
|
prakhar:
2015-12-07 17:14:18
not a big fan of such questions as it required fast input optimization due to which i wasted lots of time
|
|
sailemaverit:
2015-11-06 22:22:11
Time restrictions are too strict for Java users. Please correct. |
|
sailemaverit:
2015-11-05 14:48:08
Really not able to do it with Java! TLE! :/
|
|
Satyaki Upadhyay:
2014-08-25 18:41:49
Take care. Requires fast I/O. |
|
Apoorv Jindal:
2014-01-21 14:10:56
Implementation problems like these make you fall in love with your language. This one needs smart data structures. |
|
Aditya Bahuguna:
2014-01-02 21:17:33
Whoa!!...I cant believe that passed!!....:D
|
Added by: | Vamos |
Date: | 2013-06-26 |
Time limit: | 0.100s-1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |