A1018共享单车

1.A1018

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<cctype>
#include<string>
#include<set>
#include<vector>
#include<unordered_map>
using namespace std;
const int inf = 100000000;
const int maxn = 520;
struct node {
	int v, dis;
};
int cmax, n, sp, m, minneed = inf, minremain = inf;
vector<int> pre[maxn], temp, path;
vector<node> g[maxn];
int d[maxn],weight[maxn];
bool vis[maxn] = { false };
void dijkstra(int s) {
	fill(d, d + maxn, inf);
	memset(vis, false, sizeof(vis));
	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] == false && d[j] < Min) {
				u = j; Min = d[j];
			}
		}
		if (u == -1)return;
		vis[u] = true;
		for (int j = 0; j < g[u].size(); ++j) {
			int v = g[u][j].v;
			if (vis[v] == false) {
				if (d[v] > d[u] + g[u][j].dis) {
					pre[v].clear();
					pre[v].push_back(u);
					d[v] = d[u] + g[u][j].dis;
				}
				else if (d[v] == d[u] + g[u][j].dis) pre[v].push_back(u);
			}
		}
	}
}
void dfs(int s) {
	if (s == 0) {
		temp.push_back(s);
		int need = 0, remain = 0;//num点权和
		for (int i = temp.size()-1; i >= 0 ; --i) {//必须从PBCM开始比较
			//num += weight[temp[i]];//不能一起加因为可能前面的车站缺少车但总的车数不缺
			int id = temp[i];
			if (weight[id] > 0) remain += weight[id];
			else {
				if (remain > abs(weight[id])) remain -= abs(weight[id]);
				else  need += abs(weight[id]) - remain, remain = 0;
			}
		}
		
		if (minneed > need) {
			path = temp;
			minneed = need;
			minremain = remain;
		}
		else if (minneed == need) {
			if (minremain > remain) {
				minremain = remain;
				path = temp;
			}
		}
		temp.pop_back();
		return;
	}
	temp.push_back(s);
	for (int i = 0; i < pre[s].size(); ++i) {
		dfs(pre[s][i]);
	}
	temp.pop_back();
}
int main() {
	scanf("%d %d %d %d", &cmax, &n, &sp, &m);
	weight[0] = 0;
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &weight[i]);
		weight[i] -= cmax / 2;
		
	}
	for (int i = 0; i < m; ++i) {
		int u,v; node temp;
		scanf("%d %d %d", &u, &v, &temp.dis);
		temp.v = v;
		g[u].push_back(temp);
		temp.v = u;
		g[v].push_back(temp);
	}
	dijkstra(0);
	dfs(sp);
	printf("%d ", minneed);
	for (int i = path.size() - 1; i>=0 ; --i) {
		if (i != path.size() - 1) printf("->");
		printf("%d", path[i]);
	}
	printf(" %d", minremain);
	
	return 0;
}