POJ2492
来源:互联网 发布:java 开启多线程任务 编辑:程序博客网 时间:2024/04/29 00:59
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int rel[2010];
int fa[2010];
int find( int a)
{
if( a != fa[a])
fa[a] = find(a);
return fa[a];
}
void fan( int a, int b)
{
int pa = find(a);
int pb = find(b);
if(pb != pa)
fa[pa] = pb;
}
int main()
{
int n;
int i, j, k, l, x ,y;
int num,que;
int a,b;
scanf("%d",&n);
for( i = 0; i<n; i++)
{
memset(rel,-1,sizeof(rel));
bool flag = false;
for( l=0; l<=num; l++)
fa[l] = l ;
scanf("%d %d",&num, &que);
for( k = 0; k < que; k++)
{
scanf("%d %d",&a, &b);
if(flag) continue;
if(rel[a] == -1)
{
if(rel[b] != 1)
fan(a,rel[b]);
rel[a] = b;
rel[b] = a;
}
else if(rel[a] != -1)
{
if(rel[b] == -1)
{
fan(b,rel[a]);
rel[a] = b;
rel[b] = a;
}
else
{
if(find(a) == find(b))
{
flag = true;
continue;
}
else
{
fan(a, rel[b]) ;
fan(b, rel[a]) ;
}
}
}
}
if(flag) printf("Scenario #%d:\nSuspicious bugs found!\n\n", i+1) ;
else printf("Scenario #%d:\nNo suspicious bugs found!\n\n", i+1) ;
}
}
#include <stdio.h>
#include <string.h>
using namespace std;
int rel[2010];
int fa[2010];
int find( int a)
{
if( a != fa[a])
fa[a] = find(a);
return fa[a];
}
void fan( int a, int b)
{
int pa = find(a);
int pb = find(b);
if(pb != pa)
fa[pa] = pb;
}
int main()
{
int n;
int i, j, k, l, x ,y;
int num,que;
int a,b;
scanf("%d",&n);
for( i = 0; i<n; i++)
{
memset(rel,-1,sizeof(rel));
bool flag = false;
for( l=0; l<=num; l++)
fa[l] = l ;
scanf("%d %d",&num, &que);
for( k = 0; k < que; k++)
{
scanf("%d %d",&a, &b);
if(flag) continue;
if(rel[a] == -1)
{
if(rel[b] != 1)
fan(a,rel[b]);
rel[a] = b;
rel[b] = a;
}
else if(rel[a] != -1)
{
if(rel[b] == -1)
{
fan(b,rel[a]);
rel[a] = b;
rel[b] = a;
}
else
{
if(find(a) == find(b))
{
flag = true;
continue;
}
else
{
fan(a, rel[b]) ;
fan(b, rel[a]) ;
}
}
}
}
if(flag) printf("Scenario #%d:\nSuspicious bugs found!\n\n", i+1) ;
else printf("Scenario #%d:\nNo suspicious bugs found!\n\n", i+1) ;
}
}
0 0
- poj2492
- POJ2492
- poj2492
- poj2492&&hdu1829
- Poj2492合并集
- poj2492并查集
- poj2492(并查集)
- poj2492之树状数组
- poj2492并查集
- POJ2492(并查集)
- poj2492解题报告
- poj2492 + 并查集
- POJ2492 并查集
- poj2492(并查集)
- poj2492 A Bug's Life
- POJ2492 A Bug's Life
- poj2492 - A Bug's Life
- poj2492 A Bug's Life
- Oracle数据库dmp文件Dos命令下导入导出
- ActionBar的一些使用方法
- 面试易错点(java)
- NTC全国物联网技能考试项目授权文件
- 用字节流复制图片的java程序
- POJ2492
- Android测试之monkey(2)
- 我的异常之java.net.ConnectException: Connection refused: connect
- hdu 1425 sort
- IO知识复习五
- 关于iPhone/iPad的iOS系统自动弹出认证窗口问题
- 利用DHT网络原理制作bt采集蜘蛛,开源版
- 使用PhoneGap开发基于Html5应用一:PhoneGap简介
- MapReduce 性能调优:减小数据倾斜的性能损失