A Walk Through the Forest (hdu 1142) (Dijkstra + DFS记忆化搜索)

A Walk Through the Forest

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 20   Accepted Submission(s) : 9

Problem Description

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

Sample Output

2

4

Source

University of Waterloo Local Contest 2005.09.24

这道题的解题思路与漫步校园(hdu 1428)基本一致，那道题是迷宫的形式出现，用BFS+优先队列求目的地到每个点的最短路比较方便，而这道题比较适合使用Dijkstra算法，在求出dis[i]时，就可以DFS搜索，剪枝+记忆化搜索(避免超时)。参考博客

#include<bits/stdc++.h>
using namespace std;
int const INF = 0x3fffffff;
int const MAX = 1005;
int dis[MAX], dp[MAX];
int mp[MAX][MAX];
bool vis[MAX];
int n, m;
void Dijkstra(int v0)
{
    memset(vis, false, sizeof(vis));
    for(int i = 1; i <= n; i++)
        dis[i] = INF;
    for(int i = 1; i <= n; i++)
        dis[i] = mp[v0][i];
    vis[v0] = true;
    dis[v0] = 0;
    for(int i = 1; i < n; i++)
    {
        int u = 0, mi = INF;
        for(int j = 1; j <= n; j++)
        {
            if(!vis[j] && dis[j] < mi)
            {
                mi = dis[j];
                u = j;
            }
        }
        vis[u] = true;
        for(int k = 1; k <= n; k++)
            if(!vis[k])
                dis[k] = min(dis[k], dis[u] + mp[u][k]);
    }
}
int DFS(int x)
{
    if(dp[x])
        return dp[x];
    if(x == 2)
        return 1;
    int tmp = 0;
    for(int i = 1; i <= n; i++)
        if(dis[x] > dis[i] && mp[x][i] != INF)
            tmp += DFS(i);
    return dp[x] = tmp;
}
 
int main()
{
    while(scanf("%d", &n) != EOF && n)
    {
        scanf("%d", &m);
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                mp[i][j] = INF;
        for(int i = 0; i < m; i++)
        {
            int u, v, w;
            scanf("%d %d %d", &u, &v, &w);
            mp[u][v] = mp[v][u] = w;
        }
        Dijkstra(2);
        memset(dp, 0, sizeof(dp));
        printf("%d\n", DFS(1));
    }
}