#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define getbit(x, i) (((x) >> (i)) & 1)
#define all(x) x.begin(), x.end()
#define TASK ""
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
if (a < b) {a = b; return true;} return false;
}
const long long inf = 1e18;
const int mod = 1e9 + 7;
const int N = 1e5 + 7;
struct Edge {
int v, c, p;
Edge(int v, int c, int p) {
this -> v = v;
this -> c = c;
this -> p = p;
}
};
vector <Edge> adj[N];
long long dist[N], mn[2 * N], sum[2 * N];
int n, m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int u, v, c, p; cin >> u >> v >> c >> p;
adj[u].emplace_back(v, c, p);
adj[v].emplace_back(u, c, p);
}
memset(dist, 0x3f, sizeof dist);
memset(mn, 0x3f, sizeof mn);
priority_queue <pair <long long, int>> heap;
dist[1] = 0;
heap.emplace(0, 1);
while (heap.size()) {
auto [du, u] = heap.top();
heap.pop();
du = -du;
if (du != dist[u]) continue;
for (auto [v, c, p] : adj[u]) {
sum[c] += p;
mini(mn[c], dist[v]);
}
for (auto [v, c, p] : adj[u]) {
if (mini(dist[v], du + min(1LL * p, sum[c] - p)))
heap.emplace(-dist[v], v);
if (mini(dist[v], mn[c] + sum[c] - p))
heap.emplace(-dist[v], v);
}
for (auto [v, c, p] : adj[u]) {
sum[c] = 0;
maxi(mn[c], inf);
}
}
cout << (dist[n] != dist[0] ? dist[n] : -1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
3 ms |
4948 KB |
Output is correct |
4 |
Correct |
4 ms |
4948 KB |
Output is correct |
5 |
Correct |
3 ms |
4976 KB |
Output is correct |
6 |
Correct |
3 ms |
4948 KB |
Output is correct |
7 |
Correct |
3 ms |
5076 KB |
Output is correct |
8 |
Correct |
3 ms |
4992 KB |
Output is correct |
9 |
Correct |
4 ms |
5076 KB |
Output is correct |
10 |
Correct |
4 ms |
5204 KB |
Output is correct |
11 |
Correct |
5 ms |
5076 KB |
Output is correct |
12 |
Correct |
4 ms |
5028 KB |
Output is correct |
13 |
Correct |
4 ms |
5076 KB |
Output is correct |
14 |
Correct |
3 ms |
5076 KB |
Output is correct |
15 |
Correct |
3 ms |
5076 KB |
Output is correct |
16 |
Correct |
4 ms |
5076 KB |
Output is correct |
17 |
Correct |
3 ms |
5076 KB |
Output is correct |
18 |
Correct |
3 ms |
4948 KB |
Output is correct |
19 |
Correct |
4 ms |
5116 KB |
Output is correct |
20 |
Correct |
4 ms |
5076 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
56 ms |
9988 KB |
Output is correct |
2 |
Correct |
23 ms |
7248 KB |
Output is correct |
3 |
Correct |
74 ms |
13288 KB |
Output is correct |
4 |
Correct |
29 ms |
8448 KB |
Output is correct |
5 |
Correct |
123 ms |
19056 KB |
Output is correct |
6 |
Correct |
134 ms |
19108 KB |
Output is correct |
7 |
Correct |
126 ms |
17592 KB |
Output is correct |
8 |
Correct |
139 ms |
17196 KB |
Output is correct |
9 |
Correct |
132 ms |
17104 KB |
Output is correct |
10 |
Correct |
77 ms |
12904 KB |
Output is correct |
11 |
Correct |
50 ms |
10652 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
3 ms |
4948 KB |
Output is correct |
4 |
Correct |
4 ms |
4948 KB |
Output is correct |
5 |
Correct |
3 ms |
4976 KB |
Output is correct |
6 |
Correct |
3 ms |
4948 KB |
Output is correct |
7 |
Correct |
3 ms |
5076 KB |
Output is correct |
8 |
Correct |
3 ms |
4992 KB |
Output is correct |
9 |
Correct |
4 ms |
5076 KB |
Output is correct |
10 |
Correct |
4 ms |
5204 KB |
Output is correct |
11 |
Correct |
5 ms |
5076 KB |
Output is correct |
12 |
Correct |
4 ms |
5028 KB |
Output is correct |
13 |
Correct |
4 ms |
5076 KB |
Output is correct |
14 |
Correct |
3 ms |
5076 KB |
Output is correct |
15 |
Correct |
3 ms |
5076 KB |
Output is correct |
16 |
Correct |
4 ms |
5076 KB |
Output is correct |
17 |
Correct |
3 ms |
5076 KB |
Output is correct |
18 |
Correct |
3 ms |
4948 KB |
Output is correct |
19 |
Correct |
4 ms |
5116 KB |
Output is correct |
20 |
Correct |
4 ms |
5076 KB |
Output is correct |
21 |
Correct |
56 ms |
9988 KB |
Output is correct |
22 |
Correct |
23 ms |
7248 KB |
Output is correct |
23 |
Correct |
74 ms |
13288 KB |
Output is correct |
24 |
Correct |
29 ms |
8448 KB |
Output is correct |
25 |
Correct |
123 ms |
19056 KB |
Output is correct |
26 |
Correct |
134 ms |
19108 KB |
Output is correct |
27 |
Correct |
126 ms |
17592 KB |
Output is correct |
28 |
Correct |
139 ms |
17196 KB |
Output is correct |
29 |
Correct |
132 ms |
17104 KB |
Output is correct |
30 |
Correct |
77 ms |
12904 KB |
Output is correct |
31 |
Correct |
50 ms |
10652 KB |
Output is correct |
32 |
Correct |
64 ms |
14208 KB |
Output is correct |
33 |
Correct |
68 ms |
13016 KB |
Output is correct |
34 |
Correct |
102 ms |
15536 KB |
Output is correct |
35 |
Correct |
76 ms |
13820 KB |
Output is correct |
36 |
Correct |
147 ms |
12804 KB |
Output is correct |
37 |
Correct |
117 ms |
14892 KB |
Output is correct |
38 |
Correct |
107 ms |
17236 KB |
Output is correct |
39 |
Correct |
92 ms |
16844 KB |
Output is correct |
40 |
Correct |
178 ms |
18576 KB |
Output is correct |
41 |
Correct |
156 ms |
18648 KB |
Output is correct |
42 |
Correct |
141 ms |
18052 KB |
Output is correct |
43 |
Correct |
56 ms |
11928 KB |
Output is correct |
44 |
Correct |
111 ms |
18512 KB |
Output is correct |
45 |
Correct |
131 ms |
14984 KB |
Output is correct |
46 |
Correct |
103 ms |
14344 KB |
Output is correct |
47 |
Correct |
127 ms |
15232 KB |
Output is correct |
48 |
Correct |
157 ms |
20284 KB |
Output is correct |