zoukankan      html  css  js  c++  java
  • The Suspects

    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.

    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.

    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

    #include<stdio.h>
    #include<cstring>
    int pre[30001];
    int s[30001];
    int find(int p)
    {
    	while(p!=pre[p])
    	{
    		 p=pre[p];
    	}
    	return p;
    }
    void merge(int x,int y)
    {
    	int fx=find(x);
    	int fy=find(y);
    	if(fx!=fy)
    	{
    		pre[fx]=fy;
    	}
    }
    int main()
    {
    	int n,m;
    	while(scanf("%d%d",&n,&m)!=EOF)
    	{
    	   if(n==0&&m==0)
    	     break;
    		memset(s,0,sizeof(s));
    		for(int i=0;i<n;i++)
    		{
    			pre[i]=i;
    		}
    		while(m--)
    		{
    			int t;
    			scanf("%d",&t);
    			scanf("%d",&s[0]);
    			for(int i=1;i<t;i++)
    			{
    				scanf("%d",&s[i]);
    			     merge(s[i-1],s[i]);
    			}
    		}
    		 int cut=0;
    		 for(int i=0;i<n;i++)
    		 {
    		 	if(find(i)==find(0))
    		 	{
    		 			cut++;
    			 }
    		 }
    		 printf("%d
    ",cut);
    	}
    	return 0;
    }

    给出n个人 0号为传染者 和传染者一组的人都是被怀疑对象 问有多少人可能被传染

    编程五分钟,调试两小时...
  • 相关阅读:
    C# winform中使用contextMenuStrip作为右键菜单时,菜单项失效的问题
    Helix 3D toolkit初尝试
    Image.save引发的“GDI+发生一般性错误”
    WPF浏览器程序的发布问题
    SVN checksum mismatch
    Fedora 13 nVidia家的显卡也有开源3D驱动了
    关于package 'Visual Web Developer HTML Source Editor Package' has failed to load
    MongoDB .NET Driver 1.1 Bug导致MongoDB拒绝连接
    Nginx导致页面发送给错误的用户
    ArchLinux的一些知识
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027110.html
Copyright © 2011-2022 走看看