畅通工程
Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 28 Accepted Submission(s) : 19
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
Input
行对应村庄间道路的成本,每行给出一对正整数,分别是两个村庄的编号,以及此两村庄间道路的成本(也是正整数)。为简单起见,村庄从1到M编号。当N为0时,全部输入结束,相应的结果不要输出。
Output
Sample Input
3 3 1 2 1 1 3 2 2 3 4 1 3 2 3 2 0 100
Sample Output
3 ?
#include <iostream>
#define INF 1000000
#define MAXN 105
int n,m;
int edge[MAXN][MAXN];
int lowcost[MAXN];
int nearvex[MAXN];
using namespace std;
void prim(int u0)
{
int i,j;
int sumweight=0;
for(i=1;i<=n;i++)
{
lowcost[i]=edge[u0][i];
nearvex[i]=u0;
}
nearvex[u0]=-1;
for(i=1;i<n;i++)
{
int mi=INF;
int v=-1;
for(j=1;j<=n;j++)
{
if(nearvex[j]!=-1&&lowcost[j]<mi)
{v=j;mi=lowcost[j];}
}
if(v!=-1)
{
nearvex[v]=-1;
sumweight+=lowcost[v];
for(j=1;j<=n;j++)
{
if(nearvex[j]!=-1&&edge[v][j]<lowcost[j])
{
lowcost[j]=edge[v][j];
nearvex[j]=v;
}
}
}
else
{
cout<<"?"<<endl;
return;
}
}
cout<<sumweight<<endl;
}
int main(int argc, char *argv[])
{
int i,j;
int u,v,w;
while(cin>>m>>n)
{
if(m==0) break;
memset(edge,0,sizeof(edge));
for(i=1;i<=m;i++)
{
cin>>u>>v>>w;
edge[u][v]=edge[v][u]=w;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==j) edge[i][j]=0;
else if(edge[i][j]==0) edge[i][j]=INF;
}
prim(1);
}
return 0;
}