#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N = 201, M = 50001;
ll n, m;
multiset<pair<ll, ll>> adj[N];
ll c[M], d[M];
pair<ll, ll> edges[M];
vector<ll> sssp(ll source) {
vector<ll> dist(n + 1, 1e15);
dist[source] = 0;
priority_queue<pair<ll, ll>> pq;
pq.push({0, source});
while (!pq.empty()) {
ll node = pq.top().second, _dist = -pq.top().first;
pq.pop();
for (auto &nb : adj[node]) {
if (dist[nb.first] > _dist + c[nb.second]) {
dist[nb.first] = _dist + c[nb.second];
pq.push({-dist[nb.first], nb.first});
}
}
}
return dist;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (ll i = 1; i <= n; ++i) {
adj[i].clear();
}
vector<vector<ll>> dist(n + 1, vector<ll>(n + 1, 1e15));
for (ll i = 1; i <= n; ++i) {
dist[i][i] = 0;
}
for (ll i = 0, u, v; i < m; ++i) {
cin >> u >> v >> c[i] >> d[i];
adj[u].insert({v, i});
edges[i] = {u, v};
dist[u][v] = min(dist[u][v], c[i]);
}
for (ll a = 1; a <= n; ++a) {
for (ll b = 1; b <= n; ++b) {
for (ll c = 1; c <= n; ++c) {
dist[a][c] = min(dist[a][c], dist[a][b] + dist[b][c]);
}
}
}
ll ans = 1e15;
ans = min(ans, sssp(1)[n] + sssp(n)[1]);
for (ll i = 0; i < m; ++i) {
adj[edges[i].first].erase(adj[edges[i].first].find({edges[i].second, i}));
adj[edges[i].second].insert({edges[i].first, i});
ans = min(ans, d[i] + sssp(1)[n] + sssp(n)[1]);
adj[edges[i].second].erase(adj[edges[i].second].find({edges[i].first, i}));
adj[edges[i].first].insert({edges[i].second, i});
}
if (ans == (ll)(1e15)) {
ans = -1;
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
37 ms |
856 KB |
Output is correct |
2 |
Correct |
7 ms |
604 KB |
Output is correct |
3 |
Correct |
57 ms |
892 KB |
Output is correct |
4 |
Correct |
63 ms |
860 KB |
Output is correct |
5 |
Correct |
39 ms |
348 KB |
Output is correct |
6 |
Correct |
7 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
10 ms |
348 KB |
Output is correct |
10 |
Correct |
94 ms |
920 KB |
Output is correct |
11 |
Correct |
89 ms |
904 KB |
Output is correct |
12 |
Correct |
91 ms |
908 KB |
Output is correct |
13 |
Correct |
30 ms |
1112 KB |
Output is correct |
14 |
Correct |
40 ms |
860 KB |
Output is correct |
15 |
Correct |
33 ms |
928 KB |
Output is correct |
16 |
Correct |
39 ms |
856 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1069 ms |
5468 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
34 ms |
860 KB |
Output is correct |
2 |
Correct |
8 ms |
604 KB |
Output is correct |
3 |
Execution timed out |
1074 ms |
4956 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
37 ms |
856 KB |
Output is correct |
2 |
Correct |
7 ms |
604 KB |
Output is correct |
3 |
Correct |
57 ms |
892 KB |
Output is correct |
4 |
Correct |
63 ms |
860 KB |
Output is correct |
5 |
Correct |
39 ms |
348 KB |
Output is correct |
6 |
Correct |
7 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
10 ms |
348 KB |
Output is correct |
10 |
Correct |
94 ms |
920 KB |
Output is correct |
11 |
Correct |
89 ms |
904 KB |
Output is correct |
12 |
Correct |
91 ms |
908 KB |
Output is correct |
13 |
Correct |
30 ms |
1112 KB |
Output is correct |
14 |
Correct |
40 ms |
860 KB |
Output is correct |
15 |
Correct |
33 ms |
928 KB |
Output is correct |
16 |
Correct |
39 ms |
856 KB |
Output is correct |
17 |
Execution timed out |
1069 ms |
5468 KB |
Time limit exceeded |
18 |
Halted |
0 ms |
0 KB |
- |