#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<array<int, 3>> adj[100001];
int DP[100001];
map<int, int> DP2[100001], sum[100001];
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("TEST.in", "r", stdin);
//freopen("TEST.out", "w", stdout);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++)
{
int u, v, c, w;
cin >> u >> v >> c >> w;
adj[u].push_back({v, c, w});
adj[v].push_back({u, c, w});
sum[u][c] += w;
sum[v][c] += w;
}
memset(DP, 0x3f, sizeof DP);
DP[1] = 1;
priority_queue<array<int, 3>, vector<array<int, 3>>, greater<>> q;
q.push({DP[1], 1, 0});
while (!q.empty())
{
auto [d, u, pc] = q.top();
//if (pc == 0) cerr << u << " " << pc << " " << d - 1 << endl;
q.pop();
for (const auto& [v, c, w] : adj[u])
{
if (pc == c && DP[v] > DP2[u][c] + sum[u][c] - w)
{
DP[v] = DP2[u][c] + sum[u][c] - w;
q.push({DP[v], v, 0});
}
if (DP[v] > DP[u] + min(w, sum[u][c] - w))
{
DP[v] = DP[u] + min(w, sum[u][c] - w);
q.push({DP[v], v, 0});
}
if (DP2[v][c] > DP[u] || !DP2[v][c])
{
DP2[v][c] = DP[u];
q.push({DP2[v][c], v, c});
}
}
}
if (DP[n] > (int)1e18) cout << -1;
else cout << DP[n] - 1;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
12888 KB |
Output is correct |
2 |
Correct |
3 ms |
12892 KB |
Output is correct |
3 |
Correct |
4 ms |
12892 KB |
Output is correct |
4 |
Correct |
2 ms |
12888 KB |
Output is correct |
5 |
Correct |
3 ms |
12892 KB |
Output is correct |
6 |
Correct |
3 ms |
12892 KB |
Output is correct |
7 |
Correct |
5 ms |
13148 KB |
Output is correct |
8 |
Correct |
3 ms |
12888 KB |
Output is correct |
9 |
Correct |
39 ms |
13404 KB |
Output is correct |
10 |
Correct |
16 ms |
13400 KB |
Output is correct |
11 |
Correct |
4 ms |
13144 KB |
Output is correct |
12 |
Correct |
4 ms |
13148 KB |
Output is correct |
13 |
Correct |
5 ms |
13148 KB |
Output is correct |
14 |
Correct |
5 ms |
13284 KB |
Output is correct |
15 |
Correct |
3 ms |
13148 KB |
Output is correct |
16 |
Correct |
4 ms |
13148 KB |
Output is correct |
17 |
Correct |
5 ms |
13144 KB |
Output is correct |
18 |
Correct |
3 ms |
12992 KB |
Output is correct |
19 |
Correct |
7 ms |
13336 KB |
Output is correct |
20 |
Correct |
3 ms |
13144 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
155 ms |
30604 KB |
Output is correct |
2 |
Correct |
49 ms |
21004 KB |
Output is correct |
3 |
Correct |
111 ms |
30156 KB |
Output is correct |
4 |
Correct |
70 ms |
23812 KB |
Output is correct |
5 |
Execution timed out |
3082 ms |
50256 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
12888 KB |
Output is correct |
2 |
Correct |
3 ms |
12892 KB |
Output is correct |
3 |
Correct |
4 ms |
12892 KB |
Output is correct |
4 |
Correct |
2 ms |
12888 KB |
Output is correct |
5 |
Correct |
3 ms |
12892 KB |
Output is correct |
6 |
Correct |
3 ms |
12892 KB |
Output is correct |
7 |
Correct |
5 ms |
13148 KB |
Output is correct |
8 |
Correct |
3 ms |
12888 KB |
Output is correct |
9 |
Correct |
39 ms |
13404 KB |
Output is correct |
10 |
Correct |
16 ms |
13400 KB |
Output is correct |
11 |
Correct |
4 ms |
13144 KB |
Output is correct |
12 |
Correct |
4 ms |
13148 KB |
Output is correct |
13 |
Correct |
5 ms |
13148 KB |
Output is correct |
14 |
Correct |
5 ms |
13284 KB |
Output is correct |
15 |
Correct |
3 ms |
13148 KB |
Output is correct |
16 |
Correct |
4 ms |
13148 KB |
Output is correct |
17 |
Correct |
5 ms |
13144 KB |
Output is correct |
18 |
Correct |
3 ms |
12992 KB |
Output is correct |
19 |
Correct |
7 ms |
13336 KB |
Output is correct |
20 |
Correct |
3 ms |
13144 KB |
Output is correct |
21 |
Correct |
155 ms |
30604 KB |
Output is correct |
22 |
Correct |
49 ms |
21004 KB |
Output is correct |
23 |
Correct |
111 ms |
30156 KB |
Output is correct |
24 |
Correct |
70 ms |
23812 KB |
Output is correct |
25 |
Execution timed out |
3082 ms |
50256 KB |
Time limit exceeded |
26 |
Halted |
0 ms |
0 KB |
- |