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 A Walk Through the Forest

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1142 题目大意: 给你一个图,找最短路。但是有个非一般的的条件:如果a,b之间有路,且你选择要走这...
  • niushuai666
  • niushuai666
  • 2011年09月18日 19:57
  • 2290

HDU1142:A Walk Through the Forest(Dijkstra+dfs)

Problem Description Jimmy experiences a lot of stress at work these days, especially since his acci...
  • libin56842
  • libin56842
  • 2013年12月11日 21:39
  • 1736

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

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

HDU 1142详解带翻译 (以前看了好多大神的算法看不懂,学了之后终于看懂了,献给和我一样刚入门的菜鸟)

HDU 1142 题目翻译:(英语差劲) 问题描述 森林是美丽的,吉米要采取不同的路线每天。他还希望在天黑前回家,所以他总是一直朝着他家的行进。如果存在从B到他家的路线比从A短, 则可以由A走到B。计...
  • Gaokao_Sijiao
  • Gaokao_Sijiao
  • 2016年04月13日 20:23
  • 373

HDU-2544-最短路-单源最短路+Dijkstra算法

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2544 好吧,这是我第一次写最短路问题,之前看一个人的博客,结果那个人的博客有问题。。。我也是醉了,写...
  • wlxsq
  • wlxsq
  • 2015年07月29日 10:04
  • 667

1142 hdu (最短路 + DFS)

#include //2564308 2010-07-01 11:08:17 Accepted 1142 109MS 4192K 1557 B C++ 悔惜晟 #include #include us...
  • huixisheng
  • huixisheng
  • 2010年07月01日 11:14
  • 296

hdu 1258 Sum It Up (dfs+路径记录)

Sum It Up Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...
  • u011721440
  • u011721440
  • 2014年08月04日 18:42
  • 1059

关于记忆化搜索

转载自:http://blog.csdn.net/urecvbnkuhbh_54245df/article/details/5847876 记忆化搜索:   算法上依然是搜索的流程,但是搜索到的一些解...
  • Acmer_Sly
  • Acmer_Sly
  • 2016年12月03日 00:33
  • 3358

hdu---1010 Tempter of the Bone (经典DFS,注意剪枝)

Tempter of
  • u013064109
  • u013064109
  • 2014年07月10日 17:46
  • 714

hdu 1518 Square(深搜dfs)

hdu 1518 Square(dfs)
  • u012860063
  • u012860063
  • 2014年07月17日 09:40
  • 1461
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1142(单源最短路,记忆DFS)
举报原因:
原因补充:

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