Description
Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate the suspects from others.
In the Not-Spreading-Your-Sickness University (NSYSU), there are many student groups. Students in the same group intercommunicate with each other frequently, and a student may join several groups. To prevent the possible transmissions of SARS, the NSYSU collects the member lists of all student groups, and makes the following rule in their standard operation procedure (SOP).
Once a member in a group is a suspect, all members in the group are suspects.
However, they find that it is not easy to identify all the suspects when a student is recognized as a suspect. Your job is to write a program which finds all the suspects.
In the Not-Spreading-Your-Sickness University (NSYSU), there are many student groups. Students in the same group intercommunicate with each other frequently, and a student may join several groups. To prevent the possible transmissions of SARS, the NSYSU collects the member lists of all student groups, and makes the following rule in their standard operation procedure (SOP).
Once a member in a group is a suspect, all members in the group are suspects.
However, they find that it is not easy to identify all the suspects when a student is recognized as a suspect. Your job is to write a program which finds all the suspects.
Input
The input file contains several cases. Each test case begins with two integers n and m in a line, where n is the number of students, and m is the number of groups. You may assume that 0 < n <= 30000 and 0 <= m <= 500. Every student is numbered by a unique integer between 0 and n−1, and initially student 0 is recognized as a suspect in all the cases. This line is followed by m member lists of the groups, one line per group. Each line begins with an integer k by itself representing the number of members in the group. Following the number of members, there are k integers representing the students in this group. All the integers in a line are separated by at least one space.
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
Output
For each case, output the number of suspects in one line.
Sample Input
100 4 2 1 2 5 10 13 11 12 14 2 0 1 2 99 2 200 2 1 5 5 1 2 3 4 5 1 0 0 0
Sample Output
4 1 1
思路: 说实话,有点不懂题目中说的and initially student 0 is recognized as a suspect in all the cases. 既然说0受感染的suspect,那在第二组数据中,没有说零的事,怎么会有感染者。后来瞬间明白了,没说零的是就说明感染者只有0自己啊。啊,糊涂。。。
但是还是不知道首次代码是为什么不过??????
附代码:
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<queue>
using namespace std;
struct inin
{
int a[3010];
int sumnum;
bool con;
}boy[500];
int main()
{
int n,m;
int k,s;
int num;
int i,j;
int mark;
int sum;
int temp;
queue<int>q;
while(scanf("%d%d",&m,&n)&&!(m==0&&n==0))
{
sum=0;
memset(boy,0,sizeof(boy));
for(j=0;j<n;j++)
{
scanf("%d",&k);
boy[j].sumnum=k;
mark=0;
for(i=0;i<k;i++)
{
scanf("%d",&num);
boy[j].a[i]=num;
if(num==0)
{
mark=1;
}
}
if(mark==1)
{
for(s=0;s<k;s++)
{
q.push(boy[j].a[s]);
sum++;
}
boy[j].con=true;
}
}
while(!q.empty())
{
temp=q.front();
q.pop();
for(i=0;i<n;i++)
{
if(!boy[i].con)
{
int mark2=0;
for(j=0;j<boy[i].sumnum;j++)
{
if(boy[i].a[j]==temp)
{
mark2=1;
break;
}
}
if(mark2==1)
{
for(j=0;j<boy[i].sumnum;j++)
{
if(boy[i].a[j]!=temp)
{
q.push(boy[i].a[j]);
sum++;
}
}
boy[i].con=true;
}
}
}
}
printf("%d\n",sum==0 ? 1:sum);
}
return 0;
}
没有办法,只有使用并查集模板了
#include<stdio.h>
#include<string.h>
int fa[40010];
int num[40010];
int n,m;
int k;
int a,b;
int f1,f2;
int find(int n)
{
if(fa[n]==n)
return n;
else
return fa[n]=find(fa[n]);
}
int main()
{
int i,j;
while(scanf("%d%d",&m,&n)&&!(m==0&&n==0))
{
memset(fa,0,sizeof(fa));
memset(num,0,sizeof(num));
for(i=0;i<m;i++)
{
fa[i]=i;
num[i]=1;
}
for(i=0;i<n;i++)
{
scanf("%d%d",&k,&a);
f1=find(a);
for(j=1;j<k;j++)
{
scanf("%d",&b);
f2=find(b);
if(f1!=f2)
{
fa[f2]=f1;
num[f1]+=num[f2];
}
}
}
printf("%d\n",num[find(0)]);
}
return 0;
}