uva12661 最短路

很奇怪为什么刚开始写的那个是错的。。

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<iostream>
#include<string>
#include<set>
#include<sstream>
#include<queue>
#define bug1 cout<<"bug1"<<endl;
using namespace std;
#define inf 0x3f3f3f3f
#define sf scanf
#define pf printf
const int maxn=305;
const int maxm=50005;
const int INF=1e9;

int n,m,s,t;
int tol;
int head[maxn];
struct Edge{
    int u,v,nxt,a,b,t;
}edge[maxm];
int dist[maxn];

struct Node{
    int t,id;
};

void addedge(int u,int v,int a,int b ,int t){
    edge[tol].u=u;edge[tol].v=v;edge[tol].a=a;edge[tol].b=b;
    edge[tol].t=t;
    edge[tol].nxt=head[u];
    head[u]=tol++;
}
int vis[maxn];
void spfa(int *d){
    for(int i=1;i<=n;++i){
        d[i]=INF;vis[i]=0;
    }
    d[s]=0;
    vis[s]=1;
    queue<Node>q;
    Node ss;ss.id=s;ss.t=0;
    q.push(ss);
    while(!q.empty()){
        Node x=q.front();q.pop();
        int u=x.id;
        int t=x.t;
        vis[u]=0;
        for(int i=head[u];~i;i=edge[i].nxt){
            int v=edge[i].v;
            if(edge[i].a<edge[i].t)continue;
            int val=d[u];
            int ss=d[u];
            val=val%(edge[i].a+edge[i].b);
            if(val>edge[i].a){
                ss+=edge[i].a+edge[i].b-val;
            }
            else if(edge[i].a-val<edge[i].t)
                ss+=edge[i].b+edge[i].a-val;
            if(ss+edge[i].t<d[v]){
                d[v]=ss+edge[i].t;
                if(!vis[v]){vis[v]=1;
                    Node nv;nv.id=v;nv.t=d[v];
                    q.push(nv);
                }
            }

            /*
            if(remain+edge[i].t<=edge[i].a){
                if(d[v]>d[u]+edge[i].t){
                    d[v]=d[u]+edge[i].t;
                    if(!vis[v]){vis[v]=1;
                        Node nv;nv.id=v;nv.t=d[v];
                        q.push(nv);
                    }
                }
            }
            else{
                if(d[v]>d[u]+edge[i].a+edge[i].b-remain+edge[i].t){
                    d[v]=d[u]+edge[i].a+edge[i].b-remain+edge[i].t;
                    if(!vis[v]){vis[v]=1;
                        Node nv;nv.id=v;nv.t=d[v];
                        q.push(nv);
                    }
                }
            }
            */
        }
    }
}
int main(){
    int cas=0;
    while(~sf("%d%d%d%d",&n,&m,&s,&t)){
        for(int i=1;i<=n;++i){
            head[i]=-1;
        }
        tol=0;
        for(int i=1;i<=m;++i){
            int u,v,a,b,t;
            sf("%d%d%d%d%d",&u,&v,&a,&b,&t);
            addedge(u,v,a,b,t);
        }
        spfa(dist);
        pf("Case %d: %d\n",++cas,dist[t]);
    }
}

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<iostream>
#include<string>
#include<set>
#include<sstream>
#include<queue>
#define bug1 cout<<"bug1"<<endl;
using namespace std;
#define inf 0x3f3f3f3f
#define sf scanf
#define pf printf
const int maxn=305;
const int maxm=50005;
const int INF=1e9;

int n,m,s,t;
int tol;
int head[maxn];
struct Edge{
    int u,v,nxt,a,b,t;
}edge[maxm];
int dist[maxn];

struct Node{
    int t,id;
};

void addedge(int u,int v,int a,int b ,int t){
    edge[tol].u=u;edge[tol].v=v;edge[tol].a=a;edge[tol].b=b;
    edge[tol].t=t;
    edge[tol].nxt=head[u];
    head[u]=tol++;
}
int vis[maxn];
void spfa(int *d){

    for(int i=1;i<=n;++i){
        d[i]=INF;vis[i]=0;
    }
    d[s]=0;
    vis[s]=1;
    queue<Node>q;
    Node ss;ss.id=s;ss.t=0;
    q.push(ss);
    while(!q.empty()){
        Node x=q.front();q.pop();
        int u=x.id;
        int t=x.t;
        vis[u]=0;
        for(int i=head[u];~i;i=edge[i].nxt){
            int v=edge[i].v;
            int remain=t%(edge[i].a+edge[i].b);
            if(edge[i].a<edge[i].t)continue;
            if(remain+edge[i].t<=edge[i].a){
                if(d[v]>d[u]+edge[i].t){
                    d[v]=d[u]+edge[i].t;
                    if(!vis[v]){vis[v]=1;
                        Node nv;nv.id=v;nv.t=d[v];
                        q.push(nv);
                    }
                }
            }
            else{
                if(d[v]>d[u]+edge[i].a+edge[i].b-remain+edge[i].t){
                    d[v]=d[u]+edge[i].a+edge[i].b-remain+edge[i].t;
                    if(!vis[v]){vis[v]=1;
                        Node nv;nv.id=v;nv.t=d[v];
                        q.push(nv);
                    }
                }
            }
        }
    }
}




int main(){
    int cas=0;
    while(~sf("%d%d%d%d",&n,&m,&s,&t)){
        for(int i=1;i<=n;++i){
            head[i]=-1;
        }
        tol=0;
        for(int i=1;i<=m;++i){
            int u,v,a,b,t;
            sf("%d%d%d%d%d",&u,&v,&a,&b,&t);
            addedge(u,v,a,b,t);
        }
        spfa(dist);
        pf("Case %d: %d\n",++cas,dist[t]);
    }
}