A Walk Through the Forest

最新推荐文章于 2025-02-21 20:20:08 发布

原创最新推荐文章于 2025-02-21 20:20:08 发布 · 480 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

最短路问题dijkstra 专栏收录该内容

8 篇文章

订阅专栏

本文探讨了在森林中寻找不同路径的算法，利用迪杰斯特拉算法与深度优先搜索结合，解决工作压力并享受自然之美。

点击打开链接

1.题目：

A Walk Through the Forest 

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

Total Submission(s) : 11   Accepted Submission(s) : 7

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 61 3 21 4 23 4 31 5 124 2 345 2 247 81 3 11 4 13 7 17 4 17 5 16 7 15 2 16 2 10
 


Sample Output

24
 


Source
 
University of Waterloo Local Contest 2005.09.24

2.思路：在dijkstra基础上加DFS（）

注意：1、dist[s]>dist[i]才能走

path[]记录多少条路

3.代码：

#include<stdio.h>
#include<string.h>
#define max 0x7fffffff
int map[1005][1005];
int visit[1005];
int dist[1005];
int path[1005];
void dijkstra(int v,int n)
{
    memset(dist,-1,sizeof(dist));
    for(int i=1;i<=n;i++)
    {
        dist[i]=map[v][i];
        visit[i]=0;
        path[i]=0;
    }
    visit[v]=1;
    dist[v]=0;
    for(int j=0;j<n;j++)
    {
        int min=max;
        int u;
        for(int i=1;i<=n;i++)
        {
            if(dist[i]<min&&visit[i]==0)
            {
                min=dist[i];
                u=i;
            }
        }
        visit[u]=1;
        for(int i=1;i<=n;i++)
        {
            if(map[u][i]!=max&&visit[i]==0)
            {
                int newdist=dist[u]+map[u][i];
                if(newdist<dist[i])
                {
                    dist[i]=newdist;
                }
            }
        }
    }
}
int DFS(int s,int n)
{
    if(s==2)
    return 1;
    int sum=0;
    for(int i=1;i<=n;i++)
    {
        if(map[s][i]!=max&&dist[s]>dist[i])
        {
            if(path[i])
            sum+=path[i];
            else
            sum+=DFS(i,n);
        }
    }
    path[s]=sum;
    return path[s];
}
int main()
{
    int n,m,a,b,c;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==0)
        break;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            map[i][j]=max;
        }
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            if(map[a][b]>c)
            map[a][b]=map[b][a]=c;
        }
        dijkstra(2,n);
        printf("%d\n",DFS(1,n));
    }
    return 0;
}
/*
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
*/