#include <bits/stdc++.h>
#define x first
#define y second
using ll = long long;
using namespace std;
struct triple {
int x, y;
ll z;
};
struct four {
int x, y;
ll z, t;
};
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 0; i < 1ll * n * n; ++i) {
ans *= 1032423;
ans++;
}
vector<vector<four>> g(n);
vector<vector<triple>> g1(n);
for (int i = 0; i < m; i++) {
int u, v, c;
ll p;
cin >> u >> v >> c >> p; u--; v--; c--;
g1[u].push_back({v, c, p});
g1[v].push_back({u, c, p});
}
vector<int> cnt(m, 0);
vector<ll> sum(m, 0);
for (int i = 0; i < n; i++) {
for (auto [u, c, p] : g1[i]) {
cnt[c]++;
sum[c] += p;
}
for (auto [u, c, p] : g1[i]) {
if (cnt[c] > 1) {
g[i].push_back({u, c, p, sum[c] - p});
} else {
g[i].push_back({u, c, p, 0});
}
}
for (auto [u, c, p] : g1[i]) {
cnt[c]--;
sum[c] -= p;
}
}
set<pair<ll, int>> st;
vector<ll> dist(n, INT64_MAX / 2), dist2(m, INT64_MAX / 2);
vector<int> used(n, 0);
dist[0] = 0;
for (int i = 0; i < n; i++) {
st.emplace(dist[i], i);
}
while (!st.empty()) {
auto [d, s] = *st.begin();
st.erase(st.begin());
for (auto [i, c, p, w] : g[s]) {
if (used[i]) {
dist2[c] = min(dist[i], dist2[c]);
}
}
used[s] = 1;
for (auto [i, c, p, w] : g[s]) {
if (!used[i]) {
st.erase({dist[i], i});
dist[i] = min(dist[i], min({d + w, dist2[c] + w, d + p}));
st.emplace(dist[i], i);
}
}
for (auto [i, c, p, w] : g[s]) {
if (used[i]) {
dist2[c] = INT64_MAX / 2;
}
}
}
if (dist[n - 1] == INT64_MAX / 2) {
cout << "-1\n";
} else {
cout << dist[n - 1] << "\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
2 ms |
856 KB |
Output is correct |
10 |
Correct |
2 ms |
604 KB |
Output is correct |
11 |
Correct |
3 ms |
604 KB |
Output is correct |
12 |
Correct |
2 ms |
604 KB |
Output is correct |
13 |
Correct |
2 ms |
600 KB |
Output is correct |
14 |
Correct |
2 ms |
600 KB |
Output is correct |
15 |
Correct |
2 ms |
604 KB |
Output is correct |
16 |
Correct |
3 ms |
604 KB |
Output is correct |
17 |
Correct |
2 ms |
604 KB |
Output is correct |
18 |
Correct |
1 ms |
604 KB |
Output is correct |
19 |
Correct |
2 ms |
604 KB |
Output is correct |
20 |
Correct |
2 ms |
856 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
110 ms |
14168 KB |
Output is correct |
2 |
Correct |
51 ms |
6784 KB |
Output is correct |
3 |
Correct |
172 ms |
20688 KB |
Output is correct |
4 |
Correct |
74 ms |
10404 KB |
Output is correct |
5 |
Correct |
272 ms |
35616 KB |
Output is correct |
6 |
Correct |
285 ms |
36752 KB |
Output is correct |
7 |
Correct |
286 ms |
35744 KB |
Output is correct |
8 |
Correct |
339 ms |
40020 KB |
Output is correct |
9 |
Correct |
348 ms |
39924 KB |
Output is correct |
10 |
Correct |
205 ms |
22996 KB |
Output is correct |
11 |
Correct |
159 ms |
23504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
2 ms |
856 KB |
Output is correct |
10 |
Correct |
2 ms |
604 KB |
Output is correct |
11 |
Correct |
3 ms |
604 KB |
Output is correct |
12 |
Correct |
2 ms |
604 KB |
Output is correct |
13 |
Correct |
2 ms |
600 KB |
Output is correct |
14 |
Correct |
2 ms |
600 KB |
Output is correct |
15 |
Correct |
2 ms |
604 KB |
Output is correct |
16 |
Correct |
3 ms |
604 KB |
Output is correct |
17 |
Correct |
2 ms |
604 KB |
Output is correct |
18 |
Correct |
1 ms |
604 KB |
Output is correct |
19 |
Correct |
2 ms |
604 KB |
Output is correct |
20 |
Correct |
2 ms |
856 KB |
Output is correct |
21 |
Correct |
110 ms |
14168 KB |
Output is correct |
22 |
Correct |
51 ms |
6784 KB |
Output is correct |
23 |
Correct |
172 ms |
20688 KB |
Output is correct |
24 |
Correct |
74 ms |
10404 KB |
Output is correct |
25 |
Correct |
272 ms |
35616 KB |
Output is correct |
26 |
Correct |
285 ms |
36752 KB |
Output is correct |
27 |
Correct |
286 ms |
35744 KB |
Output is correct |
28 |
Correct |
339 ms |
40020 KB |
Output is correct |
29 |
Correct |
348 ms |
39924 KB |
Output is correct |
30 |
Correct |
205 ms |
22996 KB |
Output is correct |
31 |
Correct |
159 ms |
23504 KB |
Output is correct |
32 |
Correct |
221 ms |
19048 KB |
Output is correct |
33 |
Correct |
161 ms |
18244 KB |
Output is correct |
34 |
Correct |
234 ms |
24312 KB |
Output is correct |
35 |
Correct |
188 ms |
21000 KB |
Output is correct |
36 |
Correct |
215 ms |
28224 KB |
Output is correct |
37 |
Correct |
267 ms |
33116 KB |
Output is correct |
38 |
Correct |
282 ms |
35752 KB |
Output is correct |
39 |
Correct |
219 ms |
26236 KB |
Output is correct |
40 |
Correct |
351 ms |
39764 KB |
Output is correct |
41 |
Correct |
360 ms |
39736 KB |
Output is correct |
42 |
Correct |
346 ms |
35484 KB |
Output is correct |
43 |
Correct |
142 ms |
15956 KB |
Output is correct |
44 |
Correct |
279 ms |
29608 KB |
Output is correct |
45 |
Correct |
273 ms |
32716 KB |
Output is correct |
46 |
Correct |
289 ms |
31820 KB |
Output is correct |
47 |
Correct |
246 ms |
30976 KB |
Output is correct |
48 |
Correct |
346 ms |
35888 KB |
Output is correct |