Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 25971 | Accepted: 11367 |
Description
We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
Input
Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Output
Sample Input
3 0 990 692 990 0 179 692 179 0 1 1 2
Sample Output
179
Code
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 110
#define INF 0x3f3f3f3f
using namespace std;
int map[N][N];
int vis[N];
int dis[N];
int ans,n;
void prim()
{
int i,j,min,pos;
for(i=1; i<=n; i++)
{
dis[i] = map[1][i];
vis[i] = 0;
}
vis[1] = 1;
for(i=1; i<=n-1; i++)
{
min = INF;
for(j=1; j<=n; j++)
{
if(!vis[j] && dis[j] < min)
{
min = dis[j];
pos = j;
}
}
ans += min;
vis[pos] = 1;
for(j=1; j<=n; j++)
{
if(!vis[j] && dis[j] > map[pos][j])
{
dis[j] = map[pos][j];
}
}
}
}
int main()
{
int m,i,j,a,b;
while(~scanf("%d",&n))
{
ans = 0;
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
scanf("%d",&map[i][j]);
}
}
scanf("%d",&m);
while(m--)
{
scanf("%d %d",&a,&b);
map[a][b] = map[b][a] = 0;
}
prim();
printf("%d\n",ans);
}
return 0;
}
反思:
題目大意:多組輸入,給出圖的點數n和圖的鄰接矩陣,接下來有m組數據,每組包含a和b兩個整數,說明a和b兩個村莊連通。最小生成樹模板題,因爲題目給出了鄰接矩陣,所以連圖的初始化都省了♪(゚▽^*)ノ⌒☆。已經連通的兩個村莊權值置爲0,然後用prim即可。