Roadblocks
来源:互联网 发布:mac显卡性能测试软件 编辑:程序博客网 时间:2024/06/05 04:11
Roadblocks
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 16027 Accepted: 5673
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
Line 1: Two space-separated integers: N and R
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
Line 1: The length of the second shortest path between node 1 and node N
Sample Input
4 4
1 2 100
2 4 200
2 3 250
3 4 100
Sample Output
450
Hint
Two routes: 1 -> 2 -> 4 (length 100+200=300) and 1 -> 2 -> 3 -> 4 (length 100+250+100=450)
不知道为啥代码运行错误,次短路问题
#include<iostream>#include<queue>#include<vector>#include<algorithm>using namespace std;//http://poj.org/problem?id=3255const int INF=110000;struct edge{ int to,cost;};typedef pair<int,int> p;vector<edge> G[5500];edge t;int n,r,a,b,d,dist[5500],dist2[5500];void solve(){ priority_queue<p,vector<p>,greater<p> > q; fill(dist,dist+n,INF); fill(dist2,dist2+n,INF); dist[0]=0; q.push(p(0,0)); while(!q.empty()){ p pp=q.top();q.pop(); int v=pp.second,dd=pp.first; if(dist2[v]<dd)continue; for(int i=0;i<G[v].size();i++){ edge &e=G[v][i]; int d2=dd+e.cost; if(dist[e.to]>d2){ swap(dist[e.to],d2);//d2是次短长度了 q.push(p(dist[e.to],e.to)); } if(dist2[e.to]>d2&&dist[e.to]<d2){ dist2[e.to]=d2; q.push(p(dist2[e.to],e.to)); } } } cout<<dist2[n-1]<<endl;}int main(){ cin>>n>>r; for(int i=0;i<r;i++){ //从a到b连边,权重是d cin>>a>>b>>d; t.to=b;t.cost=d; G[a].push_back(t); t.to=a; G[b].push_back(t); } solve();}
- Roadblocks
- Roadblocks
- Roadblocks
- Roadblocks
- poj3255 - Roadblocks
- poj3225 Roadblocks
- POJ3255-Roadblocks
- poj3255 Roadblocks
- POJ3255 Roadblocks
- [USACO2006NOV] Roadblocks
- POJ3255-Roadblocks
- ***POJ3255-Roadblocks
- poj3255 Roadblocks
- PKU 3255 Roadblocks
- poj3255——Roadblocks
- poj 3255 Roadblocks
- poj 3255 Roadblocks
- POJ3255 Roadblocks , 次短路
- Java导入Excel表格,并将数据存入数组中
- Java GC(垃圾回收)机制知识总结
- 表单
- 深度学习概念
- urllib2的使用
- Roadblocks
- HTML解析原理
- 第一篇博客
- 第二周项目3(2)---汉诺塔程序
- RPC框架调用过程详解
- 算法——使用递归解决组合问题
- bootstrap时间控件
- 算法导论——集合S是否存在两个元素相加之和等于x
- NOI模拟:第k大(点分治)