专题四1019
2016-07-06 11:50
309 查看
题意:给定一系列数对,然后不断的给出这样的数对,问有没有性别不对的情况。
解题思路:并查集的简单应用,就是同性别的合并在一个集合中,然后每次输入看u,v是否在同一个集合中
AC源码
#include<iostream>
#include<stdio.h>
#include<cstdio>
#define N 2005
using namespace std;
int f
,rank
, n, k;
bool flag;
inline void init(){
flag=false;
for(int i=0; i<=n; ++i)
f[i]=i, rank[i]=0;
}
int find(int x){
if(x==f[x])return f[x];
int t=find(f[x]);
rank[x] = (rank[f[x]]+rank[x])&1;
f[x]=t;
return f[x];
}
void Union(int x, int y){
int a=find(x), b=find(y);
if(a==b){
if(rank[x]==rank[y])
flag=true;
return;
}
f[a]=b;
rank[a] = (rank[x]+rank[y]+1)&1;
}
int main(){
int T,a,b,cas=1;
cin>>T;
while(T--){
cin>>n>>k;
init();
for(int i=0; i<k; ++i){
cin>>a>>b;
if(flag)continue;
Union(a,b);
}
cout<<"Scenario #"<<cas++<<endl;
if(flag)cout<<"Suspicious bugs found!"<<endl;
else cout<<"No suspicious bugs found!"<<endl;
cout<<endl;
}
return 0;
}
Total Submission(s) : 23 Accepted Submission(s) : 8
[align=left]Problem Description[/align]
<b>Background </b><br>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. <br><br><b>Problem </b><br>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.<br>
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
Statistic |
Submit |
Back
解题思路:并查集的简单应用,就是同性别的合并在一个集合中,然后每次输入看u,v是否在同一个集合中
AC源码
#include<iostream>
#include<stdio.h>
#include<cstdio>
#define N 2005
using namespace std;
int f
,rank
, n, k;
bool flag;
inline void init(){
flag=false;
for(int i=0; i<=n; ++i)
f[i]=i, rank[i]=0;
}
int find(int x){
if(x==f[x])return f[x];
int t=find(f[x]);
rank[x] = (rank[f[x]]+rank[x])&1;
f[x]=t;
return f[x];
}
void Union(int x, int y){
int a=find(x), b=find(y);
if(a==b){
if(rank[x]==rank[y])
flag=true;
return;
}
f[a]=b;
rank[a] = (rank[x]+rank[y]+1)&1;
}
int main(){
int T,a,b,cas=1;
cin>>T;
while(T--){
cin>>n>>k;
init();
for(int i=0; i<k; ++i){
cin>>a>>b;
if(flag)continue;
Union(a,b);
}
cout<<"Scenario #"<<cas++<<endl;
if(flag)cout<<"Suspicious bugs found!"<<endl;
else cout<<"No suspicious bugs found!"<<endl;
cout<<endl;
}
return 0;
}
Problem S
Time Limit : 15000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 23 Accepted Submission(s) : 8
[align=left]Problem Description[/align]
<b>Background </b><br>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. <br><br><b>Problem </b><br>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.<br>
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2 3 3 1 2 2 3 1 3 4 2 1 2 3 4
[align=left]Sample Output[/align]
Scenario #1: Suspicious bugs found! Scenario #2: No suspicious bugs found! <div style='font-family:Times New Roman;font-size:14px;background-color:F4FBFF;border:#B7CBFF 1px dashed;padding:6px'><div style='font-family:Arial;font-weight:bold;color:#7CA9ED;border-bottom:#B7CBFF 1px dashed'><i>Hint</i></div>Huge input,scanf is recommended.</div>
Statistic |
Submit |
Back
相关文章推荐
- Android 如何直播RTMP流
- 一步一步拆解一个简单的iOS轮播图(三图)
- java中的参数传递
- AndroidManifest.xml配置文件详解
- 万能进制转换程序
- C++函数系列篇:函数的默认值+带默认参数的函数
- Swift基础之UITableView(之前写的知识点都是最新的2.2版本样式,欢迎大家参考,可以相互交流)
- apache commons fileupload 输入输出流API(2016-07-01更新)
- Swift基础之UITableView(之前写的知识点都是最新的2.2版本样式,欢迎大家参考,可以相互交流)
- 以二进制流的类型post发送文件
- 多版本java编译android遇到的问题
- 20.01.程序员实习过程中应该掌握的问问题技巧
- 例题9-3 UVA - 1347 Tour 旅行(DP)
- linux更改文件乱码
- Windows下Mysql服务的手动安装
- 278. First Bad Version
- 安卓(Android)ListView 显示图片文字
- java Exception 出错的栈信息打印到日志中 打印堆栈信息
- Python网页信息采集:使用PhantomJS采集淘宝天猫商品内容
- Rigging a Versatile Weapon Bone for 3ds Max