codeforces 545 E. Paths and Trees
来源:互联网 发布:信用卡查询账单软件 编辑:程序博客网 时间:2024/06/05 05:35
Little girl Susie accidentally found her elder brother's notebook. She has many things to do, more important than solving problems, but she found this problem too interesting, so she wanted to know its solution and decided to ask you about it. So, the problem statement is as follows.
Let's assume that we are given a connected weighted undirected graph G = (V, E) (here V is the set of vertices, E is the set of edges). The shortest-path tree from vertex u is such graph G1 = (V, E1) that is a tree with the set of edges E1 that is the subset of the set of edges of the initial graph E, and the lengths of the shortest paths from u to any vertex to G and to G1 are the same.
You are given a connected weighted undirected graph G and vertex u. Your task is to find the shortest-path tree of the given graph from vertex u, the total weight of whose edges is minimum possible.
The first line contains two numbers, n and m (1 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of vertices and edges of the graph, respectively.
Next m lines contain three integers each, representing an edge — ui, vi, wi — the numbers of vertices connected by an edge and the weight of the edge (ui ≠ vi, 1 ≤ wi ≤ 109). It is guaranteed that graph is connected and that there is no more than one edge between any pair of vertices.
The last line of the input contains integer u (1 ≤ u ≤ n) — the number of the start vertex.
In the first line print the minimum total weight of the edges of the tree.
In the next line print the indices of the edges that are included in the tree, separated by spaces. The edges are numbered starting from1 in the order they follow in the input. You may print the numbers of the edges in any order.
If there are multiple answers, print any of them.
3 31 2 12 3 11 3 23
21 2
4 41 2 12 3 13 4 14 1 24
42 3 4
In the first sample there are two possible shortest path trees:
- with edges 1 – 3 and 2 – 3 (the total weight is 3);
- with edges 1 – 2 and 2 – 3 (the total weight is 2);
And, for example, a tree with edges 1 – 2 and 1 – 3 won't be a shortest path tree for vertex 3, because the distance from vertex 3 to vertex 2 in this tree equals 3, and in the original graph it is 1.
dij变形题,修改一下松弛边的条件就好了。
/*======================================================# Author: whai# Last modified: 2015-10-26 21:01# Filename: e.cpp======================================================*/#include <iostream>#include <cstdio>#include <vector>#include <algorithm>#include <cstring>#include <string>#include <cmath>#include <set>#include <map>#include <queue>using namespace std;#define LL __int64#define PB push_back#define P pair<LL, int>#define X first#define Y second#define MP make_pairconst int N = 3 * 1e5 + 5;struct edge { int to; LL cost; edge() {} edge(int _to, LL _c) { to = _to; cost = _c; }};int V;vector<edge> G[N];LL d[N];LL c[N];int pre[N];const LL INF = 10000000000000000LL;void dij(int s) { priority_queue< P, vector<P>, greater<P> > que; fill(d, d + V + 1, INF); d[s] = 0; que.push(P(0, s)); while(!que.empty()) { P p = que.top(); que.pop(); int v = p.Y; if(d[v] < p.X) continue; for(int i = 0; i < G[v].size(); ++i) { edge e = G[v][i]; if(d[e.to] > d[v] + e.cost) { d[e.to] = d[v] + e.cost; c[e.to] = e.cost; que.push(P(d[e.to], e.to)); pre[e.to] = v; } else if(d[e.to] == d[v] + e.cost && e.cost < c[e.to]) { c[e.to] = e.cost; pre[e.to] = v; } } }}map< pair<int, int>, int > e_id;int used[N];int cc[N];int main() { int n, m; scanf("%d%d", &n, &m); V = n; for(int i = 0; i < m; ++i) { int u, v; scanf("%d%d%d", &u, &v, &cc[i]); if(u > v) swap(u, v); G[u].PB(edge(v, cc[i])); G[v].PB(edge(u, cc[i])); e_id[MP(u, v)] = i; } int s; scanf("%d", &s); dij(s); //for(int i = 1; i <= n; ++i) { // cout<<d[i]<<' '<<pre[i]<<endl; //} for(int i = 1; i <= n; ++i) { int p = i; while(pre[p]) { int u = p; int v = pre[p]; if(u > v) swap(u, v); int id = e_id[MP(u, v)]; if(used[id]) break; used[id] = 1; p = pre[p]; } }LL sum = 0; for(int i = 0; i < m; ++i) { if(used[i]) sum += cc[i]; }cout<<sum<<endl; for(int i = 0; i < m; ++i) { if(used[i]) { cout<<i + 1<<' '; } } cout<<endl; return 0;}
- CodeForces 545E Paths and Trees
- codeforces 545 E. Paths and Trees
- Codeforces 545E Paths and Trees
- codeforces 545 Round #303 (Div. 2) E Paths and Trees
- CodeForces 545E Paths and Trees(最短路)
- Codeforces Round #303 (Div. 2) E. Paths and Trees
- Codeforces Round #303 (Div. 2)E. Paths and Trees 最短路
- CodeForces #303E Div.2 Paths and Trees(最短路+拓扑排序)
- Codeforces Round #303 (Div. 2) E. Paths and Trees (最短路+变形最小生成树)
- Codeforces Round #303 (Div. 2) - E. Paths and Trees(最短路)
- E. Paths and Trees (CF 303 div2)最短路
- codeforces545E Paths and Trees
- Codeforces 276E(Little Girl and Problem on Trees)
- codeforces 36E Two Paths
- codeforces 264E Roadside Trees
- 最小路径树 Codeforces545E Paths and Trees
- Codeforces#303-E - Paths and Treesg-最短路+最小生成树
- Codeforces Round #169 (Div. 2):E - Little Girl and Problem on Trees
- 手机网页开发学习(不定时更新)
- windows配置eclipse+cakephp开发
- kafka topic增加replica报错解决
- [转]在Eclipse中使用JUnit4进行单元测试(初级篇)
- Linux初学笔记之<chmod命令>
- codeforces 545 E. Paths and Trees
- 网站文件备份
- Android的NDK开发
- DIY Ruby CPU 分析 Part II
- 【Leetcode】Add Digits
- 游戏机制笔记——设计游戏机制(一)
- android 经典蓝牙 取消配对输入框 sdk 2.3 以上完美解决办法 最新
- java求解一元一次方程组
- opencv-第六章-拉普拉斯变换和canny算子