题目描述
某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。
输入
测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( < 100 );随后的N(N-1)/2行对应村庄间的距离,每行给出一对正整数,分别是两个村庄的编号,以及此两村庄间的距离。为简单起见,村庄从1到N编号。
当N为0时,输入结束,该用例不被处理。
输出
对每个测试用例,在1行里输出最小的公路总长度。
样例输入
8
1 2 42
1 3 68
1 4 35
1 5 1
1 6 70
1 7 25
1 8 79
2 3 59
2 4 63
2 5 65
2 6 6
2 7 46
2 8 82
3 4 28
3 5 62
3 6 92
3 7 96
3 8 43
4 5 28
4 6 37
4 7 92
4 8 5
5 6 3
5 7 54
5 8 93
6 7 83
6 8 22
7 8 17
0
样例输出
82
第一版:时间超限
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 100;
const int inf = 1000000000;
int n; //村庄数目
int G[maxn][maxn];
int d[maxn];
bool vis[maxn] = {false};
int prim(int s)
{
fill(d, d+maxn, inf);
d[s] = 0;
int ans = 0;
for(int i = 1; i <= n; i++)
{
int u = -1, min = inf;
for(int j = 1; j <= n; j++)
{
if(vis[j] == false && d[j] < min)
{
u = j;
min = d[j];
}
}
if(u == -1) return -1;
vis[u] = true;
ans += d[u];
for(int v = 1; v <= n; v++)
{
if(vis[v] == false && G[u][v] != inf && G[u][v] < d[v])
{
d[v] = G[u][v];
}
}
}
return ans;
}
int main()
{
while(scanf("%d", &n) != 0)
{
// if(n == 0) break;
int m = n * (n-1) / 2;
fill(G[0], G[0]+maxn*maxn, inf); //初始化
for(int i = 1; i <= m; i++)
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
G[a][b] = c;
G[b][a] = c;
}
int ans = prim(1);
if(ans != 0)
printf("%d\n", ans);
}
return 0;
}
第二版:运行错误
提示:数组越界。但是我看了一圈没发现...有看出的同仁请告知,万分感谢!
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 100+10;
const int inf = 1000000000;
int a; //村庄数目
//kruskal
struct edge
{
int u, v, dis;
}E[maxn];
int father[maxn];
int find_father(int x)
{
int a = x;
while(x != father[x])
{
x = father[x];
}
while(a != father[a])
{
int z = a;
a = father[a];
father[z] = x;
}
return x;
}
bool cmp(edge a, edge b)
{
return a.dis < b.dis;
}
int kruskal(int n, int m)
{
int ans = 0, num_edge = 0;
for(int i = 1; i <= n; i++)
{
father[i] = i;
}
sort(E, E+m+1, cmp);
for(int i = 0; i < m; i++)
{
int fa = find_father(E[i].u);
int fb = find_father(E[i].v);
if(fa != fb)
{
father[fa] = fb;
ans += E[i].dis;
num_edge++;
if(num_edge == n - 1) break;
}
}
if(num_edge != n - 1)
{
return -1;
}else return ans;
}
int main()
{
while(scanf("%d", &a) != 0)
{
int b = a * (a-1) / 2;
for(int i = 0; i < b; i++)
{
scanf("%d%d%d", &E[i].u, &E[i].v, &E[i].dis);
}
int ans = kruskal(a, b);
printf("%d\n", ans);
}
return 0;
}
AC代码:
终于AC了,发帖求助的。真是犯了低级错误。边数为N(N-1)/2,自己开的maxn太小,所以超了!流泪,我太菜鸡惹...
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 5010;
const int inf = 1000000000;
int a; //村庄数目
//kruskal
struct edge
{
int u, v, dis;
}E[maxn];
int father[110];
int find_father(int x)
{
int a = x;
while(x != father[x])
{
x = father[x];
}
while(a != father[a])
{
int z = a;
a = father[a];
father[z] = x;
}
return x;
}
bool cmp(edge a, edge b)
{
return a.dis < b.dis;
}
int kruskal(int n, int m)
{
int ans = 0, num_edge = 0;
for(int i = 1; i <= n; i++)
{
father[i] = i;
}
sort(E, E+m, cmp);
for(int i = 0; i < m; i++)
{
int fa = find_father(E[i].u);
int fb = find_father(E[i].v);
if(fa != fb)
{
father[fa] = fb;
ans += E[i].dis;
num_edge++;
if(num_edge == n - 1) break;
}
}
if(num_edge != n - 1)
{
return -1;
}else return ans;
}
int main()
{
while(scanf("%d", &a)&& a)
{
int b = a * (a-1) / 2;
for(int i = 0; i < b; i++)
{
scanf("%d%d%d", &E[i].u, &E[i].v, &E[i].dis);
}
int ans = kruskal(a, b);
printf("%d\n", ans);
}
return 0;
}