poj 3013(最短路变形)
来源:互联网 发布:arch linux 安装教程 编辑:程序博客网 时间:2024/05/20 22:02
Description
Christmas is coming to KCM city. Suby the loyal civilian in KCM city is preparing a big neat Christmas tree. The simple structure of the tree is shown in right picture.
The tree can be represented as a collection of numbered nodes and some edges. The nodes are numbered 1 through n. The root is always numbered 1. Every node in the tree has its weight. The weights can be different from each other. Also the shape of every available edge between two nodes is different, so the unit price of each edge is different. Because of a technical difficulty, price of an edge will be (sum of weights of all descendant nodes) × (unit price of the edge).
Suby wants to minimize the cost of whole tree among all possible choices. Also he wants to use all nodes because he wants a large tree. So he decided to ask you for helping solve this task by find the minimum cost.
Input
The input consists of T test cases. The number of test cases T is given in the first line of the input file. Each test case consists of several lines. Two numbers v, e (0 ≤ v, e ≤ 50000) are given in the first line of each test case. On the next line, v positive integers wi indicating the weights of v nodes are given in one line. On the following e lines, each line contain three positive integers a, b, c indicating the edge which is able to connect two nodes a and b, and unit price c.
All numbers in input are less than 216.
Output
For each test case, output an integer indicating the minimum possible cost for the tree in one line. If there is no way to build a Christmas tree, print “No Answer” in one line.
Sample Input
22 11 11 2 157 7200 10 20 30 40 50 601 2 12 3 32 4 23 5 43 7 23 6 31 5 9
Sample Output
151210
这个要有个重要的转化;首先price of an edge will be (sum of weights of all descendant nodes) × (unit price of the edge).
这句指出每条边的代价为该边所有子孙节点权值之和乘以该边的权值。
换个角度就是每个节点的代价为该节点到根节点的所有边的权值乘以该节点的权值。
其实就是求从端点1到每个点的最短路径*改点的权值,,然后之和; #include <queue>#include <stdio.h>#include <iostream>using namespace std;const long long INF=10000000000;const int M=50005;int n,m,edgeNum;long long dis[M];int head[M];int visit[M];int weight[M];struct Edge{ int w; int to; int next;}edge[M*2];struct Node{ int u; int dis; bool operator < (const Node &a) const{ return dis>a.dis; }};void init(){ int i; edgeNum=0; for(i=0;i<M;i++){ visit[i]=0; head[i]=-1; dis[i]=INF; }}void addEdge(int a,int b,int c){ edge[edgeNum].w = c; edge[edgeNum].to = b; edge[edgeNum].next = head[a]; head[a] = edgeNum++;}void Dij(int u){ int i,v; Node temp,now; priority_queue<Node> q; temp.dis = 0; temp.u = u; dis[u] = 0; q.push(temp); while(!q.empty()){ temp=q.top(); q.pop(); visit[temp.u]=1; for(i = head[temp.u]; i != -1; i = edge[i].next){ v=edge[i].to; if(!visit[v]&&dis[v]>dis[temp.u]+edge[i].w){ dis[v]=dis[temp.u]+edge[i].w; now.dis=dis[v]; now.u=v; q.push(now); } } } return ;}int main(){ int T,a,b,c,i; scanf("%d",&T); while(T--){ scanf("%d%d",&n,&m); init(); for(i = 1; i <= n; i++) scanf("%d",&weight[i]); for(i = 0; i < m; i++){ scanf("%d%d%d",&a,&b,&c); addEdge(a,b,c); addEdge(b,a,c); } Dij(1); long long res=0; for(i = 1; i <= n; i++){ if(dis[i]==INF) break; res+=dis[i]*weight[i]; } if(i > n) printf("%lld\n",res); else puts("No Answer"); } return 0;}
- poj 3013 最短路变形
- poj 3013(最短路变形)
- POJ 3013 最短路变形 0.0
- poj 1797 最短路变形
- poj 1797 最短路变形
- poj 1797(最短路变形)
- poj 3126 最短路变形
- POJ 1797 (最短路变形)
- poj 3013 Big Christmas Tree(最短路变形)
- poj 1797 Heavy Transportation (最短路变形)
- POJ 3635 Full Tank? 最短路变形
- poj 1797 最短路变形应用
- 最短路变形 POJ 2253 Frogger
- poj 1724 最短路变形 DFS+剪枝
- POJ 2253 Frogger -- 最短路变形
- POJ-1797(最短路的变形)
- POJ 2253 Frogger(最短路--floyd变形)
- POJ 2253 Frogger(最短路变形)
- APK动态加载框架(DL)解析
- UML序列图总结--Trufun UML2建模工具
- xcode 7 为创建的项目添加框架
- windows 系统添加到开机启动项
- Codeforces Round #354 (Div. 2) D. Theseus and labyrinth
- poj 3013(最短路变形)
- QT调VC的DLL实验总结
- tableview线条距屏幕的距离
- iOS开发:关于layout的一些方法
- 解决Exception: org.apache.hadoop.io.nativeio.NativeIO$Windows.access0(Ljava/lang/String;I)Z 等一系列问题
- 博弈整理(取物)
- 圈里圈外 | 考什么英语四六级,明明情商二级还没过……
- Leetcode-13. Roman to Integer
- 第四届蓝桥杯决赛 A组 供水设施 dp+拓扑+枚举