51nod1459 迷宫游戏

题目传送门

妈耶，果然还是不能太莽，上来dfs果然超时了，完蛋！！！（先奉上我的TLE代码，呜呜呜）

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#define MAXN 555
#define INF 0x3f3f3f
using namespace std;
int mmp[MAXN][MAXN];
int pointt[MAXN];
bool book[MAXN];
int start, endd;
int N, M;
int ans_time = INF;
int ans_point = 0;
void dfs(int cur, int time, int point)
{
	if (cur == endd)
	{
		if (time == ans_time && point > ans_point) { ans_time = time; ans_point = point; }
		else if (time < ans_time) { ans_time = time; ans_point = point; }
		else return;
	}
	for (int i = 1; i <= N; i++)
		if (!book[i] && mmp[cur][i] != INF)
		{
			book[i] = true;
			dfs(i, time + mmp[cur][i], point + pointt[i]);
			book[i] = false;
		}
}
int main(void)
{
	scanf("%d%d%d%d", &N, &M, &start, &endd);
	start++, endd++;
	for (int i = 1; i <= N; i++)for (int j = 1; j <= N; j++)mmp[i][j] = INF;
	memset(book, false, sizeof(book));
	for (int i = 1; i <= N; i++)scanf("%d", &pointt[i]);
	for (int i = 0; i < M; i++)
	{
		int u, v, power;

		scanf("%d%d%d", &u, &v, &power);
		u++, v++;
		mmp[u][v] = mmp[v][u] = power;
	}
	dfs(start, 0, pointt[start]);
	printf("%d %d\n", ans_time, ans_point);

	//system("pause");

	return 0;
}

莽过之后，又来了一发dijkstra果然过了，靠谱！！！（刘汝佳的模板靠谱）

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#define MAXN 1010
#define INF 0x3f3f3f
using namespace std;
int pointt[MAXN];
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 point[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;
		for (int i = 0; i < n; i++)point[i] = 0;
		point[s] = pointt[s];
		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;
					point[e.to] = point[u] + pointt[e.to];
					p[e.to] = G[u][i];
					temp.d = d[e.to];
					temp.u = e.to;
					Q.push(temp);
				}
				else if (d[e.to] == d[u] + e.dist)
					point[e.to] = max(point[e.to], point[u] + pointt[e.to]);
			}
		}
	}
}solve;
//dijkstra模板
int main(void)
{
	int N, M, start, endd;

	scanf("%d%d%d%d", &N, &M, &start, &endd);
	for (int i = 0; i < N; i++)scanf("%d", &pointt[i]);
	solve.init(N);
	for (int i = 0; i < M; i++)
	{
		int u, v, power;

		scanf("%d%d%d", &u, &v, &power);
		solve.AddEdge(u, v, power);
		solve.AddEdge(v, u, power);
	}
	solve.dijkstra(start);
	printf("%d %d\n", solve.d[endd], solve.point[endd]);

	//system("pause");

	return 0;
}