PAT(Advance)1018. Public Bike Management

PAT(Advance)1018. Public Bike Management

该题分制为30分。
题目链接：https://pintia.cn/problem-sets/994805342720868352/problems/994805489282433024

A1018其实不难，使用dijkstra+DFS模板就能解决。

但是有几个坑：
1.路线无法返回，意味着后面多的车不能送到前面的点。我第一次提交的时候没考虑到只拿了18分。
2.题目不仅要求送出车辆最少，返回的车辆也要最少。这是第七个测试点过不了的原因。

#include<iostream>
#include<vector>
using namespace std;
const int maxn = 510;
const int INF = 100000;
int G[maxn][maxn];
vector<int>pre[maxn];
vector<int>path;
vector<int>tempPath;
int w[maxn],d[maxn];
bool vis[maxn] = { false };
int Cm, N, P, M, opValue=INF,back=0;

void Dijkstra(int s)
{
	fill(d, d + maxn, INF);
	d[s] = 0;
	for (int i = 0; i <= N; i++)
	{
		int u = -1, MIN = INF;
		for (int j = 0; j < N; j++)
		{
			if (!vis[j] && d[j] < MIN)
			{
				MIN = d[j];
				u = j;
			}
		}
		if (u == -1)
		{
			return;
		}
		vis[u] = true;
		for (int v = 0; v <= N; v++)
		{
			if (!vis[v] && G[u][v] != INF)
			{
				if (G[u][v] + d[u] < d[v])
				{
					d[v] = G[u][v] + d[u];
					pre[v].clear();
					pre[v].push_back(u);
				}
				else if (d[u] + G[u][v] == d[v])
				{
					pre[v].push_back(u);
				}
			}
		}
	}
}

void DFS(int v)
{
	if (v == 0)
	{
		tempPath.push_back(v);

		int more = 0, need = 0;
		for (int i = tempPath.size() - 2; i >= 0; i--)
		{
			int id = tempPath[i];
			if (more + w[id] >= 0)  //因为无法返回，所有不能将后面点多的车送到前面。
			{
				more += w[id];
			}
			else
			{
				need -= more + w[id];
				more = 0;					
			}
		}
		if (need < opValue)
		{
			opValue = need;
			back = more;
			path = tempPath;
		}
		else if (need == opValue&&more< back) //题目要求在送出去最少的的自行车前提下，还需要返回车辆最少。
		{
			back = more;
			path = tempPath;
		}
		tempPath.pop_back();
		return;
	}
	tempPath.push_back(v);
	for (int i = 0; i < pre[v].size(); i++)
	{
		DFS(pre[v][i]);
	}
	tempPath.pop_back();
}

int main()
{
	fill(G[0], G[0] + maxn * maxn, INF);
	fill(w, w + maxn, INF);	
	cin >> Cm >> N >> P >> M;
	w[0] = 0;
	for (int i = 1; i <= N; i++)
	{
		cin >> w[i];
		w[i] = w[i] - Cm / 2;
	}
	for (int i = 0; i < M; i++)
	{
		int u, v;
		cin >> u >> v;
		cin >> G[u][v];
		G[v][u] = G[u][v];
	}

	Dijkstra(0);
	DFS(P);

	//cout << opValue << endl;

	cout << opValue<<" ";

	for (int i = path.size() - 1; i >= 0; i--)
	{
		cout << path[i];
		if (i > 0)
		{
			cout << "->";
		}
	}
	cout <<" "<< back;
	return 0;
}