HDOJ1829 A Bug's Life(并查集)
来源:互联网 发布:中国m2数据 编辑:程序博客网 时间:2024/05/16 06:44
Problem 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!HintHuge input,scanf is recommended.
和食物链类似,均是种类并查集,找relation很重要,1为同性,0为异性。
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int maxn = 2005;int par[maxn], relation[maxn];int find(int x){if(par[x] == x) return x;int y = par[x];par[x] = find(par[x]);relation[x] = (relation[x] + relation[y] + 1) % 2;return par[x];}void merge(int a, int b){int x = find(a), y = find(b);par[x] = y;relation[x] = (relation[b] - relation[a]) % 2;}int main(int argc, char const *argv[]){int t, cas = 1;scanf("%d", &t);while(t--) {bool flag = false;int n, m;scanf("%d%d", &n, &m);for(int i = 1; i <= n; ++i) {par[i] = i;relation[i] = 1;}for(int i = 0; i < m; ++i) {int a, b;scanf("%d%d", &a, &b);if(find(a) == find(b)) {if(relation[a] == relation[b]) flag = true;}else merge(a, b);}if(flag) printf("Scenario #%d:\nSuspicious bugs found!\n\n", cas++);else printf("Scenario #%d:\nNo suspicious bugs found!\n\n", cas++);}return 0;}
1 0
- HDOJ1829 A Bug's Life(并查集)
- A Bug's Life 并查集
- 并查集 A Bug's Life
- A Bug's Life 并查集
- poj 2492 A Bug's Life(并查集)
- 变异并查集2223: A Bug's Life
- POJ 2492 A Bug's Life(并查集)
- poj 2492 并查集 A Bug's Life
- POJ-2492 a bug's life 并查集
- HDU1829 A Bug's Life 并查集
- poj 2492 并查集 a bug's life
- 并查集Hdu 1829 A Bug's Life
- POJ 2492 A Bug's Life (并查集)
- HDU1829(A Bug's Life )—并查集
- poj_2492 A Bug's Life (并查集)
- poj 2492 A Bug's Life(种类并查集)
- A Bug's Life(并查集)
- A Bug's Life hdu1829 并查集
- AVL
- 剑指Offer面试题35(java版):第一个只出现一次的字符
- 大整数类BigInteger
- 背单词App开发日记5(下)
- Linux下Redis安装
- HDOJ1829 A Bug's Life(并查集)
- 了解JS挂马方式
- HDU 2128 Tempter of the Bone II
- 达内学习日志Day05(续):循环嵌套和数组的练习(二)
- Nginx安装
- uvalive 5902(BIT)
- ZPhotoEngine库推荐
- 嵌入CEF到MFC程序
- 实现RTP协议的h.264传输