HDU3191 【输出次短路条数】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3191

How Many Paths Are There

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2128    Accepted Submission(s):
749

Problem Description

  oooccc1 is a Software Engineer who has to ride to the
work place every Monday through Friday. For a long period, he went to office
with the shortest path because he loves to sleep late…Time goes by, he find that
he should have some changes as you could see, always riding with the same path
is boring.
  One day, oooccc1 got an idea! Why could I take another path?
Tired at all the tasks he got, he got no time to carry it out. As a best friend
of his, you’re going to help him!
  Since oooccc1 is now getting up earlier,
he is glad to take those paths, which are a little longer than the shortest one.
To be precisely, you are going to find all the second shortest paths.
  You
would be given a directed graph G, together with the start point S which stands
for oooccc’1 his house and target point E presents his office. And there is no
cycle in the graph. Your task is to tell him how long are these paths and how
many there are.

 

Input

There are some cases. Proceed till the end of
file.
The first line of each case is three integers N, M, S, E (3 <= N
<= 50, 0 <= S , E <N)
N stands for the nodes in that graph, M stands
for the number of edges, S stands for the start point, and E stands for the end
point.
Then M lines follows to describe the edges: x y w. x stands for the
start point, and y stands for another point, w stands for the length between x
and y.
All the nodes are marked from 0 to N-1.

 

Output

For each case,please output the length and count for
those second shortest paths in one line. Separate them with a single
space.

题目大意：给定一张有向图，求出起点到终点的次短路条数。

思路：很简单的一道题次短路条数模板题， 但是WA了 看讨论说是不能用优先队列dij，但是我不想改了 上个错误模板代码。

代码如下：

 #include<stdio.h>
 #include<string.h>
 #include<queue>
 #define mem(a, b) memset(a, b, sizeof(a))
 const int MAXN = ;
 const int MAXM = ;
 const int inf = 0x3f3f3f3f;
 using namespace std;

 int n, m, st, ed;
 int head[MAXN], cnt;
 int dis[][MAXN], num[][MAXN], vis[][MAXN];

 struct Edge
 {
     int to, next, w;
 }edge[MAXM];

 struct Node
 {
     int id, dis, p;
     bool operator < (const Node &a)const
     {
         return dis > a.dis;
     }
 }no;

 void add(int a, int b, int c)
 {
     cnt ++;
     edge[cnt].to = b;
     edge[cnt].w = c;
     edge[cnt].next = head[a];
     head[a] = cnt;
 }

 void dij()
 {
     mem(vis, );
     priority_queue<Node> Q;
     for(int i = ; i < n; i ++)
     {
         dis[][i] = dis[][i] = inf;
         num[][i] = num[][i] = ;
     }
     dis[][st] = ;
     num[][st] = ;
     no.p = , no.id = st, no.dis = ;
     Q.push(no);
     while(!Q.empty())
     {
         Node a = Q.top();
         Q.pop();
         if(vis[a.p][a.id])
             continue;
         vis[a.p][a.id] = ;
         for(int i = head[a.id]; i != -; i = edge[i].next)
         {
             int to = edge[i].to;
             if(dis[][to] > dis[a.p][a.id] + edge[i].w)
             {
                 dis[][to] = dis[][to];
                 dis[][to] = dis[a.p][a.id] + edge[i].w;
                 num[][to] = num[][to];
                 num[][to] = num[a.p][a.id];
                 no.p = , no.dis = dis[][to], no.id = to;
                 Q.push(no);
                 no.p = , no.dis = dis[][to], no.id = to;
                 Q.push(no);
             }
             else if(dis[][to] == dis[a.p][a.id] + edge[i].w)
                 num[][to] += num[a.p][a.id];
             else if(dis[][to] > dis[a.p][a.id] + edge[i].w)
             {
                 dis[][to] = dis[a.p][a.id] + edge[i].w;
                 num[][to] = num[a.p][a.id];
                 no.p = , no.dis = dis[][to], no.id = to;
                 Q.push(no);
             }
             else if(dis[][to] == dis[a.p][a.id] + edge[i].w)
                 num[][to] += num[a.p][a.id];
         }
     }
 }

 int main()
 {
     while(scanf("%d%d%d%d", &n, &m, &st, &ed) != EOF)
     {
         mem(head, -), cnt = ;
         for(int i = ; i <= m; i ++)
         {
             int a, b, c;//有向图
             scanf("%d%d%d", &a, &b, &c);
             add(a, b, c);
         }
         dij();
         printf("%d %d\n", dis[][ed], num[][ed]);
     }
     return ;
 }

HDU3191