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
|
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct Edge {
unsigned b;
unsigned p;
unsigned t;
};
int main() {
unsigned N, M, K;
cin >> N >> M >> K;
vector<vector<Edge>> graph(N, vector<Edge>());
for (unsigned i = 0; i < M; i++) {
unsigned ai, bi, pi, ti;
cin >> ai >> bi >> pi >> ti;
graph[ai-1].push_back({ bi-1, pi, ti });
}
// Dijkstra
priority_queue<pair<long long, long long>, vector<pair<long long, long long>>, less<pair<long long, long long>>> q;
vector<long> dist(N, -1);
dist[0] = 0;
vector<bool> visited(N, false);
q.push({ K, 0 });
while (!q.empty()) {
long long timeleft = q.top().first;
long long node = q.top().second;
q.pop();
visited[node] = true;
for (Edge& ne : graph[node]) {
if (visited[ne.b]) continue;
long long nd = (dist[node] > -1) * dist[node] + ne.p;
if (dist[ne.b] == -1 || nd < dist[ne.b]) {
dist[ne.b] = nd;
q.push({ timeleft - ne.t, ne.b });
}
}
}
cout << dist[N-1];
}
|
