1272. Non-Yekaterinburg Subway

A little town started to construct a subway. The peculiarity of the town is that it is located on small islands, some of them are connected with tunnels or bridges. The mayor is sure that the subway is to be under the ground, that’s why the project must use the less bridges the better. The only request for the subway is that the townsmen could get by metro (may be with changes) from every island to every island. Fortunately, we know that there is enough tunnels and bridges for it. It was decided to construct as less passages from island to island as possible to save money.

Your task given a town plan to determine the minimal possible number of bridges that is necessary to use in the subway construction.

Input

The first line contains three integers separated with a space:   N  (the number of islands,1 ≤   N  ≤ 10000),   K  (the number of tunnels,  0 ≤   K  ≤ 12000) and   M  (the number of bridges,0 ≤   M  ≤ 12000). Then there are   K  lines; each line consists of two integers — the numbers of islands, connected with the corresponding tunnel. The last   M  lines define bridges in the same format.

Output

the minimal number of bridges necessary for the subway construction.

Sample

input	output
6 3 4 1 2 2 3 4 5 1 3 3 4 4 6 5 6	2

Problem Author: Magaz Asanov (prepared Igor Goldberg) Problem Source: Ural State University championship, October 25, 2003

Tags:  ( show tags for all problems )

Difficulty: 202      Printable version      Submit solution      Discussion (19) My submissions      All submissions (16757)      All accepted submissions (5492)    Solutions rating (1737)

**********************************************************************************************************

并查集，找最小联通

*********************************************************************************************************

 1 #include<iostream>
 2 #include<string>
 3 #include<cstring>
 4 #include<cmath>
 5 #include<cctype>
 6 #include<cstdio>
 7 #include<stack>
 8 #include<queue>
 9 #include<vector>
10 using namespace std;
11 int   fa[10010];
12 int n,m,k,i,j;
13 struct node
14 {
15     int s,e,c;
16 }nodea[25000];
17 int father(int x)
18  {
19      if(fa[x]!=x)
20        fa[x]=father(fa[x]);
21      return fa[x];
22  }
23  int main()
24  {
25      cin>>n;
26      cin>>m>>k;
27      for(i=1;i<=m;i++)
28       {
29           cin>>nodea[i].s>>nodea[i].e;
30           nodea[i].c=0;
31       }
32      for(i=1;i<=k;i++)
33       {
34           cin>>nodea[i+m].s>>nodea[i+m].e;
35           nodea[i+m].c=1;
36       }
37       int sum=0,l=0;
38        for(i=1;i<=n;i++)
39         fa[i]=i;
40       for(i=1;i<=k+m;i++)
41        {
42           int x1=father(nodea[i].s);
43           int x2=father(nodea[i].e);
44           if(x1!=x2)
45             {
46                 sum+=nodea[i].c;
47                 l++;
48                 if(l==n-1)break;
49                 fa[x1]=x2;
50             }
51 
52        }
53      cout<<sum<<endl;
54      return 0;
55  }

View Code

 

转载于:https://www.cnblogs.com/sdau--codeants/p/3242079.html