POJ 1724 ROADS单源最短路

题目链接：http://poj.org/problem?id=1724

求单源最短路，构建一个先贪心路径，在贪心钱的优先队列，每次取出距离源点最近，并且剩钱最多的点开始搜索，最先找到终点的路径一定是最短路径。

参考代码：

#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>
#include<cmath>
using namespace std;

#define MAX 105
#define CLR(arr,v) memset(arr,v,sizeof(arr))

struct nodes
{
	int v,d,mon;
	bool operator<(const nodes &a) const
	{
		if(d != a.d) return d > a.d;
		else return mon < a.mon;
	}
}mid;

int dis[MAX],h[MAX],nex[MAX*MAX],val[MAX*MAX],des[MAX*MAX],len[MAX*MAX],pos;
priority_queue<nodes> q;

void init()
{
	CLR(h,0);  pos = 0;
	CLR(val,0);CLR(nex,0);
	CLR(len,0);CLR(des,0);
	fill(dis,dis+MAX,INT_MAX/2);
	while(!q.empty()) q.pop();
}

void add(int u,int v,int length,int mon)
{
	des[++pos] = v;
	val[pos] = mon;
	len[pos] = length;
	nex[pos] = h[u];
	h[u] = pos;
}

int SPFA(int n,int k)
{
	dis[1] = 0;
	mid.d = 0;
	mid.mon = k;
	mid.v = 1;
	q.push(mid);
	struct nodes p;
	while(!q.empty())
	{
		p = q.top();
		q.pop();
		int u = p.v,mon = p.mon,d = p.d;
		if(u == n) return d;
		for(int j = h[u]; j ;j = nex[j])
		{
			if(mon >= val[j])
			{
				mid.d = d + len[j];
				mid.v = des[j];
				mid.mon = mon - val[j];
				q.push(mid);
			}
		}
	}
	return -1;
}

int main()
{
	int m,n,k;
	while(~scanf("%d%d%d",&k,&n,&m))
	{
		init();
		int u,v,l,t;
		for(int i = 0;i < m;++i)
		{
			scanf("%d%d%d%d",&u,&v,&l,&t);
			add(u,v,l,t);
		}
		printf("%d\n",SPFA(n,k));
	}
	return 0;
}