CSU1232懒汉的旅行

 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <sstream>
#include <algorithm> 
//#include <map>
#include <set>
#include <cmath>
#include <bitset>
#define INF 0x3f3f3f3f
using namespace std;
struct edge{
    int v;int len;
};
struct status{
    int step,cost,u,oil;
    bool operator < (const status &b) const
    {
        if(step != b.step) return step > b.step;
        else if(cost != b.cost) return cost > b.cost;
        else if(oil != b.oil) return oil < b.oil;
    }
}mark[105];
vector<edge> vec[105];
int N,M,L,Y;
int start,finish;
int bfs()
{
    priority_queue<status> q;
    q.push((status){0,0,start,L}) ;
    while(!q.empty())
    {
        status now = q.top();
        q.pop();
 
        bool f = false;
        if(now.cost<mark[now.u].cost) f = true,mark[now.u]=now;
        if(now.step<mark[now.u].step) f = true, mark[now.u]=now;
        if(now.oil>mark[now.u].oil) f = true, mark[now.u]=now;
        if(!f)continue;
 
        if(now.u == finish)
            return now.cost;
 
        for(auto &Next : vec[now.u])
        {
            status tmp = now;
            tmp.u = Next.v;
            if(Next.len > L)
                continue;
            if(tmp.oil >= Next.len)
                q.push((status){now.step,now.cost,Next.v,now.oil-Next.len});
            q.push((status){now.step+1,now.cost+Y*(L-now.oil),Next.v,L-Next.len});
        }
    }
    return -1;
}
int main()
{
    while(scanf("%d%d%d%d",&N,&M,&L,&Y) != EOF)
    {
        for(int i = 0 ; i <= N ; i++)
            mark[i]=(status){INF,INF,i,-1},vec[i].clear();
        scanf("%d%d",&start,&finish);
        for(int i = 0 ; i < M ; i++)
        {
            int u,v,l;
            scanf("%d%d%d",&u,&v,&l);
            vec[u].push_back((edge){v,l});
            vec[v].push_back((edge){u,l});
        }
        printf("%d\n",bfs());
    }
    return 0;
}