poj 1158 TRAFFIC LIGHTS spfa求最短路

 

//poj 1158
//sep9
#include <iostream>
#include <queue>
using namespace std;
const int maxN=312;
const int maxM=30012;
struct Edge
{
	int v,w,nxt;
}edge[maxM];
int S,T,n,m,e;
int rc[maxN],tb[maxN],tp[maxN],d[maxN],head[maxN];
int inq[maxN];
queue<int> Q;

int change(int ini_t,int u,int &r)
{
	int tot=tb[u]+tp[u];
	if((rc[u]+ini_t)%tot<tb[u]){
		r=tb[u]-(rc[u]+ini_t)%tot;
		return 0;
	}else{
		r=tot-(rc[u]+ini_t)%tot;
		return 1;
	}
}

int wait_time(int ini_t,int u,int v)
{
	int c1,c2,r1,r2;
	c1=change(ini_t,u,r1);
	c2=change(ini_t,v,r2);
	if(c1==c2) return 0;
	if(r1!=r2) return min(r1,r2);
	if(c1==0){
		if(tp[u]<tb[v]) return r1+tp[u];
		if(tp[u]>tb[v]) return r1+tb[v];
		return -1;
	}else{
		if(tb[u]<tp[v]) return r1+tb[u];
		if(tb[u]>tp[v]) return r1+tp[v];
		return -1;
	}
}

void spfa()
{
	memset(d,0x7f,sizeof(d));			
	memset(inq,0,sizeof(inq));
	d[S]=0;
	Q.push(S);
	inq[S]=1;
	while(!Q.empty()){
		int u=Q.front();Q.pop();
		inq[u]=0;
		for(int i=head[u];i!=-1;i=edge[i].nxt){
			int v=edge[i].v;
			int t=wait_time(d[u],u,v);
			if(t!=-1&&d[v]>d[u]+t+edge[i].w){
				d[v]=d[u]+t+edge[i].w;
				if(!inq[v]){
					Q.push(v);
					inq[v]=1;
				}
			}
		}
	}
}

int main()
{
	scanf("%d%d%d%d",&S,&T,&n,&m);
	for(int i=1;i<=n;++i){
		char ch[8];
		scanf("%s%d%d%d\n",ch,&rc[i],&tb[i],&tp[i]);
		if(ch[0]=='B')
			rc[i]=tb[i]-rc[i];
		else
			rc[i]=tb[i]+tp[i]-rc[i];
	}
	e=0;
	memset(head,-1,sizeof(head));
	while(m--){
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		edge[e].v=v,edge[e].w=w,edge[e].nxt=head[u],head[u]=e++;
		edge[e].v=u,edge[e].w=w,edge[e].nxt=head[v],head[v]=e++;
	}	
	spfa();
	printf("%d",d[T]==d[0]?0:d[T]);
	return 0;	
}