POJ 3255
来源:互联网 发布:restful框架 php 编辑:程序博客网 时间:2024/05/21 11:32
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 41 2 1002 4 2002 3 2503 4 100
Sample Output
450
Hint
Source
题意:
要绝对意义的次短路,一定要比最短路短
#include <string>#include <string.h>#include <iostream>#include <queue>#include <math.h>#include <stdio.h>#include <algorithm>using namespace std;#define LL long longconst int maxn = 200000+55;const int inf = 0x3f3f3f3f;int n,m;int head[5555],nxt[maxn],to[maxn],sz=0,w[maxn];int dis[5555][2];typedef pair<int, int> pi;void dij(){for(int i=1;i<=n;i++) dis[i][0]=dis[i][1]=inf;priority_queue<pi,vector<pi>,greater<pi> >q;q.push(make_pair(0, 1));while(!q.empty()){int now=q.top().first;int u=q.top().second;q.pop();if(dis[u][1]<now) continue;for(int i=head[u];~i;i=nxt[i]){int v=to[i];int ww=w[i];if(now+ww<dis[v][0]){dis[v][1]=now+ww;swap(dis[v][1], dis[v][0]);q.push(make_pair(dis[v][0], v));}else if(now+ww<dis[v][1]&&now+ww>dis[v][0]){dis[v][1]=now+ww;q.push(make_pair(dis[v][1],v));}}}printf("%d\n",dis[n][1]);}int main(){scanf("%d %d",&n,&m);for(int i=1;i<=n;i++) head[i]=-1;for(int i=1;i<=m;i++){int u,v,ww;scanf("%d %d %d",&u,&v,&ww);nxt[sz]=head[u],to[sz]=v,w[sz]=ww,head[u]=sz++;nxt[sz]=head[v],to[sz]=u,w[sz]=ww,head[v]=sz++;}dij();return 0;}
- POJ 3255
- poj 3255
- poj 3255
- poj 3255
- POJ 3255
- POJ 3255
- poj 3255
- poj 3255
- poj 3255
- poj 3255
- POJ 3255
- poj 3255
- POJ 3255
- poj 3255 Roadblocks
- poj 3255 Roadblocks
- poj 3255 求次大最短路
- POJ-3255-Roadblocks
- POJ 3255 Roadblocks
- java 生成2维码
- 【高效代码调错系列之代码规范】——让软件学会自己寻找缺陷
- js模块历程
- 习题6.4
- Android 签名打包出现的错误的解决方法以及代码中获取应用签名信息方法
- POJ 3255
- ARM概述
- Redhat(红帽)yum 源更新出现database disk image is malformed
- 小程序支付绑定服务号支付步骤,微信小程序支付绑定商户号支付
- Ubuntu用户、用户组管理命令
- AT&T汇编学习总结二-汇编语言程序范例
- 主成分分析与因子分析的区别
- Java Struts2 POI创建Excel文件并实现文件下载
- Android 在低版本4.4以上 动态设置状态栏和底部导航栏的背景色