hdu 3172 Virtual Friends(加权并查集)
来源:互联网 发布:知乎 修改一句话介绍 编辑:程序博客网 时间:2024/06/06 03:05
Virtual Friends
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9579 Accepted Submission(s): 2793
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
Source
University of Waterloo Local Contest 2008.09
Recommend
chenrui
题意:
A B 两人交友
问朋友圈的大小
因为 多组数据 ,每组数据分为T小组
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<map>#define N 100002using namespace std;map<string,int>m;int pre[N];int num[N];void init(){ for(int i=1; i<=N; i++)pre[i]=i,num[i]=1;}int Find(int x){ if(pre[x]!=x) return pre[x]=Find(pre[x]); return x;}void Merge(int x,int y){ int X=Find(x); int Y=Find(y); if(X!=Y) pre[X]=Y,num[Y]+=num[X]; printf("%d\n",num[Y]);}int main(){ int T; while(scanf("%d",&T)==1) { while(T--) { int n; string a,b; scanf("%d",&n); init(); m.clear(); int c=0; for(int i=1; i<=n; i++) { cin>>a>>b; if(!m[a]) m[a]=++c; if(!m[b]) m[b]=++c; Merge(m[a],m[b]); } } }}
阅读全文
0 0
- hdu 3172 Virtual Friends(加权并查集)
- hdu 3172 virtual friends 并查集
- HDU 3172 Virtual Friends (并查集)
- 【并查集】 HDU 3172 Virtual Friends
- hdu 3172 Virtual Friends(并查集)
- hdu 3172 Virtual Friends 并查集
- HDU 并查集 - 3172 Virtual Friends
- HDU 3172 Virtual Friends (并查集)
- 并查集 HDU 3172 Virtual Friends
- HDU 3172 并查集-Virtual Friends
- hdu 3172 Virtual Friends 字典树+并查集
- hdu 3172 Virtual Friends(简单并查集)
- hdu 3172 Virtual Friends (cmp + 并查集)
- HDU-3172 Virtual Friends 并查集+map
- HDU 3172 Virtual Friends(并查集)
- hdu 3172 Virtual Friends (并查集 + 字典树)
- hdu 3172 Virtual Friends(并查集+map)
- HDU 3172 Virtual Friends 带权并查集 -秩
- 泛型 List中的Sort方法
- 计算从整数1到n之间,所有1的个数的和
- qq空间h5页面,如何在微信中直接打开qq空间链接却不需要登陆qq账号密码
- python-3 元组
- c语言实现二叉树的建立与前序、中序、后序、层序遍历
- hdu 3172 Virtual Friends(加权并查集)
- map、list查询速度
- Maven详解(六)------ 生命周期
- 数值计算和SVM讲解(下)
- apache tomat安装
- (关系幂运算->n长度的最短路)河南省第十届ACM省赛题目:问题 I: Transmit information
- HDU 5545 The Battle of Guandu(最短路)
- WebService的基本介绍和调用实例
- Mysql删除表提示Cannot truncate a table referenced in a foreign key constraint解决办法