1018. Public Bike Management (30)

1018. Public Bike Management (30)

#include <iostream>
#include <vector>
#include <algorithm>
#include <list>
#include <numeric>
using namespace std;
class A
{
public:
	enum{N=501,INF=0x7FFFFFFF/2};
	void init();
	void run();
	void dijkstra();
	void findbestpath(int v);
	int c,n,s,m,ar[N][N],bikes[N],minsend,mincollect;
	vector<int> possiblePath,bestPath,path[N];
};

void A::findbestpath(int v)
{
	int i;
	possiblePath.push_back(v);
	if(v==0)
	{
		int send=0,collect=0;
		for(i=possiblePath.size()-1;i>=0;i--)
		{
			collect+=bikes[possiblePath[i]]-c/2;
			if(collect<0) {send-=collect;collect=0;}
		}
		if(send<minsend){minsend=send;mincollect=collect;bestPath=possiblePath;}
		else if(send==minsend&&collect<mincollect) {mincollect=collect;bestPath=possiblePath;}
		return;
	}
	for(i=0;i<path[v].size();i++)
	{
		findbestpath(path[v][i]);
		possiblePath.pop_back();
	}
}
void A::dijkstra()
{
	int i,k,dist[N];
	bool visited[N];
	fill_n(visited,n+1,false);
	copy(ar[0],ar[0]+n+1,dist);
	dist[0]=0;
	while(1)
	{
		k=-1;
		for(i=0;i<=n;i++)
		{
			if(visited[i]) continue;
			if(k==-1||dist[k]>dist[i]) k=i;
		}
		if(k==-1) return;
		visited[k]=true;
		for(i=0;i<=n;i++)
		{
			if(visited[i]) continue;
			if(dist[i]>dist[k]+ar[k][i])
			{
				dist[i]=dist[k]+ar[k][i];
				path[i].clear();
				path[i].push_back(k);
			}
			else if(dist[i]==dist[k]+ar[k][i])
			{
				path[i].push_back(k);
			}
		}
	}
}
void A::init()
{
	minsend=INF;
	mincollect=INF;
	int i;
	cin>>c>>n>>s>>m;
	bikes[0]=c/2;
	for(i=1;i<=n;i++) cin>>bikes[i];
	for(i=0;i<=n;i++) fill_n(ar[i],n+1,INF);
	for(i=0;i<m;i++) 
	{
		int r1,r2,d;
		cin>>r1>>r2>>d;
		ar[r1][r2]=d;
		ar[r2][r1]=d;
	}
}


void A::run()
{
	init();
	dijkstra();
	findbestpath(s);
	cout<<minsend<<" "<<0;
	int i;
	for(i=bestPath.size()-2;i>=0;i--) cout<<"->"<<bestPath[i];
	cout<<" "<<mincollect;
}


int main()
{
//	freopen("test.in","r",stdin);
	A *a=new A;
	a->run();
	return 0;
}