POJ 3255 Roadblocks

次短路。。。


Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %I64d & %I64u

[]   [Go Back]   [Status]  

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: AB, 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)

Source

[]   [Go Back]   [Status]  


#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int INF=0x3f3f3f3f;

struct Edge
{
    int to,next,cost;
}edge[210000];

int Adj[6000],Size,n,m;

void init()
{
    Size=0;
    memset(Adj,-1,sizeof(Adj));
}

void Add_Edge(int u,int v,int c)
{
    edge[Size].to=v;
    edge[Size].next=Adj[u];
    edge[Size].cost=c;
    Adj[u]=Size++;
}

int dist[6000][2];
bool vis[6000][2];

int dijkstra2D()
{
    memset(dist,63,sizeof(dist));
    memset(vis,false,sizeof(vis));

    dist[1][0]=0;

    for(int i=1;i<=2*n;i++)
    {
        int mark=-1,dd=INF,flag=-1;

        for(int i=1;i<=n;i++)
        {
            if(!vis[i][0]&&dd>dist[i][0])
            {
                dd=dist[i][0]; flag=0; mark=i;
            }
            else if(!vis[i][1]&&dd>dist[i][1])
            {
                dd=dist[i][1]; flag=1; mark=i;
            }
        }

        if(mark==-1||flag==-1) break;
        vis[mark][flag]=true;

        for(int i=Adj[mark];~i;i=edge[i].next)
        {
            int valu=edge[i].cost;
            int v=edge[i].to;

            if(dd+valu<dist[v][0])
            {
                dist[v][1]=dist[v][0];
                dist[v][0]=dd+valu;
            }
            else if(dd+valu<dist[v][1])
            {
                dist[v][1]=dd+valu;
            }
        }
    }

    return dist[n][1];
}

int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
    init();
    for(int i=0;i<m;i++)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        Add_Edge(a,b,c);
        Add_Edge(b,a,c);
    }
    printf("%d\n",dijkstra2D());
}
    return 0;
}



POJ 3255 Roadblocks,布布扣,bubuko.com

POJ 3255 Roadblocks

上一篇:MySQL-MMM如何调用远程管理卡命令去fence?


下一篇:Photoshop给外景人物图片打造出柔美的秋季棕黄色