POJ3255 Roadblocks(次短路问题)
2018-03-12 18:34
274 查看
Roadblocks
DescriptionBessie 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).
InputLine 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)OutputLine 1: The length of the second shortest path between node 1 and node NSample Input4 4
1 2 100
2 4 200
2 3 250
3 4 100Sample Output450题意:求一个1到n的次短路,双向边,可以回走.
讲的很好的一个博客,点击打开,代码详解
代码:#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
using namespace std;
typedef long long ll;
const int maxn = 2e5+5;
const double esp = 1e-7;
const int ff = 0x3f3f3f3f;
map<int,int>::iterator it;
struct node
{
int to,w,next;
} r[maxn];//此题记得maxn至少要为2e5,别问我是怎么知道的
struct node2
{
int pos,cost;
node2(int pos = 0,int cost = 0):pos(pos),cost(cost){}
} ;
int n,m;
int dis[maxn],disc[maxn];// 存储最短路和次短路
int len,head[maxn];
void add(int a,int b,int c)
{
r[len].to= b;
r[len].w = c;
r[len].next = head[a];
head[a] = len++;
}
bool operator< (node2 a,node2 b)
{
return a.cost> b.cost;
}
void dijkstra()//堆优化的dijkstra
{
priority_queue<node2> q;
q.push(node2(1,0));
dis[1] = 0;
while(!q.empty())
{
node2 t = q.top();
q.pop();
if(t.cost> disc[t.pos])//比到此点的次短路长度还长,当然没用啦
continue;
for(int i = head[t.pos];i!= -1;i = r[i].next)
{
int id = r[i].to;
int d = t.cost+r[i].w;
if(d< dis[id])
{
swap(d,dis[id]);//记得用swap,还要把dis[id]的值传给disc[id]
q.push(node2(id,dis[id]));
}
if(d> dis[id]&&d< disc[id])
{
disc[id] = d;
q.push(node2(id,disc[id]));
}
}
}
cout<<disc
<<endl;
}
int main()
{
mem(dis,ff);
mem(disc,ff);
mem(head,-1);
cin>>n>>m;
for(int i = 1;i<= m;i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
add(a,b,c);
add(b,a,c);
}
dijkstra();
return 0;
}
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 17736 | Accepted: 6222 |
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).
InputLine 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)OutputLine 1: The length of the second shortest path between node 1 and node NSample Input4 4
1 2 100
2 4 200
2 3 250
3 4 100Sample Output450题意:求一个1到n的次短路,双向边,可以回走.
讲的很好的一个博客,点击打开,代码详解
代码:#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
using namespace std;
typedef long long ll;
const int maxn = 2e5+5;
const double esp = 1e-7;
const int ff = 0x3f3f3f3f;
map<int,int>::iterator it;
struct node
{
int to,w,next;
} r[maxn];//此题记得maxn至少要为2e5,别问我是怎么知道的
struct node2
{
int pos,cost;
node2(int pos = 0,int cost = 0):pos(pos),cost(cost){}
} ;
int n,m;
int dis[maxn],disc[maxn];// 存储最短路和次短路
int len,head[maxn];
void add(int a,int b,int c)
{
r[len].to= b;
r[len].w = c;
r[len].next = head[a];
head[a] = len++;
}
bool operator< (node2 a,node2 b)
{
return a.cost> b.cost;
}
void dijkstra()//堆优化的dijkstra
{
priority_queue<node2> q;
q.push(node2(1,0));
dis[1] = 0;
while(!q.empty())
{
node2 t = q.top();
q.pop();
if(t.cost> disc[t.pos])//比到此点的次短路长度还长,当然没用啦
continue;
for(int i = head[t.pos];i!= -1;i = r[i].next)
{
int id = r[i].to;
int d = t.cost+r[i].w;
if(d< dis[id])
{
swap(d,dis[id]);//记得用swap,还要把dis[id]的值传给disc[id]
q.push(node2(id,dis[id]));
}
if(d> dis[id]&&d< disc[id])
{
disc[id] = d;
q.push(node2(id,disc[id]));
}
}
}
cout<<disc
<<endl;
}
int main()
{
mem(dis,ff);
mem(disc,ff);
mem(head,-1);
cin>>n>>m;
for(int i = 1;i<= m;i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
add(a,b,c);
add(b,a,c);
}
dijkstra();
return 0;
}
相关文章推荐
- poj3255 Roadblocks 次短路
- Poj3255 Roadblocks SPFA算法解“次短路”问题 代码&注释
- POJ3255 Roadblocks 次短路
- poj3255 Roadblocks (次短路径问题)
- poj3255 Roadblocks【次短路】
- POJ3255 Roadblocks(次短路)
- Roadblocks--poj3255(次短路)
- poj3255 Roadblocks (次短路)
- 【POJ3255】【洛谷2865】[Usaco2006 Nov]路障Roadblocks(次短路)
- 次短路 poj3255 Roadblocks
- 九度OJ 1008:最短路径问题 (最短路)
- SSL 1613——最短路径问题(最短路)
- POJ3255-Roadblocks
- 两种K短路问题
- lingo求解最短路和最大流问题
- POJ3255 Roadblocks 【次短路】
- [luoguP2761] 软件补丁问题(状压最短路)
- Poj 2253 + 1797 + 1502 最短路的最小最大值问题
- 利用分支限界法求解单源最短路(Dijkstra)问题
- 带信号灯的最短路dijkstra问题(阿里巴巴2018校园招聘算法题)