#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll INF = 1e18;
struct Edge {
int to, c;
ll p;
};
map<int, vector<Edge>> graph[100001];
ll dp[100001];
map<int, ll> dp2[100001], psum[100001];
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v, c;
ll p;
cin >> u >> v >> c >> p;
graph[u][c].push_back({v, c, p});
graph[v][c].push_back({u, c, p});
psum[u][c] += p;
psum[v][c] += p;
}
memset(dp, 0x3f, sizeof dp);
dp[1] = 0;
priority_queue<tuple<ll, int, int>> pq;
pq.push({0, 1, 0});
while (pq.size()) {
ll cost;
int node, c;
tie(cost, node, c) = pq.top();
pq.pop();
if (c) {
if (dp2[node][c] != -cost) continue;
for (Edge i : graph[node][c]) {
// We can't flip i in this case
ll case1 = psum[node][c] - i.p;
if (case1 - cost < dp[i.to]) {
dp[i.to] = case1 - cost;
pq.push({-dp[i.to], i.to, 0});
}
}
} else {
if (dp[node] != -cost) continue;
for (auto& i : graph[node]) {
for (Edge j : i.second) {
// Case 1: We don't flip j
ll case1 = psum[node][j.c] - j.p - cost;
if (case1 < dp[j.to]) {
dp[j.to] = case1;
pq.push({-dp[j.to], j.to, 0});
}
// Case 2: We flip j but not another edge of the same colour
ll case2 = j.p - cost;
if (case2 < dp[j.to]) {
dp[j.to] = case2;
pq.push({-dp[j.to], j.to, 0});
}
// Case 3: We flip j and another edge of the same colour
ll case3 = -cost;
if (!dp2[j.to].count(j.c) || case3 < dp2[j.to][j.c]) {
dp2[j.to][j.c] = case3;
pq.push({-dp2[j.to][j.c], j.to, j.c});
}
}
}
}
}
cout << (dp[n] > INF ? -1 : dp[n]);
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
15188 KB |
Output is correct |
| 2 |
Correct |
7 ms |
15156 KB |
Output is correct |
| 3 |
Correct |
8 ms |
15188 KB |
Output is correct |
| 4 |
Correct |
7 ms |
15192 KB |
Output is correct |
| 5 |
Correct |
8 ms |
15188 KB |
Output is correct |
| 6 |
Correct |
7 ms |
15188 KB |
Output is correct |
| 7 |
Correct |
9 ms |
15324 KB |
Output is correct |
| 8 |
Correct |
9 ms |
15232 KB |
Output is correct |
| 9 |
Correct |
11 ms |
15828 KB |
Output is correct |
| 10 |
Correct |
11 ms |
15744 KB |
Output is correct |
| 11 |
Correct |
9 ms |
15444 KB |
Output is correct |
| 12 |
Correct |
10 ms |
15524 KB |
Output is correct |
| 13 |
Correct |
8 ms |
15444 KB |
Output is correct |
| 14 |
Correct |
8 ms |
15444 KB |
Output is correct |
| 15 |
Correct |
9 ms |
15444 KB |
Output is correct |
| 16 |
Correct |
10 ms |
15416 KB |
Output is correct |
| 17 |
Correct |
8 ms |
15488 KB |
Output is correct |
| 18 |
Correct |
8 ms |
15316 KB |
Output is correct |
| 19 |
Correct |
9 ms |
15364 KB |
Output is correct |
| 20 |
Correct |
8 ms |
15484 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
187 ms |
33648 KB |
Output is correct |
| 2 |
Correct |
90 ms |
24644 KB |
Output is correct |
| 3 |
Correct |
168 ms |
29692 KB |
Output is correct |
| 4 |
Correct |
98 ms |
27328 KB |
Output is correct |
| 5 |
Correct |
818 ms |
78748 KB |
Output is correct |
| 6 |
Correct |
632 ms |
71964 KB |
Output is correct |
| 7 |
Correct |
287 ms |
56264 KB |
Output is correct |
| 8 |
Correct |
362 ms |
50912 KB |
Output is correct |
| 9 |
Correct |
369 ms |
50824 KB |
Output is correct |
| 10 |
Correct |
286 ms |
48276 KB |
Output is correct |
| 11 |
Correct |
115 ms |
32716 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
15188 KB |
Output is correct |
| 2 |
Correct |
7 ms |
15156 KB |
Output is correct |
| 3 |
Correct |
8 ms |
15188 KB |
Output is correct |
| 4 |
Correct |
7 ms |
15192 KB |
Output is correct |
| 5 |
Correct |
8 ms |
15188 KB |
Output is correct |
| 6 |
Correct |
7 ms |
15188 KB |
Output is correct |
| 7 |
Correct |
9 ms |
15324 KB |
Output is correct |
| 8 |
Correct |
9 ms |
15232 KB |
Output is correct |
| 9 |
Correct |
11 ms |
15828 KB |
Output is correct |
| 10 |
Correct |
11 ms |
15744 KB |
Output is correct |
| 11 |
Correct |
9 ms |
15444 KB |
Output is correct |
| 12 |
Correct |
10 ms |
15524 KB |
Output is correct |
| 13 |
Correct |
8 ms |
15444 KB |
Output is correct |
| 14 |
Correct |
8 ms |
15444 KB |
Output is correct |
| 15 |
Correct |
9 ms |
15444 KB |
Output is correct |
| 16 |
Correct |
10 ms |
15416 KB |
Output is correct |
| 17 |
Correct |
8 ms |
15488 KB |
Output is correct |
| 18 |
Correct |
8 ms |
15316 KB |
Output is correct |
| 19 |
Correct |
9 ms |
15364 KB |
Output is correct |
| 20 |
Correct |
8 ms |
15484 KB |
Output is correct |
| 21 |
Correct |
187 ms |
33648 KB |
Output is correct |
| 22 |
Correct |
90 ms |
24644 KB |
Output is correct |
| 23 |
Correct |
168 ms |
29692 KB |
Output is correct |
| 24 |
Correct |
98 ms |
27328 KB |
Output is correct |
| 25 |
Correct |
818 ms |
78748 KB |
Output is correct |
| 26 |
Correct |
632 ms |
71964 KB |
Output is correct |
| 27 |
Correct |
287 ms |
56264 KB |
Output is correct |
| 28 |
Correct |
362 ms |
50912 KB |
Output is correct |
| 29 |
Correct |
369 ms |
50824 KB |
Output is correct |
| 30 |
Correct |
286 ms |
48276 KB |
Output is correct |
| 31 |
Correct |
115 ms |
32716 KB |
Output is correct |
| 32 |
Correct |
112 ms |
29144 KB |
Output is correct |
| 33 |
Correct |
131 ms |
29864 KB |
Output is correct |
| 34 |
Correct |
370 ms |
50616 KB |
Output is correct |
| 35 |
Correct |
270 ms |
41844 KB |
Output is correct |
| 36 |
Correct |
270 ms |
46896 KB |
Output is correct |
| 37 |
Correct |
311 ms |
49128 KB |
Output is correct |
| 38 |
Correct |
289 ms |
55596 KB |
Output is correct |
| 39 |
Correct |
120 ms |
32448 KB |
Output is correct |
| 40 |
Correct |
370 ms |
52116 KB |
Output is correct |
| 41 |
Correct |
407 ms |
52448 KB |
Output is correct |
| 42 |
Correct |
415 ms |
60732 KB |
Output is correct |
| 43 |
Correct |
194 ms |
37432 KB |
Output is correct |
| 44 |
Correct |
418 ms |
43332 KB |
Output is correct |
| 45 |
Correct |
276 ms |
47564 KB |
Output is correct |
| 46 |
Correct |
235 ms |
47772 KB |
Output is correct |
| 47 |
Correct |
282 ms |
49116 KB |
Output is correct |
| 48 |
Correct |
854 ms |
84300 KB |
Output is correct |
