1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<P, int> PI;
struct edge {
int from,to;
int cost, res;
edge(int t,int c) : to(t),cost(c) {}
edge(int t,int c,int r) : to(t), cost(c), res(r) {}
bool operator<(const edge &e) const {
return cost < e.cost;
}
};
vector<edge> G[105];
int d[105][105];
void dijkstra(int s, int l) {
rep(i, 105) rep(j, 105) d[i][j] = INF;
d[s][l] = 0;
priority_queue<PI, vector<PI>, greater<PI> > que;
que.push(mp(mp(0, -l), s));
while(que.size()) {
PI p = que.top(); que.pop();
int cost = p.first.first;
int coin = p.first.second;
int v = p.second;
coin *= -1;
if(d[v][coin] < cost) continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if(d[e.to][coin] > d[v][coin] + e.res) {
d[e.to][coin] = d[v][coin] + e.res;
que.push(mp(mp(d[e.to][coin], -coin), e.to));
}
int nc = coin - e.cost;
if(nc >= 0 && d[e.to][nc] > d[v][coin]) {
d[e.to][nc] = d[v][coin];
que.push(mp(mp(d[e.to][nc], -nc), e.to));
}
}
}
}
int main() {
int n, m, l;
while(cin >> n >> m >> l) {
if(n == 0 && m == 0 && l == 0) break;
rep(i, 105) G[i].clear();
rep(i, m) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--; b--;
G[a].push_back(edge(b, c, d));
G[b].push_back(edge(a, c, d));
}
dijkstra(0, l);
int ans = INF;
rep(i, l+1) {
ans = min(ans, d[n-1][i]);
}
cout << ans << endl;
}
return 0;
}
|