POJ 2492 A Bug's Life
来源:互联网 发布:服务器状态监控软件 编辑:程序博客网 时间:2024/06/13 17:01
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!
Hint
Huge input,scanf is recommended.
开一个并查集,若交配,将两只虫子分别存入补集,并且每次检查两只虫子是否在同一集合中。
注意,要输出两个换行符。
#include<iostream>#include<cstdio>using namespace std;int n,m,f[4001];inline int fnd(int x){ if(f[x]==x) return x; return f[x]=fnd(f[x]);}int main(){ int t; scanf("%d",&t); for(int g=1;g<=t;g++) { bool flg=0; scanf("%d%d",&n,&m); printf("Scenario #%d:\n",g); for(int i=1;i<=2*n;i++) f[i]=i; for(int i=1;i<=m;i++) { int x,y; scanf("%d%d",&x,&y); if(fnd(x)==fnd(y)) flg=1; else { f[fnd(y+n)]=fnd(x); f[fnd(y)]=fnd(x+n); } } if(flg) printf("Suspicious bugs found!\n\n"); else printf("No suspicious bugs found!\n\n"); } return 0;}
- poj 2492 A Bug's Life
- POJ-2492 A Bug's Life
- Poj 2492 A Bug's Life
- poj 2492 A Bug's Life
- POJ 2492 - A Bug's Life
- POJ 2492 A Bug's Life
- POJ-2492-A Bug's Life
- poj 2492 A Bug's Life
- poj 2492 A Bug's Life
- poj 2492 A Bug's Life
- POJ 2492 A Bug's Life
- poj 2492 A Bug's Life
- POJ-2492-A Bug's Life
- poj 2492 A Bug's Life
- poj 2492 A Bug's Life
- POJ 2492 A Bug's Life
- POJ 2492 A Bug's Life
- POJ 2492 A Bug's Life
- 为背景添加渐变样式(线性和放射性两种)
- Yii框架开发问题总结
- Oracle修改已有数据的字段类型
- SEO算法解析:打造专题页面的优势竟如此之多
- Brackets 下配置git教程
- POJ 2492 A Bug's Life
- apply寻找数组最大值
- JsonHelper操作帮助类
- chrome浏览器的二维码插件
- Intersection of Two Arrays II
- JAVA微信扫码支付模式二功能实现以及回调
- cc.sequence和this.scheduleOnce连用的缺点
- 关于二叉树与树(森林)的知识点详解
- 稳健回归(Robustness regression)