UVA10917 Walk Through the Forest SPFA+DP

首先用最短路求出每一个点到终点的最短距离，然后按照可以走的路径要求即 dis[u]>dis[v] <u,v>在一张DAG图上做记忆化搜索即可。

Walk Through the Forest

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

[Submit]   [Go Back]   [Status]  

Description

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 fromA 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

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

using namespace std;

#define INF 0x3ffffff
#define MAXN 1010

struct node
{
	int to;
	int dis;
	int next;
}edge[MAXN*MAXN];

int head[MAXN],en;
bool in[MAXN];
int s[MAXN];
int n,m,dis[MAXN];
int dp[MAXN];

void add(int u,int v,int w)
{
    edge[en].to=v;
    edge[en].dis=w;
    edge[en].next=head[u];
    head[u]=en++;

    edge[en].to=u;
    edge[en].dis=w;
    edge[en].next=head[v];
    head[v]=en++;
}

void spfa(int s)
{
	queue<int> q;
	for(int i=1;i<=n;i++)
	{
		dis[i]=INF;
		in[i]=false;
	}
	dis[s]=0;
	in[s]=true;
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		in[u]=false;
		q.pop();
		for(int i=head[u];i!=-1;i=edge[i].next)
		{
			int v=edge[i].to;
			if(dis[u]+edge[i].dis<dis[v])
			{
				dis[v]=dis[u]+edge[i].dis;
				if(!in[v])
				{
					q.push(v);
					in[v]=true;
				}
			}
		}
	}
}


int dag_dp(int u)
{
    if(dp[u]!=-1) return dp[u];
    int tmp=0;
    for(int i=head[u];i!=-1;i=edge[i].next)
    {
        int v=edge[i].to;
        if(dis[v]<dis[u]) tmp+=dag_dp(edge[i].to);
    }
    return dp[u]=tmp;
}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        scanf("%d",&m);
        memset(head,-1,sizeof(head));en=0;
        int u,v,w;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&u,&v,&w);
            add(u,v,w);
        }
        spfa(2);
        memset(dp,-1,sizeof(dp));
        dp[2]=1;
        dag_dp(1);
        printf("%d\n",dp[1]);
    }
    return 0;
}