zoukankan      html  css  js  c++  java
  • Poj 最短路和次短路的个数 Dij+优化?。

    Description

    Tour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus moves from one city S to another city F. On this way, the tourists in the bus can see the sights alongside the route travelled. Moreover, the bus makes a number of stops (zero or more) at some beautiful cities, where the tourists get out to see the local sights.

    Different groups of tourists may have different preferences for the sights they want to see, and thus for the route to be taken from S to F. Therefore, Your Personal Holiday wants to offer its clients a choice from many different routes. As hotels have been booked in advance, the starting city S and the final city F, though, are fixed. Two routes from S to F are considered different if there is at least one road from a city A to a city B which is part of one route, but not of the other route.

    There is a restriction on the routes that the tourists may choose from. To leave enough time for the sightseeing at the stops (and to avoid using too much fuel), the bus has to take a short route from S to F. It has to be either a route with minimal distance, or a route which is one distance unit longer than the minimal distance. Indeed, by allowing routes that are one distance unit longer, the tourists may have more choice than by restricting them to exactly the minimal routes. This enhances the impression of a personal holiday.

    For example, for the above road map, there are two minimal routes from S = 1 to F = 5: 1 → 2 → 5 and 1 → 3 → 5, both of length 6. There is one route that is one distance unit longer: 1 → 3 → 4 → 5, of length 7.

    Now, given a (partial) road map of the Benelux and two cities S and F, tour operator Your Personal Holiday likes to know how many different routes it can offer to its clients, under the above restriction on the route length.

    Input

    The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:

    • One line with two integers N and M, separated by a single space, with 2 ≤ N ≤ 1,000 and 1 ≤ M ≤ 10, 000: the number of cities and the number of roads in the road map.

    • M lines, each with three integers A, B and L, separated by single spaces, with 1 ≤ A, BN, AB and 1 ≤ L ≤ 1,000, describing a road from city A to city B with length L.

      The roads are unidirectional. Hence, if there is a road from A to B, then there is not necessarily also a road from B to A. There may be different roads from a city A to a city B.

    • One line with two integers S and F, separated by a single space, with 1 ≤ S, FN and SF: the starting city and the final city of the route.

      There will be at least one route from S to F.

    Output

    For every test case in the input file, the output should contain a single number, on a single line: the number of routes of minimal length or one distance unit longer. Test cases are such, that this number is at most 109 = 1,000,000,000.

    Sample Input

    2
    5 8
    1 2 3
    1 3 2
    1 4 5
    2 3 1
    2 5 3
    3 4 2
    3 5 4
    4 5 3
    1 5
    5 6
    2 3 1
    3 2 1
    3 1 10
    4 5 2
    5 2 7
    5 2 7
    4 1

    Sample Output

    3
    2


    http://www.cnblogs.com/candy99/p/5873047.html //参考代码

    注意仔细体会vis数组,必不可少的,不仅仅是优化时间
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<queue>
    using namespace std;
    const int N=1005;
    const int M=10005;
    const int INF=0x3f3f3f3f;
    int n,m;
    struct edge{
       int to,w,next;
    }e[M];
    int head[N],tot=0;
    void add(int u,int v,int w){
        e[tot].to=v;
        e[tot].w=w;
        e[tot].next=head[u];
        head[u]=tot++;
    }
    int d[N][2],vis[N][2],cnt[N][2];
    struct hn{
         int u,d,p;
         hn(int a=0,int b=0,int c=0):u(a),d(b),p(c){}
         bool operator < (const hn &rhs)const{
          return d>rhs.d;
         }
    };
    void Dij(int s){
       priority_queue<hn>Q;
       memset(vis,0,sizeof(vis));
       memset(cnt,0,sizeof(cnt));
       for(int i=1;i<=n;++i) d[i][0]=d[i][1]=INF;
       Q.push(hn(s,0,0));
       d[s][0]=0,cnt[s][0]=1;
       while(!Q.empty()){
        hn now=Q.top();Q.pop();
        int u=now.u,p=now.p;
        if(vis[u][p]) continue;
        vis[u][p]=1;
        for(int i=head[u];i+1;i=e[i].next){
            int v=e[i].to,w=e[i].w;
            if(d[v][0]>d[u][p]+w) {
                d[v][1]=d[v][0],cnt[v][1]=cnt[v][0];
                d[v][0]=d[u][p]+w,cnt[v][0]=cnt[u][p];
                Q.push(hn(v,d[v][0],0));
                Q.push(hn(v,d[v][1],1));
            }
            else if(d[v][0]==d[u][p]+w) cnt[v][0]+=cnt[u][p];
            else if(d[v][1]>d[u][p]+w) {
                d[v][1]=d[u][p]+w;
                cnt[v][1]=cnt[u][p];
                Q.push(hn(v,d[v][1],1));
            }
            else if(d[v][1]==d[u][p]+w) cnt[v][1]+=cnt[u][p];
        }
       }
    }
    int main(){
         int T,u,v,w;
         for(scanf("%d",&T);T--;){
            memset(head,-1,sizeof(head));
            tot=0;
            scanf("%d%d",&n,&m);
            for(int i=1;i<=m;++i) { scanf("%d%d%d",&u,&v,&w);add(u,v,w);}
            int s,f;
            scanf("%d%d",&s,&f);
            Dij(s);
            if(d[f][1]==d[f][0]+1) cnt[f][0]+=cnt[f][1];
            printf("%d
    ",cnt[f][0]);
         }
    }
  • 相关阅读:
    生物学上描述DNA/RNA的长度常用的kb、nt、bp是指什么
    置换检验代码, matlab codes for permutation tests
    MATLAB命令大全——以字母顺序进行分类
    2011年春季C语言课程设计指导书
    C/C++语言课程设计任务书
    hibernate 自动生成数据库表
    利用Tomcat的用户名和密码构建“永久”后门
    flex成品作不知道有哪位大神能看懂是干嘛的
    wikioi1014 装箱问题
    怎样把USB键盘接到Android手机上
  • 原文地址:https://www.cnblogs.com/mfys/p/7238647.html
Copyright © 2011-2022 走看看