POJ 2492 A Bug's Life 并查集
2016-03-16 23:55
309 查看
并查集操作的时候特别处理一下关系就好。
Total Submissions: 32941 Accepted: 10789
3 3
1 2
2 3
1 3
4 2
1 2
3 4
Suspicious bugs found!
Scenario #2:
No suspicious bugs found!
#include <cstdio> #include <cstring> using namespace std; const int N = 5005; int fa , re ; int find(int x) { int f = fa[x]; if (f == x) return x; fa[x] = find(f); re[x] ^= re[f]; return fa[x]; } void merge(int a, int b) { int x = find(a), y = find(b); if(x == y) return; fa[x] = y; re[x] = re[a] ^ re[b] ^ 1; } int main() { int a, b, n, m, t, kase = 0, i, ans; scanf("%d", &t); while (t--) { scanf("%d%d", &n, &m); memset(re, 0, sizeof(re)); for (i = 0; i < N; i++) fa[i] = i; ans = 1; while (m--) { scanf("%d%d", &a, &b); if(find(a) == find(b)) { if(re[a] == re[b]) ans = 0; } else merge(a, b); } if (ans) printf("Scenario #%d:\nNo suspicious bugs found!\n\n", ++kase); else printf("Scenario #%d:\nSuspicious bugs found!\n\n", ++kase); } return 0; }
A Bug’s Life
Time Limit: 10000MS Memory Limit: 65536KTotal Submissions: 32941 Accepted: 10789
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
23 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.Source
TUD Programming Contest 2005, Darmstadt, Germany相关文章推荐
- js函数节流-性能-resize
- 前端事件处理addEventListener和onclick
- jquery 操作cookie
- jquery 操作cookie
- 记录--jquery 获取父级、子级、兄弟元素 + 实例
- 阿里前端笔试题目
- JavaScript+html+css记忆翻牌游戏
- html frame标签(点击左边框架内容而在右边框架做出反应)
- 认识DOM的三大节点:元素节点,文本节点,属性节点以及nodeName,nodeType,nodeValue的区别
- JavaScript正则匹配练习。。。
- json转日期
- jQuery事件:bind、delegate、on的区别
- CSS学习(十六)-HSLA颜色模式
- 【html】通配符选择器
- JSTL与EL之间的千丝万缕
- 图片放大器
- JavaScript之字符串
- angularJS思维导图02 作用域和控制器
- JS复习:第八章
- JQuery