J - A Bug's Life 并查集
2024-09-08 03:59:01
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
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.
数据量大要用scanf
#include<iostream>
#include<map>
#include<string>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<iomanip>
#include<iostream>
using namespace std;
#define MAXN 2003
#define INF 0x3f3f3f3f
typedef long long LL;
/*带权并查集,
虫子只和不同性别交配,所以并查集距离为1,如果有不匹配,就标记
*/
int pre[MAXN],rank[MAXN],n,m;
int find(int x)
{
if(pre[x]==-)
return x;
int fx = pre[x];
pre[x] = find(pre[x]);
rank[x] = (rank[x]+rank[fx])%;
return pre[x];
}
bool mix(int x,int y)
{
int fx = find(x),fy=find(y);
if(fx==fy)
{
if(rank[x]!=(rank[y]+)%)
return false;
return true;
}
pre[fy] = fx;
rank[fy] = (rank[x]-rank[y]++)%;
return true;
}
void Init()
{
memset(rank,,sizeof(rank));
memset(pre,-,sizeof(pre));
}
int main()
{
int t;
scanf("%d",&t);
for(int i=;i<=t;i++)
{
scanf("%d%d",&n,&m);
Init();
int x,y;
bool f = false;
for(int j=;j<m;j++)
{
scanf("%d%d",&x,&y);
if(f) continue;
if(!mix(x,y))
f = true;
}
printf("Scenario #%d:\n",i);
if(f)
printf("Suspicious bugs found!\n");
else
printf("No suspicious bugs found!\n");
printf("\n");
}
return ;
}
最新文章
- GET和POST可传递的值到底有多大?
- OC中面向对象2
- vijos2001 xor-sigma
- A trip through the Graphics Pipeline 2011_06_(Triangle) rasterization and setup
- 答CsdnBlogger问-关于职业发展和团队管理问题
- jstree 插件的使用笔记(一)
- C#.net拖拽实现获得文件路径
- openssl生成自签名证书
- LVS--什么是LVS?
- python Josnp(跨域)
- UVA - 11992:Fast Matrix Operations
- angular4-常用指令
- javascript面向对象系列第五篇——拖拽的实现
- 29. What Makes a True Leader ? 合格的领导者由何物决定 ?
- hdu1846巴什博弈
- Win10上使用Linux Subsystem配置cuckoo sandbox
- python&#39;s unittest
- opensuse语言环境和中文输入法
- 【洛谷 P2485】 [SDOI2011]计算器 (BSGS)
- 【ASP.NET Web API2】利用HttpClient调用Web API(TODO)
热门文章
- css为tbody或者li奇数偶数行样式
- 网站开发综合技术 HTML
- 生成清除某个数据库下的所有表的SQL语句
- 在Azure Ubunt Server 14.04虚机中使用Deep-Visualization-Toolbox
- EasyUI系列学习(十)-Tabs(选项卡)
- git add . 的时候报错fatal: Unable to create : …File exists.
- OKHTTP 简单分析
- phpcms标签第三弹
- [Windows Server 2012] 初识Windows Server 2012
- Codeforces_766_C_(dp)