POJ 2662 UVA 10917

Problem C: A Walk Through the Forest

Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is on one side of a forest, and his house is on the other. A nice walk through the forest, seeing the birds and chipmunks is quite enjoyable.

The forest is beautiful, and Jimmy wants to take a different route everyday. He also wants to get home before dark, so he always takes a path to make progress towards his house. He considers taking a path from A to B to be progress if there exists a route from B to his home that is shorter than any possible route from A. Calculate how many different routes through the forest Jimmy might take.

Input

Input contains several test cases followed by a line containing 0. Jimmy has numbered each intersection or joining of paths starting with 1. His office is numbered 1, and his house is numbered 2. The first line of each test case gives the number of intersections  N , 1 <  N  ≤ 1000, and the number of paths  M . The following M  lines each contain a pair of intersections  a   b  and an integer distance  1 ≤ d ≤ 1000000  indicating a path of length  d  between intersection  a  and a different intersection  b . Jimmy may walk a path any direction he chooses. There is at most one path between any pair of intersections.

Output

For each test case, output a single integer indicating the number of different routes through the forest. You may assume that this number does not exceed 2147483647.

Sample Input

5 6
1 3 2
1 4 2
3 4 3
1 5 12
4 2 34
5 2 24
7 8
1 3 1
1 4 1
3 7 1
7 4 1
7 5 1
6 7 1
5 2 1
6 2 1
0

Output for Sample Input

2
4

---

(apologies to)  Richard Krueger

一个人要从办公室回家，他每次只走这样的路：

he considers taking a path from A to B to be progress if there exists a route from B to his home that is shorter than any possible route from A.

判断这样的条件显然要求一次最短路。

现在用dp[i]表示从节点1（办公室）到节点i满足上述条件的路的个数，则有如下递推式：

dp[1]=1;

dp[i]=sum(dp[j]) i与j相邻且d[j]>d[i] ,这样他才会从j走到i，因此到i的走法也是到j的走法之和 。（d[x]表示x到他家的距离。）

ans=dp[2].

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define TOT 1009
#define MAX 1000009
#define INF 999999999
using namespace std;
int first[TOT];
int u[MAX],v[MAX],w[MAX],next[MAX];
int d[TOT],dp[TOT];
bool done[TOT];
int n,m,tot;
typedef pair<int,int>pii;
priority_queue<pii,vector<pii>,greater<pii> >q;
void add(int x,int y, int z)
{
    u[tot]=x,v[tot]=y,w[tot]=z;
    next[tot]=first[x];
    first[x]=tot++;
}
void sp()
{
    for(int i=1;i<=n;i++)
        d[i]=INF;
    d[2]=0;
    memset(done,0,sizeof(done));
    q.push(make_pair(d[2],2));
    while(!q.empty())
    {
        pii u=q.top();q.pop();
        int x=u.second;
        if(done[x])continue;
        done[x]=1;
        for(int e=first[x];e!=-1;e=next[e])
        {
            if(d[v[e]]>d[x]+w[e])
            {
                d[v[e]]=d[x]+w[e];
                q.push(make_pair(d[v[e]],v[e]));
            }
        }
    }
}
int dfs(int cur)
{
    if(dp[cur]!=-1)return dp[cur];
    dp[cur]=0;
    for(int e=first[cur];e!=-1;e=next[e])
    {
        if(d[cur]<d[v[e]])
            dp[cur]+=dfs(v[e]);
    }
    return dp[cur];
}
int main()
{
    int i,j,k,x,y,z;
    while(scanf("%d",&n),n)
    {
        scanf("%d",&m);
        memset(first,-1,sizeof(first));tot=0;
        for(i=0;i<m;i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            add(x,y,z);
            add(y,x,z);
        }
        sp();
        memset(dp,-1,sizeof(dp));
        dp[1]=1;
        printf("%d\n",dfs(2));
    }
}