A Bug's Life

Time Limit : 15000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 97 Accepted Submission(s) : 38

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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.

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

Sample OutpuScenario #1、

Suspicious bugs foundScenario #2:

No suspicious bugs found!http://blog.csdn.net/shuangde800/article/details/7974664这位大佬写的向量偏移非常阅读后这题就非常容易了；就是他写的方程有点奇怪；我自己觉得是这样的：aa->bb=(-delta[a]+d-1+delta[b])%3;a->b=(delta[a]-delta[b])%3;

这题题意用一组数据来说明吧1 2；2 3；1 3

1和2是异性，2和3也是异性，也就是1和3是同性，但是他有将a 和b是异性。出现了bug；

 1 #include <cstring>
 2 #include<stdio.h>
 3 int p[55000];
 4 int f[55000];//i的根节点到i的偏移量
 5 int flag;
 6
 7 int findi(int x)
 8 {
 9     if(p[x]==x)
10         return x;
11     int t=p[x];
12     p[x]=findi(p[x]);
13     f[x]=(f[x]+f[t])%2;
14     return p[x];
15 }
16 void unioni(int x,int y)
17 {
18     int fx=findi(x);
19     int fy=findi(y);
20     p[fx]=fy;
21     f[fx]=(f[y]-f[x]+1)%2;
22     return ;
23 }
24
25 int main (){
26     int t;
27
28     scanf("%d",&t);
29     int k=1;
30     while(t--)
31         {
32         flag=0;
33         int n,m;
34         scanf("%d%d",&n,&m);
35         for(int i=1;i<=n;++i){
36             p[i]=i;
37             f[i]=0;
38         }
39         int a,b;
40         while(m--){
41             scanf("%d%d",&a,&b);
42             int fa=findi(a);
43             int fb=findi(b);
44             if(fa==fb){
45                 if(f[a]==f[b])
46                 flag=1;
47             }
48             else unioni(a,b);
49         }
50         if(flag)
51              printf("Scenario #%d:\nSuspicious bugs found!\n\n",k++);
52         else
53              printf("Scenario #%d:\nNo suspicious bugs found!\n\n",k++);
54     }
55     return 0;
56 }

转载于:https://www.cnblogs.com/2014slx/p/7233441.html

A Bug's Life(向量偏移)相关推荐

POJ 2492 A Bug's Life (带权并查集向量偏移)
题意 : 给你 n 只虫且性别只有公母, 接下来给出 m 个关系, 这 m 个关系中都是代表这两只虫能够交配, 就是默认异性, 问你在给出的关系中有没有与异性交配这一事实相反的, 即同性之间给出了交配 ...
一种通过篡改特定代码数据修复嵌入式产品BUG的方法
一.前言在嵌入式产品开发中,难以避免地会因为各种原因导致最后出货的产品存在各种各样的BUG,通常会给产品进行固件升级来解决问题.记得之前在公司维护一款BLE产品的时候,由于前期平台预研不足,OTA参 ...
spark Tachyon
该论文来自Berkeley实验室,英文标题为:Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cl ...
RDD：基于内存的集群计算容错抽象
转载自:http://shiyanjun.cn/archives/744.html 摘要本文提出了分布式内存抽象的概念--弹性分布式数据集(RDD,Resilient Distributed Dat ...
RDD之一：总体介绍
摘要本文提出了分布式内存抽象的概念--弹性分布式数据集(RDD,Resilient Distributed Datasets),它具备像MapReduce等数据流模型的容错特性,并且允许开发人员在大 ...
RDD：基于内存集群计算的容错抽象。
转载自品略图书馆 http://www.pinlue.com/article/2020/03/1519/2310027613940.html 该论文来自Berkeley实验室,英文标题为:Resili ...
RDD：基于内存的集群计算容错抽象(转)
原文:http://shiyanjun.cn/archives/744.html 该论文来自Berkeley实验室,英文标题为:Resilient Distributed Datasets: A Fa ...
RDD论文翻译：基于内存的集群计算容错抽象
该论文来自Berkeley实验室,英文标题为:Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cl ...
保护linux系统调用,Linux软中断与系统调用
1. SWI软中断以ARMV7 A/R架构为例, SWI软中断和中断一样,内核空间处理始于异常向量表.Linux向量表默认地址0XFFFF0000,SWI向量偏移8字节为0xFFFF0008: 具体 ...

A Bug's Life(向量偏移)