HDU 3172 并查集
来源:互联网 发布:powermill10.0编程步骤 编辑:程序博客网 时间:2024/06/05 08:18
Virtual Friends
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.
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).
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
13Fred BarneyBarney BettyBetty Wilma
Sample Output
234
用map来存储就行了
#include <iostream>#include <map>#include <string>using namespace std;int p[111111];int f[111111];map<string,int> a;int find(int x)//寻找父节点{ if(x!=p[x]) p[x]=p[find(p[x])]; return p[x];}void merge(int x,int y)//合并{ x=find(x),y=find(y); if(x!=y)p[x]=y,f[y]+=f[x]; printf("%d\n",f[y]);}int main(){ int t,n,i; char s1[22],s2[22]; while(~scanf("%d",&t)) { while(t--) { for(i=1;i<=111111;i++)p[i]=i,f[i]=1; scanf("%d",&n); int x=1; a.clear(); while(n--) { scanf("%s%s",s1,s2); if(a[s1]==0)a[s1]=x++; if(a[s2]==0)a[s2]=x++; merge(a[s1],a[s2]); } } } return 0;}
- HDU 3172 并查集
- hdu 3172 字典树+并查集
- hdu 3172 virtual friends 并查集
- HDU 3172 Virtual Friends (并查集)
- 【并查集】-HDU-3172-Virtual Freinds
- 【并查集】 HDU 3172 Virtual Friends
- hdu 3172 Virtual Friends(并查集)
- hdu 3172 Virtual Friends 并查集
- HDU 并查集 - 3172 Virtual Friends
- hdu 3172(并查集+hash)
- HDU 3172 Virtual Friends (并查集)
- HDU 3172 并查集+trie树
- 并查集 HDU 3172 Virtual Friends
- HDU 3172 并查集-Virtual Friends
- HDU 3371 并查集
- HDU 2473 并查集
- hdu 1116 并查集
- HDU 1856 并查集
- Filter 过滤器
- printf 输出颜色
- Quota Project: An effective way to manage the usage of your Swift-based storage cloud
- 握手问题
- 史上最经典的Linux内核学习方法论
- HDU 3172 并查集
- hdu 1028
- XP的命令提示符下,用什么命令可以进入某个分区的某个文件夹?
- CCNA Exploration- 网络基础知识-1-2
- 杭电1873-看病要排队
- ZOJ 3629 Treasure Hunt IV
- 远程连接SQL Server2000数据库
- linux各种数据流重定向
- HDU 4578 Transformation 解题报告(线段树,2013杭州邀请赛)