丛林探险

vijos P1082

#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#include <iostream>
#include "algorithm"
using namespace std;
typedef long long LL;
const int MAX1=5005;
const int MAX2=80005;
int n,m;
int tot;
int head[MAX1],adj[MAX2],next[MAX2],len[MAX2],str[MAX2];
int dist[MAX1];
int cost[MAX1];
int s,t,k;
void addedge(int u,int v,int c,int d){
    tot++;
    adj[tot]=v;
    next[tot]=head[u];
    str[tot]=c;
    len[tot]=d;
    head[u]=tot;
}
void init(){
    int i,j;
    int u,v,c,d;
    scanf("%d%d",&n,&m);
    memset(head,0,sizeof(head));
    memset(next,0,sizeof(next));
    for (i=1;i<=m;i++)
    {scanf("%d%d%d%d",&u,&v,&c,&d);
     addedge(u,v,c,d);
     addedge(v,u,c,d);
    }
    scanf("%d%d%d",&s,&t,&k);
}
bool SPFA(int mid){
    int i,j;
    queue <int> q;
    bool flag[MAX1];
    memset(dist,0x3f,sizeof(dist));
    memset(cost,0,sizeof(cost));
    memset(flag,false,sizeof(flag));
    q.push(s);
    flag[s]=true;
    dist[s]=0;
    while (!q.empty())
    {int u;
     u=q.front();
     q.pop();
     flag[u]=true;
     for (i=head[u];i;i=next[i])
      if (cost[u]+str[i]<=k && dist[u]+len[i]<dist[adj[i]])
      {cost[adj[i]]=cost[u]+str[i];
       dist[adj[i]]=dist[u]+len[i];
       if (flag[adj[i]]==false)
       {flag[adj[i]]=true;
        q.push(adj[i]);
       }
      }
    }
    return (dist[t]<=mid);
}
int main(){
    freopen ("explor.in","r",stdin);
    freopen ("explor.out","w",stdout);
    init();int i,j;
    int low,high,mid;
    int ans;
    low=0;high=1000000000;
    ans=-1;
    while (low<=high)
    {mid=(low+high)/2;
     if (SPFA(mid))
     {ans=dist[t];
      high=mid-1;
     }
     else low=mid+1;
    }
    printf("%d",ans);
    return 0;
}