HDU 1142(单源最短路,记忆DFS)

转载 2015年11月20日 18:26:09

A Walk Through the Forest

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6964    Accepted Submission(s): 2565


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


#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define MAXN 1005
int cost[MAXN][MAXN];
int dis[MAXN];
int sum[MAXN];//记录路径数 
//*************************************************************
//Dijkstra-----数组实现
//单源最短路径
//cost[i][j]为i,j间的距离
//lowcost[]————从点beg到其他点的最近距离
//path[]---------beg为根展开的树,记录父亲结点
//*************************************************************
#define INF 0x3f3f3f3f  //这个无穷大不能太大,小心后面相加时溢出
#define typec int  //定义需要的数据类型
int path[MAXN],vis[MAXN];
void Dijkstra(typec cost[][MAXN],typec lowcost[MAXN],int n,int beg)
//结点是1~n标记的 
{
    int i,j;
    typec minc;
    memset(vis,0,sizeof(vis));
    vis[beg]=1;
    for(i=1;i<=n;i++)
    {
        lowcost[i]=cost[beg][i];path[i]=beg;
    }    
    lowcost[beg]=0;
    path[beg]=-1;//树根的标记
    int pre;
    for(int num=2;num<n;num++)//决定从pre出发的n-1个最短路
    {
        minc=INF;
        for(j=1;j<=n;j++)
           if(vis[j]==0&&lowcost[j]<minc)
           {pre=j;minc=lowcost[j];}
        if(minc>=INF)break;
        vis[pre]=1;
        for(j=1;j<=n;j++)
          if(vis[j]==0&&lowcost[pre]+cost[pre][j]<lowcost[j])
             {lowcost[j]=lowcost[pre]+cost[pre][j];path[j]=pre;}
    }     
}
//**********************************************************************   
int dfs(int i,int n)//记忆性搜索,类似于动态规划的方法,记录下来 
{
    if(i==2)  return 1;
    if(sum[i]!=-1)  return sum[i];
    int cnt=0;
    for(int j=1;j<=n;j++)
    {
        if(cost[i][j]<INF&&dis[j]<dis[i])
           cnt+=dfs(j,n);
    }
    sum[i]=cnt; 
    return sum[i];   
}    
int main()
{
    int i,j;
    int n,m;
    int a,b,d;
    while(scanf("%d",&n),n)
    {
        scanf("%d",&m);
        for(i=1;i<=n;i++)
           for(j=1;j<=n;j++)
           {
               if(i==j)cost[i][j]=0;
               else cost[i][j]=INF;
           } 
        while(m--)
        {
            scanf("%d%d%d",&a,&b,&d);
            cost[a][b]=d;
            cost[b][a]=d;
        }
        Dijkstra(cost,dis,n,2);
        memset(sum,-1,sizeof(sum));
        printf("%d\n",dfs(1,n));
               
    }    
}

相关文章推荐

hdu 1142 最短路径+dfs记忆化搜索

Jimmy experiences a lot of stress at work these days, especially since his accident made working dif...
  • winycg
  • winycg
  • 2016年04月18日 19:47
  • 118

【裸单源最短路:Dijkstra算法两种版本】hdu 1874 畅通工程续

Source : hdu 1874 畅通工程续 http://acm.hdu.edu.cn/showproblem.php?pid=1874 Problem Description 某省自从实行...

HDU - 2544 单源最短路

没什么说的,就是裸的单源最短路算法。 AC代码 #include #include #include #include #include #include #include #inclu...

HDU 2680 Choose the best route 最短路、Dijkstra、多源化单源最短路

最短路 有多个起点, 设为 g[0][i] = 0, 这样Dijkstra的 dist[i] 表示的是0 到 i的最短路径, 并且这样一设置 0 - 那些起点的路径长度就是0了,所以就当作起点是0, ...

HDU 1142 A Walk Through the Forest(spfa最短路+dfs记忆化搜索)

Problem Description Jimmy experiences a lot of stress at work these days, especially since his ac...

HDU2112HDU Today单源最短路

Problem Description 经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,...

hdu 1142/hrbust 1347 A Walk Through the Forest/森林中的路【SPFA+记忆化搜索】

森林中的路 Time Limit: 1000 MS Memory Limit: 32767 K   Total Subm...

HDU-1142 A Walk Through the Forest(最短路径+记忆化搜索)

原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1142 题目大意: 一个人下班回家,有很多条路可以走,已知1为工作地点,2为家,问有多少条路可以走回...

最短路练习10/poj/1511 Invitation Cards ,(两次spfa),(单源最短路,优先队列优化的Dijkstra)

题目链接:http://poj.org/problem?id=1511 Invitation Cards Time Limit: 8000MS   Memory Lim...

POJ - 3268 单源最短路

题意:给定一些有向边,以及一个目的地,从某个点到达目的地,再从目的地回到那个点。共有n个点,问这n个点花费最大是多少?            思路:从目的地回去直接把目的地作为源点即可。那么从某个点...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1142(单源最短路,记忆DFS)
举报原因:
原因补充:

(最多只允许输入30个字)