poj 1724 ROADS

spfa算法的基本应用

#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
struct edge
{
	int rp,value,cost,next;

}ee[40000];
int first[40000];
struct note
{
    int rp,len,cost;
    bool operator < (const note &tmp) const
	{
		if(len==tmp.len)
			return cost>tmp.cost;
		return len>tmp.len;
	}
}p1,p2;
int n,k,r,e;
void add(int x,int y,int c,int d)
{
	ee[e].rp=y;
	ee[e].value=c;
	ee[e].cost=d;
	ee[e].next=first[x];
	first[x]=e++;
}
void spfa()
{
	priority_queue<note> q;
	p1.rp=1;
	p1.len=0;
	p1.cost=0;
	q.push(p1);
	while(!q.empty())
	{

		p2=q.top();
		q.pop();
		if(p2.rp==n)
		{
			printf("%d\n",p2.len);
			return ;
		}
		for(int i=first[p2.rp];i!=-1;i=ee[i].next)
		{
		    //printf("heh");
			int y=ee[i].rp;
			if(p2.cost+ee[i].cost<=k)
			{
				p1.cost=p2.cost+ee[i].cost;
				p1.len=p2.len+ee[i].value;
				p1.rp=y;
				q.push(p1);
			}
		}

	}
	printf("-1\n");
	return ;
}
int main()
{
    //freopen("in.txt","r",stdin);
	while(scanf("%d%d%d",&k,&n,&r)!=EOF)
	{
	    e=0;
		int a,b,c,d;
		memset(first,-1,sizeof(first));
		//memset(head,-1,sizeof(head));
		for(int i=0;i<r;i++)
		{
			//e=1;
			scanf("%d%d%d%d",&a,&b,&c,&d);
			add(a,b,c,d);
		}
		spfa();
	}
}