zoukankan      html  css  js  c++  java
  • POJ1611

    The Suspects
    Time Limit: 1000MS   Memory Limit: 20000K
    Total Submissions: 23002   Accepted: 11171

    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

    提交一直出现Wrong Answer,主要代码出错在union_set方法。

    之前

    void union_set(int x,int y){
    	x = find_set(x);
    	y = find_set(y);
    	if(rank[x] >  rank[y]){
    		pa[y] = x;
    		count[x] += count[y];
    	}
    	else{
    		pa[x] = y;
    		if(rank[x] == rank[y]){
    			rank[y]++;
    		}
    		count[y] += count[x];
    	}
    
    }


    修改为

    void union_set(int x,int y){
    	x = find_set(x);
    	y = find_set(y);
    	if(x==y) return;	
    	if(rank[x] > rank[y])
    	{
    		pa[y] = x;
    		count[x] += count[y];
    		rank[x]++;
    	}
    	else
    	{
    		pa[x] = y;
    		rank[y]++;
    		count[y] += count[x];
    	}
    }


    通过了

    #include <cstdio>
    
    const int MAXN = 30001;
    int pa[MAXN];
    int rank[MAXN];
    int count[MAXN];
    
    void make_set(int x){
    	pa[x] = x;
    	rank[x] = 0;
    	count[x] = 1;
    }
    
    int find_set(int x){
    	if(x != pa[x]){
    		pa[x] = find_set(pa[x]);
    	}
    	return pa[x];
    }
    
    void union_set(int x,int y){
    	x = find_set(x);
    	y = find_set(y);
    	if(x==y) return;	
    	if(rank[x] > rank[y])
    	{
    		pa[y] = x;
    		count[x] += count[y];
    		rank[x]++;
    	}
    	else
    	{
    		pa[x] = y;
    		rank[y]++;
    		count[y] += count[x];
    	}
    
    }
    
    
    int main(void){
    	int n,m;
    	while(1){
    		int i;
    		scanf("%d%d",&n,&m);
    		if(0==n && 0==m){
    			break;
    		}
    		for(i=0;i<n;i++){
    			make_set(i);
    		}
    		for(i=0;i<m;i++){
    			int k,first,j;
    			scanf("%d%d",&k,&first);
    			for(j=1;j<k;j++){
    				int next;
    				scanf("%d",&next);
    				union_set(first,next);
    			}
    		}
    		int p = find_set(0);
    		printf("%d
    ",count[p]);
    	}
    	return 0;
    }
  • 相关阅读:
    Failed to execute goal org.apache.maven.plugins:maven-surefire-plugin:2.12.4:test (default-test)
    maven打包报错:Failed to execute goal org.apache.maven.plugins:maven-surefire-plugin:2.5:test
    关于log4j:WARN No appenders could be found for logger (org.apache.hadoop.metrics2.lib.MutableMetricsFactory).的问题
    maven-source 1.3 中不支持注释请使用 -source 5 或更高版本以启用注释
    <Android基础>(二) Activity Part 1
    <Android基础>(一)
    数制
    第二次实验报告:使用Packet Tracer分析应用层协议
    在Windows Server 2003中搭建DNS服务器
    第一次作业:使用Packet Tracer分析HTTP包
  • 原文地址:https://www.cnblogs.com/zhaohongtian/p/6809016.html
Copyright © 2011-2022 走看看