[LA] 3644 - X-Plosives [并查集]

标签：des   style   blog   color   os   io   strong   for   

A secret service developed a new kind of explosive that attain its volatile property only when a specic
association of products occurs. Each product is a mix of two di?erent simple compounds, to which we
call a binding pair. If N > 2, then mixing N di?erent binding pairs containing N simple compounds
creates a powerful explosive. For example, the binding pairs A+B, B+C, A+C (three pairs, three
compounds) result in an explosive, while A+B, B+C, A+D (three pairs, four compounds) does not.
You are not a secret agent but only a guy in a delivery agency with one dangerous problem: receive
binding pairs in sequential order and place them in a cargo ship. However, you must avoid placing in
the same room an explosive association. So, after placing a set of pairs, if you receive one pair that
might produce an explosion with some of the pairs already in stock, you must refuse it, otherwise, you
must accept it.
An example. Lets assume you receive the following sequence: A+B, G+B, D+F, A+E, E+G,
F+H. You would accept the rst four pairs but then refuse E+G since it would be possible to make the
following explosive with the previous pairs: A+B, G+B, A+E, E+G (4 pairs with 4 simple compounds).
Finally, you would accept the last pair, F+H.
Compute the number of refusals given a sequence of binding pairs.
Input
The input will contain several test cases, each of them as described below. Consecutive
test cases are separated by a single blank line.
Instead of letters we will use integers to represent compounds. The input contains several lines.
Each line (except the last) consists of two integers (each integer lies between 0 and 105
) separated by
a single space, representing a binding pair.
Each test case ends in a line with the number `-1‘. You may assume that no repeated binding pairs
appears in the input.
Output
For each test case, the output must follow the description below.
A single line with the number of refusals.
Sample Input
1 2
3 4
3 5
3 1
2 3
4 1
2 6
6 5
-1
Sample Output
3

题意：   有一些简单化合物   每个化合物由2中不同元素组成        然后按照顺序依次将这些化合物放进车里   但是如果车上存在k个简单化合物 且正好包含k中元素的话

那么他们将变成易爆的化合物   为安全起见     每当你拿到一个化合物的时候   如果它和已装车的化合物形成易爆化合物   你就应当拒绝装车  否则就应该装车

请输出有多少个化合物没有装车

思路：

注意题目要求k个简单化合物 且正好包含k中元素   是任意k个化合物 也就是说 只要车里存在任意k个化合物 如果他们含有元素也为k个 则不能装入这样的一个化合物

可以把每个元素看成顶点   一个化合物作为一条边   当整个图存在环的时候 组成环的边对应的化合物就是危险的 否则是安全的

判断是否会组成环 可以通过并查集  如果要添加的边 x y同时在同一个集合中  那么它将组成环  拒绝它  

代码：

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<math.h>
 4 #include<ctype.h>
 5 #include<stdlib.h>
 6 #include<stdbool.h>
 7 
 8 #define rep(i,a,b)      for(i=(a);i<=(b);i++)
 9 #define clr(x,y)        memset(x,y,sizeof(x))
10 #define sqr(x)          (x*x)
11 
12 int i,j,n,f1,f2,
13     father[110000];
14 
15 void pre()
16 {
17     clr(father,0);
18     return 0;
19 }
20 
21 int find(int x)
22 {
23     int r,k,p;
24     
25     r=x;
26     while(father[r]!=r) r=father[r];
27     
28     k=x;
29     while(k!=father[k]) {
30         p=father[k];
31         father[k]=r;
32         k=p;
33     }
34         
35     return r;
36 }
37 
38 int main()
39 {
40     int i,x,y,sum;
41     
42     pre();
43     while(scanf("%d",&x)==1){
44         rep(i,1,100003) father[i]=i;
45         sum=0;
46         
47         while(x!=-1) {
48             scanf("%d",&y);
49         
50             f1=find(x);f2=find(y);
51             if(f1==f2) sum++;
52             else father[f1]=f2;
53             scanf("%d",&x);
54         }
55         printf("%d\n",sum);
56     }
57  
58     
59     return 0;
60 }

[LA] 3644 - X-Plosives [并查集],布布扣,bubuko.com

[LA] 3644 - X-Plosives [并查集]

标签：des   style   blog   color   os   io   strong   for   

原文地址：http://www.cnblogs.com/sxiszero/p/3905796.html