算法复习———dijkstra求次短路(poj3255)
题目:
Description
Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She has decided to take the second-shortest rather than the shortest path. She knows there must be some second-shortest path.
The countryside consists of R (1 ≤ R ≤ 100,000) bidirectional roads, each linking two of the N (1 ≤ N ≤ 5000) intersections, conveniently numbered 1..N. Bessie starts at intersection 1, and her friend (the destination) is at intersection N.
The second-shortest path may share roads with any of the shortest paths, and it may backtrack i.e., use the same road or intersection more than once. The second-shortest path is the shortest path whose length is longer than the shortest path(s) (i.e., if two or more shortest paths exist, the second-shortest path is the one whose length is longer than those but no longer than any other path).
Input
Lines 2..R+1: Each line contains three space-separated integers: A, B, and D that describe a road that connects intersections A and B and has length D (1 ≤ D ≤ 5000)
Output
Sample Input
4 4
1 2 100
2 4 200
2 3 250
3 4 100
Sample Output
450
Hint
Source
题解:
次短路的模板题(注意是严格次短),详细见https://www.cnblogs.com/iiyiyi/p/4706182.html
但注意代码中的注释部分
代码:
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<cctype>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;
priority_queue< pair<long long ,int> >que;
const int N=;
const int M=1e5+;
const int inf=0x3f3f3f3f;
int sedis[N],dis[N],fst[N],nxt[M*],go[M*],val[M*],tot,n,m;
inline int R(){
char c;int f=;
for(c=getchar();c<''||c>'';c=getchar());
for(;c<=''&&c>='';c=getchar()) f=(f<<)+(f<<)+c-'';
return f;
}
inline void comb(int a,int b,int c){
nxt[++tot]=fst[a],fst[a]=tot,go[tot]=b,val[tot]=c;
nxt[++tot]=fst[b],fst[b]=tot,go[tot]=a,val[tot]=c;
}
inline void getans(){
memset(dis,inf,sizeof(dis));memset(sedis,inf,sizeof(sedis));
dis[]=;que.push(make_pair(,));
while(!que.empty()){
int u=que.top().second,d=que.top().first;d=-d;que.pop(); //注意这里的d!!!!!!
for(int e=fst[u];e;e=nxt[e]){
int v=go[e];
if(sedis[v]<val[e]+d) continue;
else if(dis[v]>val[e]+d){
sedis[v]=dis[v];
dis[v]=val[e]+d;que.push(make_pair(-dis[v],v));
}
else if(dis[v]<val[e]+d&&sedis[v]>val[e]+d){
sedis[v]=d+val[e];que.push(make_pair(-sedis[v],v));
}
}
}
}
int main(){
//freopen("a.in","r",stdin);
n=R(),m=R();int a,b,c;
for(int i=;i<=m;i++){
a=R(),b=R(),c=R();comb(a,b,c);
}
getans();cout<<sedis[n]<<endl;
return ;
}
最新文章
- centos 安装 rabbitMQ
- Linux下搭建Windows KMS服务器
- sql server 写性能优化
- ecshop 如果缩略图为空,使用默认图片
- 表格的一些原生js操作(隔行变色,高亮显示,添加删除,搜索)
- swift 模式
- OD调试3--reverseMe
- 从Linux终端管理进程:10个你必须知道的命令
- Photoshop 画基本图形
- [Centos7] bbc tools安装
- 【移动开发】binder阻塞/非阻塞与单向/双向的问题
- Spring源码阅读笔记
- Pocket Gem OA: Log Parser
- The threat to world
- python scrapy 登录知乎过程
- 【SQL】group by 和order by 的区别。
- mac上mysql root密码忘记或权限错误的解决办法
- 回收机制GC
- 一个非常有意思的蜜罐T-Pot 16.10
- 第一次spring,第三天。