传送门:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1586
这题有一个地方需要注意,就是每选一条边的时候,对于两个点还有额外的消耗。所以如果单纯对于边进行最小生成树的话,是不对的,因为一条边的消耗是边权+两点的消耗,所以再输入边的时候,就要把边的权值加上点的消耗,然后就是普通的最小生成树了。
顺便学了学prim。
代码:
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<time.h>
#include<vector>
#include<string>
#include<queue>
#include<map>
#include<cmath>
#include<algorithm>
using namespace std;
const int INF = 999999999;
int n;
int pic[1010][1010];
int d[1010];
int ex[1010];
int prim(int st)
{
int ans = 0;
int i, j;
for (i = 1; i <= n; i++)
{
d[i] = pic[st][i];
}
d[st] = -1;
for (i = 1; i < n; i++)
{
int min = INF;
int v = -1;
for (j = 1; j <= n; j++)
{
if (d[j] != -1 && d[j] < min)
{
v = j;
min = d[j];
}
}
ans += min;
d[v] = -1;
for (j = 1; j <= n; j++)
{
if (pic[v][j] < d[j])
{
d[j] = pic[v][j];
}
}
}
return ans;
}
int main()
{
// freopen("D://input.txt", "r", stdin);
// freopen("D://output.txt", "w", stdout);
int T;
scanf("%d", &T);
while (T--)
{
scanf("%d", &n);
int i, j;
for (i = 1; i <= n; i++)
{
scanf("%d", &ex[i]);
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
pic[i][j] = INF;
}
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
scanf("%d", &pic[i][j]);
if (i != j)
pic[i][j] += ex[i] + ex[j];
}
}
printf("%d\n", prim(1));
}
// printf("%.6f\n", (double)clock() / CLOCKS_PER_SEC);
return 0;
}