POJ-2662-A Walk Through the Forest

题目可以转换为求目的地到各店的距离，然后进行一次DFS记忆化搜索则可得到结果~

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
const int maxn=1101;
const int inf=1<<30;
struct Edge
{
    int from;
    int to;
    int dist;
};
struct HeapNode
{
    int d;
    int u;
    bool operator < (const HeapNode a)const
    {
	return d>a.d;
    }
};
struct Dijkstra
{
    int n,m;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int dist[maxn];
    int pre[maxn];
    int dp[maxn];
    void Init(int n)
    {
	this->n=n;
	for(int i=0;i<=n;i++)
	    G[i].clear();
	edges.clear();
	memset(dp,-1,sizeof(dp));
    }
    void AddEdge(int from ,int to,int dist)
    {
	edges.push_back((Edge){from,to,dist});
	m=edges.size();
	G[from].push_back(m-1);
    }
    void dijkstra(int s)
    {
	priority_queue<HeapNode> Q;
	for(int i=0;i<=n;i++)
	    dist[i]=inf;
	dist[s]=0;
	memset(vis,0,sizeof(vis));
	Q.push((HeapNode){0,s});
	while(!Q.empty())
	{
	    HeapNode x=Q.top();
	    Q.pop();
	    int u=x.u;
	    if(vis[u])
		continue;
	    vis[u]=1;
	    for(int i=0;i<G[u].size();i++)
	    {
		Edge e=edges[G[u][i]];
		if(dist[e.to]>dist[u]+e.dist)
		{
		    dist[e.to]=dist[u]+e.dist;
		    pre[e.to]=G[u][i];
		    Q.push((HeapNode){dist[e.to],e.to});
	        }
	    }
	    
	}
    }
    
    int DFS(int root)
    {
	if(dp[root]!=-1)
	    return dp[root];
	dp[root]=0;
	for(int i=0;i<G[root].size();i++)
	{
	    Edge e=edges[G[root][i]];
	    if(dist[root]>dist[e.to])
	    {
		dp[root]+=DFS(e.to);
	    }
	}
	return dp[root];
    }
}dis;
int n,m;
int main()
{
    while(scanf("%d",&n)&&n)
    {
	scanf("%d",&m);
	dis.Init(n);
	for(int i=0;i<m;i++)
	{
	    int ita,itb,itc;
	    scanf("%d%d%d",&ita,&itb,&itc);
	    dis.AddEdge(ita,itb,itc);
	    dis.AddEdge(itb,ita,itc);
	}
	dis.dp[2]=1;
	dis.dijkstra(2);
	printf("%d\n",dis.DFS(1));
    }
    return 0;
}