hdu 3172 Virtual Friends (映射并查集)

Virtual Friends

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5491    Accepted Submission(s): 1519

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

1 3 Fred Barney Barney Betty Betty Wilma

Sample Output

2

3

4

Source

University of Waterloo Local Contest 2008.09

 题意:  逐步给你一些关系网,对于每一步求所给出的两个人合并之后所构成的关系网。

代码:

 1  #include<cstdio>
 2  #include<cstring>
 3  #include<cstdlib>
 4  #include<iostream>
 5  #include<map>
 6  #include<string>
 7  using namespace std;
 8  const int maxn=100003;
 9  int father[maxn];
10  int rank[maxn];
11   //初始化
12   void init( int n)
13   {
14      for(int i =0;i<=n ;i++){
15          father[i]=i;
16          rank[i]=1;
17      }
18   }
19   //搜索
20    int  fin(int  x)
21    {
22      int tem=x;
23      while(x!=father[x]){
24         x=father[x];
25      }
26      //进一步压缩
27     while(tem!=father[tem])
28      {
29           tem=father[tem];
30           father[tem]=x;
31      }
32 
33      return x;
34    }
35   void Union(int a,int b){
36      a=fin(a);
37      b=fin(b);
38    if(a!=b){
39       if(rank[a]<rank[b]){
40         rank[b]+=rank[a];
41         father[a]=b;
42       }
43       else{
44          rank[a]+=rank[b];
45          father[b]=a;
46       }
47     }
48   }
49    map<string,int>sac;
50    char  aa[maxn][21],bb[maxn][21];
51 
52   int main()
53   {
54     int t,n;
55      while(scanf("%d",&t)!=EOF)
56     {
57       while(t--){
58         scanf("%d",&n);
59           if(!sac.empty()) sac.clear();
60             int cnt=0;
61           for(int i=0;i<n ;i++){
62                scanf("%s%s",aa[i],bb[i]);
63         // map<string,int>::iterator it;
64          //it=sac.find(aa[i]);
65         if(sac.find(aa[i])==sac.end())
66            sac[aa[i]]=++cnt;
67 
68         // it=sac.find(bb[i]);
69            if(sac.find(bb[i])==sac.end())
70         {
71             // posb=sac.size();
72            //  sac.insert(pair<string,int>(bb,posb));
73             sac[bb[i]]=++cnt;
74         }
75       }
76         init(cnt);
77         for(int i=0;i<n;i++)
78         {
79           Union(sac[aa[i]],sac[bb[i]]);
80           printf("%d\n",rank[fin(sac[aa[i]])]);
81         }
82       }
83      }
84     return 0;
85   }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏算法修养

POJ 2609 Ferry Loading(双塔DP)

Ferry Loading Time Limit: 1000MS Memory Limit: 65536K Total Submissions...

36560
来自专栏calmound

POJ 1365 Prime Land

                  Prime Land Time Limit: 1000MS Memory Limit: 10000K Tot...

28040
来自专栏ml

hdu-------1081To The Max

To The Max Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K...

29760
来自专栏码匠的流水账

reactor-netty中TcpClient的newHandler过程

本文主要研究一下reactor-netty中TcpClient的newHandler过程

30310
来自专栏Golang语言社区

golang实现ping命令

zolo® golang实现ping命令 // Copyright 2009 The Go Authors. All rights reserved. // ...

41280
来自专栏算法修养

CodeForces 25C(Floyed 最短路)

F - Roads in Berland Time Limit:2000MS     Memory Limit:262144KB     64bit IO...

24240
来自专栏算法修养

ZOJ 3661 Palindromic Substring(回文树)

Palindromic Substring ---- Time Limit: 10 Seconds      Memory Limit: 65536 KB --...

29760
来自专栏小樱的经验随笔

HDU 1013 Digital Roots【字符串,水】

Digital Roots Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...

28040
来自专栏小樱的经验随笔

HDU 1010 Tempter of the Bone【DFS经典题+奇偶剪枝详解】

Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 6553...

33640
来自专栏ml

hdu----(1599)最大子矩阵(几何/dp)

最大子矩阵 Time Limit: 30000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (J...

29640

扫码关注云+社区

领取腾讯云代金券