HDU 3172 Virtual Friends (并查集)
2016-03-27 19:39
381 查看
Problem Description
These days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, growing their social network (their friends, their friends' friends, their friends' friends' friends, and so on), has become
an addictive hobby. Just as some people collect stamps, other people collect virtual friends.
Your task is to observe the interactions on such a website and keep track of the size of each person's network.
Assume that every friendship is mutual. If Fred is Barney's friend, then Barney is also Fred's friend.
Input
Input file contains multiple test cases.
The first line of each case indicates the number of test friendship nest.
each friendship nest begins with a line containing an integer F, the number of friendships formed in this frindship nest, which is no more than 100 000. Each of the following F lines contains the names of two people who have just become friends, separated by
a space. A name is a string of 1 to 20 letters (uppercase or lowercase).
Output
Whenever a friendship is formed, print a line containing one integer, the number of people in the social network of the two people who have just become friends.
Sample Input
Sample Output
These days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, growing their social network (their friends, their friends' friends, their friends' friends' friends, and so on), has become
an addictive hobby. Just as some people collect stamps, other people collect virtual friends.
Your task is to observe the interactions on such a website and keep track of the size of each person's network.
Assume that every friendship is mutual. If Fred is Barney's friend, then Barney is also Fred's friend.
Input
Input file contains multiple test cases.
The first line of each case indicates the number of test friendship nest.
each friendship nest begins with a line containing an integer F, the number of friendships formed in this frindship nest, which is no more than 100 000. Each of the following F lines contains the names of two people who have just become friends, separated by
a space. A name is a string of 1 to 20 letters (uppercase or lowercase).
Output
Whenever a friendship is formed, print a line containing one integer, the number of people in the social network of the two people who have just become friends.
Sample Input
1 3 Fred Barney Barney Betty Betty Wilma
Sample Output
2 3 4
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<map> using namespace std; const int N = 100000 +10; int num ,fa ; map<string,int>pre; char name1[22],name2[22]; int find(int x) { int r=x; while(fa[r]!=r) r=fa[r]; int i=x,j; while(i!=r) { j=fa[i]; fa[i]=r; i=j; } return r; } int main() { int T,i,j,n,k; int x,y,fx,fy; while(scanf("%d",&T)!=EOF) { while(T--) { pre.clear(); scanf("%d",&n); for(i=1;i<N;i++) { fa[i]=i; num[i]=1; } k=0; while(n--) { scanf("%s%s",name1,name2); if(!pre[name1]) pre[name1]=++k; if(!pre[name2]) pre[name2]=++k; fx=find(pre[name1]); fy=find(pre[name2]); if(fx!=fy) { fa[fx]=fy; num[fy]+=num[fx]; } printf("%d\n",num[fy]); } } } return 0; }
相关文章推荐
- TortoiseSVN 日常操作指南
- Spark迷思
- Google Maps API3 之 Hello World
- 打表格,字符串处理,POJ(2136)
- nrf51822教程系列 第二课 nrf51822 softdevice GAP Advertising
- 树莓派瞎玩~5~控制GPIO之Python
- 作业一
- sqlsession和sqlsessionFactory区别
- [Oracle] 关系型数据库排序算法和数据结构以及关联查询
- 十句话读懂《易经》
- 安装mountaion lion无法挂载镜像
- 笔试真题-计算大位数的乘积
- SVN初了解
- 集合框架Collection接口中的共性功能
- C语言中main函数的参数
- java循环练习:手动输入两个数字m和n,运算求出m~n之间所有偶数的和
- 国内领先B2B电子商务平台“陌远e城”上线
- 编译的特征与识别
- JavaI/O体系详解
- Git问题non-fast-forward解决