1018 Public Bike Management (30分)

1.求出所有最短路径

2.计算take和send （s, t）

3.结构体耗费空间  最后一个样例会段错误 改成二维数组就ok了

4.注意更新最短距离  该点之前记录的点都要清空

5.在最短距离一样的时候，根据take和send来决定 更新时要注意结果的路径需要clear

ps：改bug改到崩.....

#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include<cstring>
using namespace std;

const int MAXM = 0;
const int MAXV = 500+5;
const int inf = 0x3f3f3f;

typedef struct {
	int a, b, w, next;
} Edge;
vector<int> p;

int C, N, s, M;
Edge edge[MAXM];
int ed[MAXV][MAXV];
int  headlist[MAXV];
int num[MAXV];
vector<int> V[MAXV];
bool vis[MAXV];
int d[MAXV];
void Dij() {
	for(int i=0; i<=N; i++) {
		d[i] = inf;
		vis[i] = 0;
	}
	d[0] = 0;
	for(int k = 0; k <= N; k++) {
		int v = -1, minn = inf;
		for(int j = 0; j <= N; j++) {
			if(!vis[j] && d[j] < minn) {
				v = j;
				minn = d[j];
			}
		}
		if(v == -1) break;
		vis[v] = true;
		for(int i=0; i<=N; i++) {
			if(d[v]+ed[v][i] <= d[i]) {
				if(d[v]+ed[v][i] < d[i]) {
					V[i].clear();
				}
				d[i] = d[v]+ed[v][i];

				V[i].push_back(v);
			}
		}
		/*
			for(int i = headlist[v]; i != -1; i = edge[i].next) {
				if(d[v] + edge[i].w <= d[edge[i].b]) {//需加=不然会遗漏路径
					if(d[v] + edge[i].w < d[edge[i].b])
						V[edge[i].b].clear();
					d[edge[i].b] = d[v] + edge[i].w;		//	cout <<edge[i].a << "---" << edge[i].b << endl;
					V[edge[i].b].push_back(edge[i].a);//逆
				}
			}*/
	}
	
}
void spfa() {
	queue<int> q;

	for(int i = 1; i <= N; i++) {
		d[i] = inf;
		vis[i] = 0;
	}

	d[0] = 0;
	vis[0] = 0;
	q.push(0);

	while(!q.empty()) {
		int v = q.front();
		q.pop();

		vis[v] = 0;
		for(int i = headlist[v]; i != -1; i = edge[i].next) {
			if(d[v] + edge[i].w <= d[edge[i].b]) {//需加=不然会遗漏路径
				if(d[v] + edge[i].w < d[edge[i].b])
					V[edge[i].b].clear();
				d[edge[i].b] = d[v] + edge[i].w;
				if(!vis[edge[i].b]) {
					q.push(edge[i].b);
				}

				V[edge[i].b].push_back(edge[i].a);//逆
				vis[edge[i].b] = 1;
			}
		}
	}
}

void addedge(int a, int b, int c, int i) {
	edge[i].a = a;
	edge[i].b = b;
	edge[i].w = c;
	edge[i].next = headlist[a];
	headlist[a] = i;
}

struct A {
	int s, t;
	vector<int> v;
	A() {
		s = inf, t = inf, v.clear();
	}
} ans;
int se, t;

void dfs(int tmp, int cnt) {
	if(tmp == 0) { //可以有终点到起点
		int i = cnt;
		int t = 0, s = 0;
		//	cout << i << "===";
		for(int j=p.size(); j>0; j--) {
			int tmp = p[j-1];
			//	cout << tmp << " ->";
			if(num[tmp] >= 0) t += num[tmp];//带回
			else {
				t += num[tmp];//用之前站点多的来补
				if(t <= 0) {//不够   则提供
					s -= t;
					t = 0;
				}
			}
		}
		if(s < ans.s || s == ans.s && t < ans.t) {
			ans.t = t;
			ans.s = s;
			ans.v.clear();
			for(int j=p.size()-1; j>=0; j--) {
				ans.v.push_back(p[j]);
			}
		}
		return;
	}
	for(int i=0; i<V[tmp].size(); i++) {
		//cout << tmp<< "==" << V[tmp][i] << " ";
		if(!vis[V[tmp][i]]) {
			vis[V[tmp][i]] = true;
			p.push_back(V[tmp][i]);

			dfs(V[tmp][i], cnt);
			vis[V[tmp][i]] = false;
			p.pop_back();
		}
	}
}

int main() {
//	fill(ed[0], ed[0] + 510 * 510, inf);

	cin >> C >> N >> s >> M;
	for(int i=0; i<=N; i++) {
		for(int j=0; j<=N; j++) {
			ed[i][j] = inf;
		}
	}
	for(int i = 1; i <= N; i++)
		cin >> num[i], num[i]-=C/2;

	for(int i = 0; i <= N; i++)
		headlist[i] = -1;
	for(int i = 1; i <= 2 * M; i += 2) {
		int u, v, w;
		cin >> u >> v >> w;
		ed[u][v] = ed[v][u] = w;
		/*		addedge(u, v, w, i);
				addedge(v, u, w, i+1);*/
	}
	Dij();
	//spfa();
	for(int i = 0; i <= N; i++) {
		vis[i] = false;
	}
	p.push_back(s);
	vis[s] = true;
	for(int i=0; i<V[s].size(); i++) {

		if(!vis[V[s][i]]) {
			p.push_back(V[s][i]);
			vis[V[s][i]] =true;
			dfs(V[s][i], i);
			p.pop_back();
			vis[V[s][i]] = false;
		}

	}
	cout << ans.s << " " << 0;

	for(int i=1; i<ans.v.size(); i++) {
		cout << "->" << ans.v[i];
	}
	cout << " "<< ans.t << endl;
	return 0;
}