【POJ2492】【加权并查集模板题】
来源:互联网 发布:php注销登录 编辑:程序博客网 时间:2024/05/29 02:42
Language:
A Bug's Life
Time Limit: 10000MS Memory Limit: 65536KTotal Submissions: 31374 Accepted: 10286
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.
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
23 31 22 31 34 21 23 4
Sample Output
Scenario #1:Suspicious bugs found!Scenario #2:No suspicious bugs found!
Hint
Huge input,scanf is recommended.
Source
TUD Programming Contest 2005, Darmstadt, Germany
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++)#define per(i,a,n) for (int i=n-1;i>=a;i--)#define mp push_backint T;int n,m;const int maxn = 2010;int F[maxn];int d[maxn];int find(int x){if(F[x] == -1) return x;int t = find(F[x]);d[x] ^= d[F[x]];return F[x] = t;}void merge(int x,int y){int fx = find(x);int fy = find(y);F[fx] = fy;d[fx] = 1^d[x]^d[y];}int Read(){char c; int r; while((c=getchar()) < '0' || c > '9'); r = c-'0';while((c=getchar()) >= '0' && c <= '9') r = r* 10 + (c-'0');return r;}int main(){int C = 1; scanf("%d",&T);while(T --){memset(F,-1,sizeof(F));memset(d,0,sizeof(d));scanf("%d%d",&n,&m);bool found = false;for(int i=0;i<m;i++){int a,b;scanf("%d%d",&a,&b);if(found) continue;int t1 = find(a);int t2 = find(b);if(t1 == t2){int ret = d[a] ^ d[b];if(ret == 0){found = true;}}else{merge(a,b);}}if(found)printf("Scenario #%d:\nSuspicious bugs found!\n\n",C++);elseprintf("Scenario #%d:\nNo suspicious bugs found!\n\n",C++);} return 0;}
0 0
- 【POJ2492】【加权并查集模板题】
- poj2492(加权值的并查集)
- poj2492并查集
- poj2492(并查集)
- poj2492并查集
- POJ2492(并查集)
- poj2492 + 并查集
- POJ2492 并查集
- poj2492(并查集)
- POJ2492(种类并查集)
- POJ1703 POJ2492 并查集
- poj2492种类并查集
- POJ2492 并查集的拓展
- poj2492-并查集基于分组
- poj2492 poj1182种类并查集
- 带权并查集 POJ1988 POJ2492
- POJ2492 带权并查集
- poj2492(并查集---类似“食物链”)
- 08-图9 关键活动 (30分)
- js toArray的更好实现方法
- 进程与线程
- 架构师必看书籍
- 8.2.1.12 Outer Join Simplification 外联接简化
- 【POJ2492】【加权并查集模板题】
- CocoaAsyncSocket 文档1:Socket简介
- jQuery 间歇式无缝滚动特效分享(三张图片平行滚动)
- Java中的日历类Calendar的常用方法(所有方法都在客户端测试过)
- 反转字符串I am a student
- WMS介绍
- 《HTTP权威指南》阅读笔记(五)
- XML Editor
- IOS边下边播方法的实现