Codeforces 575G Run for beer 最短路

题解链接：http://www.cygmasot.com/index.php/2015/09/07/codeforces_575g/

题目链接：http://codeforces.com/contest/575/problem/G

G. Run for beer

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

People in BubbleLand like to drink beer. Little do you know, beer here is so good and strong that every time you drink it your speed goes 10 times slower than before you drank it.

Birko lives in city Beergrade, but wants to go to city Beerburg. You are given a road map of BubbleLand and you need to find the fastest way for him. When he starts his journey in Beergrade his speed is 1. When he comes to a new city he always tries a glass of local beer, which divides his speed by 10.

The question here is what the minimal time for him to reach Beerburg is. If there are several paths with the same minimal time, pick the one that has least roads on it. If there is still more than one path, pick any.

It is guaranteed that there will be at least one path from Beergrade to Beerburg.

Input

The first line of input contains integer N — the number of cities in Bubbleland and integer M — the number of roads in this country. Cities are enumerated from 0 to N - 1, with city 0 being Beergrade, and city N - 1 being Beerburg. Each of the following M lines contains three integers a, b (a ≠ b) and len. These numbers indicate that there is a bidirectional road between cities a and b with length len.

• 2 ≤ N ≤ 105
• 1 ≤ M ≤ 105
• 0 ≤ len ≤ 9
• There is at most one road between two cities

Output

The first line of output should contain minimal time needed to go from Beergrade to Beerburg.

The second line of the output should contain the number of cities on the path from Beergrade to Beerburg that takes minimal time.

The third line of output should contain the numbers of cities on this path in the order they are visited, separated by spaces.

Sample test(s)

input

8 10
0 1 1
1 2 5
2 7 6
0 3 2
3 7 3
0 4 0
4 5 0
5 7 2
0 6 0
6 7 7

output

32
3
0 3 7

题意：
给出的是n个点m条边的无向图 边权[0,9]
起点是0 终点是n-1
开始有个人在起点，速度是1，每走过一个点，这个人的速度就会缩小十倍
速度变化就是1>0.1>0.01

目标就是从起点到终点的最短时间

所以第一个数输出最短的时间
后面是输出一种路径
3
0 3 7
就是从0>3>7
思路：
实际上就是把这些边的数字从终点到起点直接拼接起来 就是最短的时间了
于是有个结论：经过的点越少越好
然而有一个bug就是边权是可以=0的
也就是这个数是可以有前导0的。
所以从终点bfs一下，只走边权为0的边，找到：bfs能走到且距离起点最近的点。
把这些点作为终点贪心地向起点扩散即可。

#include <map>
#include <iostream>  
#include <cstring>  
#include <string>  
#include <algorithm>  
#include <cstdio>  
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <stdio.h>
#include <ctime>  

using namespace std;
template <class T>
inline bool rd(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}
template <class T>
inline void pt(T x) {
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	if (x > 9) pt(x / 10);
	putchar(x % 10 + '0');
}
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 1e8;
const int N = 1e5 + 10;
int n, m;
vector<pii> G[N];
int d2[N];
int inq[N];
void spfa(int x, int *dis){
	memset(inq, 0, sizeof inq);
	queue<int>q;
	q.push(x);
	for (int i = 0; i < n; i++)dis[i] = inf;
	dis[x] = 0;
	while (!q.empty()){
		int u = q.front(); q.pop(); inq[u] = 0;
		for (auto v : G[u]){
			if (dis[v.first] > dis[u] + 1){
				dis[v.first] = dis[u] + 1;
				if (!inq[v.first])inq[v.first] = 1, q.push(v.first);
			}
		}
	}
}
int pre[N], val[N];
int dis[N];
struct Node{
	int val, c, dep;
	bool operator<(const Node&a)const{
		return val < a.val;
	}
};
int mdis;
int vis[N];
stack<Node>que;
int tim;
void go(queue<Node>&D){
	tim++;
	set<int>ch;
	while (!D.empty()){
		auto u = D.front(); D.pop();
		for (auto v : G[u.c]){
			if (dis[v.first] != u.dep - 1)continue;
			if (vis[v.first] == 0 || (vis[v.first] == tim && val[v.first] > v.second))
			{
				vis[v.first] = tim;
				val[v.first] = v.second;
				pre[v.first] = u.c;
				ch.insert(v.first);
			}
		}
	}
	set<pii>CH;
	for (auto v : ch)CH.insert({ val[v], v });
	for (auto v = CH.rbegin(); v != CH.rend(); v++)
		que.push({ v->first, v->second, dis[v->second] });
}
void bfs(){
	while (!que.empty())que.pop();
	for (int i = 0; i < n; i++)
	{
		if (vis[i] && dis[i] == mdis)
			que.push({ 0, i, mdis });
	}
	memset(vis, 0, sizeof vis);
	while (!que.empty()){
		queue<Node>D;
		D.push(que.top());
		que.pop();
		while (!que.empty()){
			if (D.front().dep == que.top().dep && D.front().val == que.top().val)
			{
				D.push(que.top());
				que.pop();
			}
			else break;
		}
		go(D);
	}
}
vector<int>ans;
void spfa2(){
	memset(inq, 0, sizeof inq);
	memset(vis, 0, sizeof vis);
	memset(pre, -1, sizeof pre);
	queue<int>q;
	q.push(n - 1);
	mdis = dis[n - 1];
	vis[n - 1] = 1;
	while (!q.empty()){
		int u = q.front(); q.pop();
		for (auto v : G[u]){
			if (v.second || vis[v.first])continue;
			vis[v.first] = 1;
			q.push(v.first);
			pre[v.first] = u;
			mdis = min(mdis, dis[v.first]);
		}
	}
}
void work(int idx){
	memset(pre, -1, sizeof pre);
	memset(vis, 0, sizeof vis);
	queue<int>q[2];
	int cur = 0, old = 1;
	q[0].push(0);
	for (int i = 0; i <= idx; i++)
	{
		swap(cur, old);
		while (!q[old].empty()){
			int u = q[old].front(); q[old].pop(); vis[u] = 1;
			for (auto v : G[u])
			{
				if (dis[u] + 1 == dis[v.first] && v.second == ans[i])
				{
					q[cur].push(v.first);
					pre[v.first] = u;
				}
			}
		}
	}
	while (!q[cur].empty())
	{
		int u = q[cur].front(); q[cur].pop();
		if (u == n - 1)break;
		for (auto v : G[u]){
			if (vis[v.first] || pre[v.first] != -1 || v.second)continue;
			vis[v.first] = 1;
			if (v.second == 0)
			{
				q[cur].push(v.first);
				pre[v.first] = u;
			}
		}
	}
}
int main(){
	rd(n); rd(m);
	for (int i = 1, u, v, V; i <= m; i++){
		rd(u); rd(v); rd(V);
		G[u].push_back({ v, V });
		G[v].push_back({ u, V });
	}
	spfa(0, dis);
	spfa2();
	bfs();
	int u = 0;
	while (1){
		ans.push_back(val[u]);
		if (u == n - 1)break;
		u = pre[u];
	}
	int id = ans.size() - 1;
	while (id)
	if (ans[id])break;
	else id--;
	work(id);
	for (; id >= 0; id--)pt(ans[id]);	puts("");
	ans.clear();
	int U = n - 1;
	while (1){
		ans.push_back(U);
		if (U == 0)break;
		U = pre[U];
	}
	reverse(ans.begin(), ans.end());
	pt(int(ans.size())); puts("");
	for (auto v : ans)pt(v), putchar(' ');
	return 0;
}
/*
5 7
4 1 0
1 2 0
2 4 0
3 4 0
3 0 1
1 0 2
2 0 3


9 7
0 3 7
0 5 2
3 2 9
2 7 3
6 7 9
7 8 9
5 6 9

9 14
2 7 3
3 0 7
4 0 5
6 1 6
3 6 5
5 0 2
0 1 9
1 2 9
2 3 9
3 4 9
4 5 9
5 6 9
6 7 9
7 8 9


3 13
0 1 3
0 1 5
2 0 0
0 1 0
2 0 2
0 2 8
1 0 8
0 2 5
1 0 0
1 0 2
2 0 5
0 1 9
1 2 9


6 6
5 1 0
5 2 1
1 3 1
2 4 2
3 4 2
4 0 0

6 7
0 1 1
1 3 9
1 2 1
3 2 1
2 4 1
3 5 2
4 5 0

4 4
0 1 3
0 2 1
1 3 2
2 3 2

2 1
0 1 0

6 19
4 0 9
0 4 2
5 1 8
4 0 6
4 0 8
0 4 4
2 3 0
0 1 0
0 4 0
3 0 5
3 2 8
4 5 0
0 2 2
0 5 6
0 1 9
1 2 9
2 3 9
3 4 9
4 5 9

13 21
0 2 0
1 7 3
2 9 2
9 6 0
0 9 5
10 1 3
2 7 6
8 11 0
0 1 0
0 1 9
1 2 9
2 3 9
3 4 9
4 5 9
5 6 9
6 7 9
7 8 9
8 9 9
9 10 9
10 11 9
11 12 9

*/