HDU 1829 A Bug's Life 带权并查集
来源:互联网 发布:windows rs1 编辑:程序博客网 时间:2024/05/21 06:32
A Bug’s Life
Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
Description
Background
Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs.
Problem
Given a list of bug interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs or if it contains some bug interactions that falsify it.
Input
The first line of the input contains the number of scenarios. Each scenario starts with one line giving the number of bugs (at least one, and up to 2000) and the number of interactions (up to 1000000) separated by a single space. In the following lines, each interaction is given in the form of two distinct bug numbers separated by a single space. Bugs are numbered consecutively starting from one.
Output
The output for every scenario is a line containing “Scenario #i:”, where i is the number of the scenario starting at 1, followed by one line saying either “No suspicious bugs found!” if the experiment is consistent with his assumption about the bugs’ sexual behavior, or “Suspicious bugs found!” if Professor Hopper’s assumption is definitely wrong.
Sample Input
2
3 3
1 2
2 3
1 3
4 2
1 2
3 4
Sample Output
Scenario #1:
Suspicious bugs found!
Scenario #2:
No suspicious bugs found!
#include<stdio.h>#include<string>#include<cstring>#include<queue>#include<algorithm>#include<functional>#include<vector>#include<iomanip>#include<math.h>#include<iostream>#include<sstream>#include<stack>#include<set>#include<bitset>#include<map>using namespace std;const int MAX=2005;int Father[MAX],Rank[MAX],N,K,T,X,Y;bool flag;int Find(int x){ if (Father[x]==x) return Father[x]; int fx=Find(Father[x]); Rank[x]=(Rank[x]+Rank[Father[x]])&1; Father[x]=fx; return Father[x];}void Union(int x,int y){ int fx=Find(x),fy=Find(y); if (fx==fy) { if (Rank[x]==Rank[y]) flag=true; return; } Father[fy]=fx; Rank[fy]=(Rank[x]+Rank[y]+1)&1;}int main(){ cin.sync_with_stdio(false); cin>>T; for (int cases=1;cases<=T;cases++) { flag=false; for (int i=0;i<MAX;i++) Father[i]=i,Rank[i]=0; cin>>N>>K; for (int i=0;i<K;i++) { cin>>X>>Y; if (flag) continue; Union(X,Y); } cout<<"Scenario #"<<cases<<":\n"; if (flag) cout<<"Suspicious bugs found!\n\n"; else cout<<"No suspicious bugs found!\n\n"; } return 0;}
- HDU 1829 A Bug‘s Life 带权并查集&&带偏移量的写法
- HDU-1829 A Bug's Life (带权并查集)
- hdu 1829 A Bug's Life(带权并查集)
- POJ 2492/hdu 1829 A Bug's Life【带权并查集】
- HDU 1829 A Bug's Life 带权并查集
- HDU 1829 A Bug's Life(带权并查集)
- HDU 1829 A Bug's Life 经典带权并查集
- A Bug's Life(带权并查集)
- A bug's life(带权并查集)
- HDU 1829 A Bug's Life(带关系的并查集)
- 并查集Hdu 1829 A Bug's Life
- HDU 1829 A Bug's Life 并查集
- hdu 1829 A Bug's Life(并查集)
- HDU 1829 A Bug's Life(并查集)
- HDU 1829 A Bug's Life(种类并查集)
- hdu 1829 A Bug's Life (基础并查集)
- HDU 1829 A Bug's Life 并查集
- hdu 1829 A Bug's Life 并查集
- Expanding Rods--二分答案
- 【zzuli-oj】-1907-小火山的宝藏收益(树,STL,思维)
- java基础知识(二)——基础知识的学习
- 火车进站-即数的全排列问题
- 面向对象方法编一个简易的控制台版贪吃蛇(三)
- HDU 1829 A Bug's Life 带权并查集
- 最短编辑距离
- ionic 开发中常用的一些插件
- 最大似然估计和最小二乘法怎么理解
- C#的第15节课
- 求二叉树的深度
- 开发中那些头疼的“顾虑”
- easyui 列表绑定跳转搜索
- FileItem类的常用方法