UVA - 10917 Walk Through the Forest

题目传送门

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#define MAXN 1010
//const long long INF = 1 << 33;
#define INF 1<<30
using namespace std;
struct Edge
{
	int from, to, dist;
	Edge(int f, int t, int d) :from(f), to(t), dist(d) {}
	Edge(){}
};
struct HeapNode
{
	int d, u;
	HeapNode(int dist, int id) :d(dist), u(id) {}
	HeapNode() {}
	bool operator < (const HeapNode& rhs) const
	{
		return d > rhs.d;
	}
};
struct Dijkstra
{
	int n, m;
	vector<Edge> edges;
	vector<int> G[MAXN];
	bool done[MAXN];
	int d[MAXN];
	int p[MAXN];

	void init(int n)
	{
		this->n = n;
		for (int i = 0; i < n; i++)G[i].clear();
		edges.clear();
	}
	void AddEdge(int from, int to, int dist)
	{
		Edge temp(from, to, dist);
		edges.push_back(temp);
		m = edges.size();
		G[from].push_back(m - 1);
	}
	void dijkstra(int s)
	{
		priority_queue<HeapNode> Q;
		for (int i = 0; i < n; i++)d[i] = INF;
		d[s] = 0;
		memset(done, 0, sizeof(done));
		HeapNode temp(0, s);
		Q.push(temp);
		while (!Q.empty())
		{
			HeapNode x = Q.top();
			Q.pop();
			int u = x.u;
			if (done[u])continue;
			done[u] = true;
			for (int i = 0; i < G[u].size(); i++)
			{
				Edge& e = edges[G[u][i]];
				if (d[e.to] > d[u] + e.dist)
				{
					d[e.to] = d[u] + e.dist;
					p[e.to] = G[u][i];
					temp.d = d[e.to];
					temp.u = e.to;
					Q.push(temp);
				}
			}
		}
	}
}solve;
//dijkstra模板
int mmp[MAXN][MAXN];//A->B的DAG
int mpp[MAXN][MAXN];//邻接矩阵
int dp[MAXN];//用以完成记忆化搜索的数组
int dist[MAXN];//保存终点到各个点的最短距离
int n;
int dfs(int x)
{//记忆化搜索
	if (x == 1)return 1;//回到家了就返回1
	if (dp[x] != -1)return dp[x];//如果这个点走过就没必要走了
	int ans = 0;//不能到家就还是0咯
	for (int i = 0; i < n; i++)
		if (mmp[x][i]&&mpp[x][i])
			ans += dfs(i);//满足两边可达，并且A->B成立就大胆的往前走吧！！！
	return dp[x] = ans;//记录走到这个点是能走到终点的最大数值
}
int main(void)
{
	while (scanf_s("%d", &n) != EOF && n)
	{
		int m;

		scanf_s("%d", &m);
		memset(mmp, 0, sizeof(mmp));
		memset(mpp, 0, sizeof(mpp));
		memset(dp, -1, sizeof(dp));
		solve.init(n);
		//初始化
		for (int i = 0; i < m; i++)
		{//构建图形
			int from, to, dist;

			scanf_s("%d%d%d", &from, &to, &dist);
			from--, to--;
			solve.AddEdge(from, to, dist);
			solve.AddEdge(to, from, dist);
			mpp[from][to] = mpp[to][from] = 1;
		}
		solve.dijkstra(1);//终点到各点的最短距离
		for (int i = 0; i < n; i++)dist[i] = solve.d[i];
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)//构造A->B
				if (dist[i] > dist[j])mmp[i][j] = 1;
		printf("%d\n", dfs(0));
	}

	return 0;
}