2019 ACM-ICPC 全国邀请赛(陕西西安) M.Travel

M.Travel

题目链接: https://nanti.jisuanke.com/t/39280

Problem Description

There are $n$ planets in the MOT galaxy, and each planet has a unique number from $1\sim n$. Each planet is connected to other planets through some transmission channels. There are $m$ transmission channels in the galaxy. Each transmission channel connects two different planets, and each transmission channel has a length.
The residents of the galaxy complete the interplanetary voyage by spaceship. Each spaceship has a level. The spacecraft can be upgraded several times. It can only be upgraded $1$ level each time, and the cost is $c$. Each upgrade will increase the transmission distance by $d$ and the number of transmissions channels by $e$ to the spacecraft. The spacecraft can only pass through channels that are shorter than or equal to its transmission distance. If the number of transmissions is exhausted, the spacecraft can no longer be used.
Alice initially has a $0$-level spacecraft with transmission distance of $0$ and transmission number of $0$. Alice wants to know how much it costs at least, in order to transfer from planet $1$ to planet $n$.

Input

Each test file contains a single test case. In each test file:
The first line contains $n,m,$ indicating the number of plants and the number of transmission channels.
The second line contains $c,d,e,$ representing the cost, the increased transmission distance, and the increased number of transmissions channels of each upgrade, respectively.
Next $m$ lines, each line contains $u,v,w,$ meaning that there is a transmission channel between $u$ and $v$ with a length of $w$.$(2\le n\le 10^5,n-1\le m\le 10^5,1\le u,v\le n,1\le c,d,e,w\le 10^5)$
(The graph has no self-loop , no repeated edges , and is connected)

Output

Output a line for the minimum cost. Output $-1$ if she can’t reach.

Sample Input

5 7
1 1 1
1 2 1
1 3 5
1 4 1
2 3 2
2 4 5
3 4 3
3 5 5

Sample Output

5

题意

有$n$个点，编号从$1$到$n$，有$m$条边，每条边有一个长度$w$。
$Alice$有一艘飞船，$Alice$可以给它升级很多次（无限），每升级一次需要花费$c$，升级一次之后飞船单次可飞行距离增加$d$，可飞行次数增加$e$。如果飞船需要飞过一条边，就需要满足单次可飞行距离$\ge$这条路的长度同时可飞行次数不为$0$。
现在$Alice$在编号为$1$的点，她的飞船为$0$级，单次可飞行距离和可飞行次数都为$0$，请你求出最小的花费使得$Alice$可以到达$n$点，如果不能到达$n$则输出$-1$。
输入保证图联通，没有自环，没有重边。

思路

菜是原罪，人生第一次$icpc$因为我这题没写出来带着队友打铁了，赛后看了一下大佬的思路才会的。
观察输入数据的数据范围可以知道最多有$1\ast 10^5$条边，边的长度最长也就是$1\ast 10^5$，这也就说明最多升级$1\ast 10^5$次是肯定够的，又因为是联通图，所以输出$-1$的情况是不存在的，因为可以无限次升级，怎么样都能到达$n$点，就是花费的问题。
那么我们就可以对升级次数进行二分，然后$bfs$走一遍看看能不能到达$n$点，如果当前的升级次数可以到达$n$则更新最小的升级次数，最后输出$c$*最小升级次数就$ok$了。
最后记得用$longlong$，不然会爆$int$导致$wa$。

代码

#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define ll long long
#define pi acos(-1.0)

using namespace std;

typedef struct{//存边的结构体
	ll v, len;//入点编号，边的长度 
} node;

typedef struct{//bfs结点
	ll num, cnt;//当前点编号，可走边的次数 
} nodee;

const ll N = 1e5+5;
ll n, m, c, d, e, res = 0;
ll u, v, len, l = 0, r = N, vis[N];
vector<node> vec[N];

bool bfs(ll mid){
	ll dd = mid*d;//单次飞行最大可飞行距离 
	queue<nodee> que;
	memset(vis, 0, sizeof(vis));//初始化标记数组
	vis[1] = 1; //标记
	que.push((nodee){1, mid*e});//从1开始，还有mid*e次移动机会 
	while (que.size()){
		nodee nn = que.front(); que.pop();
		ll u = nn.num;
		if (u == n){//升级mid次可以到达n 
			return true;//成功
		}
		else{
			for (ll i = 0; i < vec[u].size(); i++){//遍历子节点 
				ll v = vec[u][i].v, dis = vec[u][i].len;
				if (!vis[v] && nn.cnt>0 && dd>=dis){//没去过v && 还可以移动 && 可以跳过去 
					vis[v] = 1;//标记，后面这个点就不用再来了
					que.push((nodee){v, nn.cnt-1});//次数减一 
				}
			}	
		}
	}
	return false;//失败
}

int main(){
	scanf("%lld%lld", &n, &m);
	scanf("%lld%lld%lld", &c, &d, &e);
	while (m--){
		scanf("%lld%lld%lld", &u, &v, &len);
		vec[u].push_back((node){v, len});//加边 
		vec[v].push_back((node){u, len});
	}
	while (l <= r){//二分升级次数 
		ll mid = (l+r)/2;
		if (bfs(mid)){//如果可行 
			res = mid;
			r = mid-1;//向更小的升级次数试探 
		}
		else{
			l = mid+1;//向更大的升级次数试探 
		}
	}
	printf("%lld\n", c*res);
	
	return 0;
}