题目链接:http://poj.org/problem?id=3013
题意:给定一含n个结点的图,要求构建一颗以1为根结点的树,要将某条边加入树中,那么所需要的价钱为所有子孙结点权重之和*这条边的基础花费,选入一些适当的边,使得所有点都在树中,且价钱最小。
思路:树构成之后,会发现所有子孙结点都能通过一系列的边到达根结点1,而这些边都与子孙结点的权重相乘贡献给最终的答案中。所以要使答案小,结点到达根1的边应该尽量小,所以就是最短路啦。
#include<cstdio>
#include<queue>
#include<iostream>
#include<vector>
#include<map>
#include<cstring>
#include<string>
#include<set>
#include<stack>
#include<algorithm>
#define cle(a) memset(a,0,sizeof(a))
#define inf(a) memset(a,0x3f,sizeof(a))
#define ll long long
#define Rep(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
const int INF = ( 2e9 ) + 2;
const int Inf= 1061109567;
const int M = 100005;
struct edge
{
int v, next, w;
} e[M];
struct node
{
int u,d;
bool operator < (const node &b)const
{
return d>b.d;
}
};
int tot;
int head[M];
ll W[M],dist[M],vis[M];
void Addedge(int x, int y, int w)
{
e[tot].v = y;
e[tot].w = w;
e[tot].next = head[x];
head[x] = tot++;
e[tot].v=x;
e[tot].w=w;
e[tot].next= head[y];
head[y]= tot++;
}
ll dijkstra(int s,int n)
{
ll ret=0;
int cnt=0;
inf(dist);
dist[s]=0;
priority_queue<node> q;
q.push(node{s,0});
while(!q.empty())
{
node a=q.top();q.pop();
int u=a.u;
if(vis[u])continue;
vis[u]=1;
ret+=dist[u]*W[u];
cnt++;
for(int i=head[u];i!=-1;i=e[i].next)
{
int v=e[i].v;
if(vis[v])continue;
int w=e[i].w;
if(dist[v]>dist[u]+w)
{
dist[v]=dist[u]+w;
q.push(node{v,dist[v]});
}
}
}
if(cnt<n)return -1;
else return ret;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
tot=0;
memset(head,-1,sizeof(head));
memset(vis,0,sizeof(vis));
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%lld",&W[i]);
for(int i=0; i<m; i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
Addedge(u,v,w);
}
ll ans=dijkstra(1,n);
if(ans==-1)
printf("No Answer\n");
else
printf("%lld\n",ans);
}
}