Ice_cream’s world III【最小生成树】

Ice_cream’s world III

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1960    Accepted Submission(s): 701

Problem Description

ice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, beautifies the roads, by which there are some ways from every city to the capital. The project’s cost should be as less as better.

 

Input

Every case have two integers N and M (N<=1000, M<=10000) meaning N cities and M roads, the cities numbered 0…N-1, following N lines, each line contain three integers S, T and C, meaning S connected with T have a road will cost C.

 

Output

If Wiskey can’t satisfy the queen’s requirement, you must be output “impossible”, otherwise, print the minimum cost in this project. After every case print one blank.

 

Sample Input

  
  

   
   2 1
0 1 10

4 0
  
  

Sample Output

  
  

   
   10

impossible
  
  
  
  
 
  
  
  
  

   
   如果无法建成就i说明 不是所有城市之间都有路，，就是 这些城市不是连通的。
  
  
  
  

   
   1  对于并查集来说 就是不止一个根节点
  
  
  
  

   
   简单的 最小生成树
  
  
  
  

   
   Kruskal
  
  
  
  

   
   #include<stdio.h>
#include<string.h>
#include<algorithm>
#define  M 10000+10
#define inf 0x3f3f3f
using namespace std;
typedef struct 
{

   
   	int a,b,cost;
}data;
data a[M];
int pre[1000+10];
void  init(int n)
{

   
   	for(int i=0;i<n;i++)

   
   	{

   
   		pre[i]=i;

   
   	}
}
int find(int x)
{

   
   	int r=x;

   
   	if(r==pre[r]) return x;

   
   	while(r!=pre[r]) r=pre[r];

   
   	int j=x;

   
   	while(j!=r)

   
   	{

   
   		int i=pre[j];

   
   		pre[j]=r;

   
   		j=i;

   
   	}

   
   	return r;
}
void join(int x,int y)
{

   
   	x=pre[x];

   
   	y=pre[y];

   
   	if(x!=y) pre[x]=y;
}
int cmp(data x,data y)
{

   
   	return x.cost<y.cost;
}
int main()
{

   
   	int n,m;

   
   	while(~scanf("%d%d",&n,&m))

   
   	{

   
   		init(n);

   
   		for(int i=0;i<m;i++)

   
   		scanf("%d%d%d",&a[i].a,&a[i].b,&a[i].cost);

   
   		sort(a,a+m,cmp);

   
   		int sum=0;

   
   		for(int i=0;i<m;i++)

   
   		{

   
   			if(find(a[i].a)!=find(a[i].b))

   
   			{

   
   				join(a[i].a,a[i].b);

   
   				sum+=a[i].cost;

   
   			}

   
   		}

   
   		int num=0;int s=1;

   
   		for(int i=0;i<n;i++)

   
   		{

   
   			if(find(i)==i) 

   
   			{

   
   			num++;
   
   	

   
   			if(num>1)

   
   			{

   
   				s=0;

   
   				break;

   
   			}

   
   			}

   
   		}

   
   		if(!s

   
   		) printf("impossible\n\n");

   
   		else printf("%d\n\n",sum); 

   
   	}

   
   	 
}

  
  
  
  


  
  
  
  

   
   prime
  
  
  
  

   
   #include<stdio.h>  
#include<string.h>  
#define max 1000+10  
#define INF 0x3f3f3f  
int visit[max],map[max][max],low[max];  
int city,road;  
void prime()  
{  
    int i,j,next;  
    int min,mincost=0;  
    for(i=0;i<city;i++)  
    {  
        visit[i]=0;  //  这里对v【】 初始化
        low[i]=map[0][i];  
    }  
    visit[0]=1;  
    for(i=1;i<city;i++)   // 一定要从i=1 开始  
    {  
        min=INF;
        for(j=0;j<city;j++)  
        {  
            if(!visit[j]&&min>low[j])  
            {  
                min=low[j];  
                next=j;  
            }  
        }  
        if(min==INF)//遍历全部无法连通   
        {  
            printf("impossible\n\n");  
            return ;  
        }  
        mincost+=min;  
        visit[next]=1;  
        for(j=0;j<city;j++)  
        {  
            if(!visit[j]&&map[next][j]<low[j])  
            {  
                low[j]=map[next][j];  
            }  
        }  
    }  
    printf("%d\n\n",mincost);  
}  
int main()  
{  
    int i,j,x,y,c;  
    while(scanf("%d%d",&city,&road)!=EOF)  
    {  
        memset(map,INF,sizeof(map)) ;
        while(road--)  
        {  
            scanf("%d%d%d",&x,&y,&c);  
            if(map[x][y]>c)  
            map[x][y]=map[y][x]=c;  
        }  
        prime();  
    }  
    return 0;  
}