LA 3644
来源:互联网 发布:网络摄像头密码重置 编辑:程序博客网 时间:2024/04/28 23:45
X-Plosives
A secret service developed a new kind of explosive that attain its volatile property only when a specific association of products occurs. Each product is a mix of two different simple compounds, to which we call a binding pair. If N>2, then mixing N different 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. Let’s assume you receive the following sequence: A+B, G+B, D+F, A+E, E+G, F+H. You would accept the first 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. The input 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, 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
LRJ白书上的一道并查集的水题。只要祖先相同即增加1.然后输出结果就好
#include<iostream>#include<cstdio>using namespace std;#define maxn 100010int pre[maxn];int find(int x){ return x==pre[x]?x:find(pre[x]);}int main(){ int x,y,i; while(~scanf("%d",&x)){ for(i=0;i<=maxn;i++) pre[i]=i; int ans=0; while(x!=-1){ scanf("%d",&y); x=find(x);y=find(y); if(x==y) ans++; else pre[x]=y; scanf("%d",&x); } cout<<ans<<endl; } return 0;}
- LA 3644
- LA 3644
- LA 3644
- 易炸物(LA 3644)
- LA - 3644 - X-Plosives
- LA 3644 X-Plosives
- LA 3644 X-Plosives
- LA 3644 X-Plosives
- LA 3644 X-PIosives
- LA 3644 X-Plosives
- LA 3644 - X-Plosives
- LA 3644 X-Plosives
- LA 3644 X-Plosives
- la la la, la la la
- LA 3644 并查集
- 并查集 LA 3644
- LA 3644 并查集
- 并查集 LA 3644
- mac 字符串转换为二进制
- uva 331 Mapping the Swaps 求交换排序的map 纯DFS
- ZOJ 1710 The Snail
- log4j日志等级
- linux小记
- LA 3644
- ZOJ 1093 最大高度
- Tomcat6和Tomcat7配置SSL通信的比较
- CentOS6 vsFTP安装与配置
- 利用 Xdebug+WinCacheGrind 分析PHP程序,找出性能瓶颈
- glew, glee与 gl glu glut glx glext的区别和关系
- hdu3172(字典树+并查集)
- 2. 应用函数式编程原则
- How to delete team project from TFS visual studio ?