SCU OJ_4444_ Travel_最短路（大数据）

最新推荐文章于 2018-05-04 15:09:45 发布

持之以恒_fighting

最新推荐文章于 2018-05-04 15:09:45 发布

阅读量2k

点赞数 1

分类专栏：最短路径

本文链接：https://blog.csdn.net/huangshuai147/article/details/51433352

版权

该博客探讨了在存在两种交通方式（公路和铁路）的n个城市中，从城市1到城市n的最短路径问题。文章指出，由于所有城市相互连通，所以存在两种情况：直接通过某条路线到达或间接到达。针对这种情况，博主提出了使用BFS（广度优先搜索）解决直接到达的情况，并解释了为何SPFA（Shortest Path Faster Algorithm）在处理间接到达时可能超时。为了解决这个问题，博主建议利用集合和队列来优化搜索过程，确保不超过n-1次连接，从而找到间接到达n的最短路径。

摘要由CSDN通过智能技术生成

I - Travel
Time Limit:0MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status

Description
Travel

The country frog lives in has n
towns which are conveniently numbered by 1,2,…,n

.

Among n(n?1)2
pairs of towns, m of them are connected by bidirectional(双向的) highway(公路), which needs a minutes to travel.
The other pairs are connected by railway, which needs b

minutes to travel.

Find the minimum(最小的) time to travel from town 1
to town n

.
Input

The input(投入) consists of multiple tests. For each test:

The first line contains 4
integers n,m,a,b (2≤n≤105,0≤m≤5?105,1≤a,b≤109). Each of the following m lines contains 2 integers ui,vi,
which denotes(表示) cities ui and vi are connected by highway(公路). (1≤ui,vi≤n,ui≠vi

).
Output