#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define INF 1e15
#define ve vector
#define vi ve<int>
#define ii pair<int,int>
#define vii ve<ii>
#define pb push_back
#define fi first
#define se second
#define ll long long
using namespace __gnu_pbds;
using namespace std;
const int nax = 1e4+5;
const int kax = 1e5+5;
const int MOD = 1e9+7;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int x[kax], y[kax];
ll c[kax], d[kax];
int n,m;
vi adj[2][nax];
set<int> way1, way2;
ve<ll> dijkstra(int st, bool type, int del){
priority_queue<pair<ll,int>, ve<pair<ll,int>>, greater<pair<ll,int>>> pq;
ve<ll> dist(n+1, INF);
dist[st] = 0;
vi par(n+1,-1);
pq.push({0ll, st});
while(!pq.empty()){
ll cst = pq.top().fi;
int u = pq.top().se;
pq.pop();
if(dist[u] != cst) continue;
for(auto j : adj[type][u]){
if(j == del) continue;
int to = y[j];
if(type) to = x[j];
if(dist[to] > (c[j] + dist[u])){
dist[to] = c[j] + dist[u];
par[to] = j;
pq.push({dist[to], to});
}
}
if(del != -1 && u == y[del] && dist[x[del]] > (c[del] + dist[u])){
dist[x[del]] = c[del] + dist[u];
pq.push({dist[x[del]], x[del]});
}
}
if(way1.size() == 0){
if(dist[n] == INF) way1.insert(-1);
int u = n;
while(par[u] != -1){
way1.insert(par[u]);
u = x[par[u]];
}
} else if(way2.size() == 0){
if(dist[1] == INF) way2.insert(-1);
int u = 1;
while(par[u] != -1){
way2.insert(par[u]);
u = x[par[u]];
}
}
return dist;
}
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
cin >> x[i] >> y[i] >> c[i] >> d[i];
adj[0][x[i]].pb(i);
adj[1][y[i]].pb(i);
}
ve<ll> dist1 = dijkstra(1, 0, -1), distn = dijkstra(n, 0, -1), distrev1 = dijkstra(1, 1, -1) , distrevn = dijkstra(n, 1, -1);
ll aff = min(dist1[n] + distn[1], (ll)INF);
for (int i = 0; i < m; ++i)
{
if(!way1.count(i) && !way2.count(i)){
aff = min(aff, dist1[y[i]] + distrevn[x[i]] + distn[y[i]] + distrev1[x[i]] + 2*c[i] + d[i]);
aff = min(aff, dist1[n] + distn[y[i]] + distrev1[x[i]] + c[i] + d[i]);
aff = min(aff, dist1[y[i]] + distrevn[x[i]] + distn[1] + c[i] + d[i]);
} else {
ve<ll> cur1 = dijkstra(1, 0, i), curn = dijkstra(n, 0, i);
aff = min(aff, cur1[n] + curn[1] + d[i]);
}
}
if(aff >= INF) cout << -1 << endl;
else cout << aff << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
852 KB |
Output is correct |
2 |
Correct |
1 ms |
800 KB |
Output is correct |
3 |
Correct |
2 ms |
852 KB |
Output is correct |
4 |
Correct |
2 ms |
852 KB |
Output is correct |
5 |
Correct |
2 ms |
852 KB |
Output is correct |
6 |
Correct |
1 ms |
724 KB |
Output is correct |
7 |
Correct |
1 ms |
724 KB |
Output is correct |
8 |
Correct |
1 ms |
724 KB |
Output is correct |
9 |
Correct |
2 ms |
852 KB |
Output is correct |
10 |
Correct |
16 ms |
852 KB |
Output is correct |
11 |
Correct |
24 ms |
912 KB |
Output is correct |
12 |
Correct |
19 ms |
852 KB |
Output is correct |
13 |
Correct |
1 ms |
852 KB |
Output is correct |
14 |
Correct |
1 ms |
852 KB |
Output is correct |
15 |
Correct |
1 ms |
852 KB |
Output is correct |
16 |
Correct |
1 ms |
860 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
3700 KB |
Output is correct |
2 |
Correct |
27 ms |
3628 KB |
Output is correct |
3 |
Correct |
20 ms |
3872 KB |
Output is correct |
4 |
Correct |
2 ms |
852 KB |
Output is correct |
5 |
Correct |
2 ms |
808 KB |
Output is correct |
6 |
Correct |
1 ms |
852 KB |
Output is correct |
7 |
Correct |
1 ms |
800 KB |
Output is correct |
8 |
Correct |
1 ms |
788 KB |
Output is correct |
9 |
Correct |
24 ms |
3736 KB |
Output is correct |
10 |
Correct |
14 ms |
3796 KB |
Output is correct |
11 |
Correct |
19 ms |
3732 KB |
Output is correct |
12 |
Correct |
19 ms |
3836 KB |
Output is correct |
13 |
Correct |
17 ms |
3804 KB |
Output is correct |
14 |
Correct |
27 ms |
3924 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
856 KB |
Output is correct |
2 |
Correct |
1 ms |
852 KB |
Output is correct |
3 |
Correct |
13 ms |
2904 KB |
Output is correct |
4 |
Correct |
1 ms |
852 KB |
Output is correct |
5 |
Correct |
17 ms |
3536 KB |
Output is correct |
6 |
Correct |
1 ms |
724 KB |
Output is correct |
7 |
Correct |
1 ms |
796 KB |
Output is correct |
8 |
Correct |
22 ms |
3532 KB |
Output is correct |
9 |
Correct |
21 ms |
3520 KB |
Output is correct |
10 |
Correct |
19 ms |
3540 KB |
Output is correct |
11 |
Correct |
15 ms |
3508 KB |
Output is correct |
12 |
Correct |
23 ms |
3504 KB |
Output is correct |
13 |
Correct |
1 ms |
724 KB |
Output is correct |
14 |
Correct |
1 ms |
724 KB |
Output is correct |
15 |
Correct |
1 ms |
724 KB |
Output is correct |
16 |
Correct |
1 ms |
724 KB |
Output is correct |
17 |
Correct |
1 ms |
796 KB |
Output is correct |
18 |
Correct |
1 ms |
772 KB |
Output is correct |
19 |
Correct |
15 ms |
3540 KB |
Output is correct |
20 |
Correct |
14 ms |
3480 KB |
Output is correct |
21 |
Correct |
17 ms |
3500 KB |
Output is correct |
22 |
Correct |
24 ms |
3512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
852 KB |
Output is correct |
2 |
Correct |
1 ms |
800 KB |
Output is correct |
3 |
Correct |
2 ms |
852 KB |
Output is correct |
4 |
Correct |
2 ms |
852 KB |
Output is correct |
5 |
Correct |
2 ms |
852 KB |
Output is correct |
6 |
Correct |
1 ms |
724 KB |
Output is correct |
7 |
Correct |
1 ms |
724 KB |
Output is correct |
8 |
Correct |
1 ms |
724 KB |
Output is correct |
9 |
Correct |
2 ms |
852 KB |
Output is correct |
10 |
Correct |
16 ms |
852 KB |
Output is correct |
11 |
Correct |
24 ms |
912 KB |
Output is correct |
12 |
Correct |
19 ms |
852 KB |
Output is correct |
13 |
Correct |
1 ms |
852 KB |
Output is correct |
14 |
Correct |
1 ms |
852 KB |
Output is correct |
15 |
Correct |
1 ms |
852 KB |
Output is correct |
16 |
Correct |
1 ms |
860 KB |
Output is correct |
17 |
Correct |
19 ms |
3700 KB |
Output is correct |
18 |
Correct |
27 ms |
3628 KB |
Output is correct |
19 |
Correct |
20 ms |
3872 KB |
Output is correct |
20 |
Correct |
2 ms |
852 KB |
Output is correct |
21 |
Correct |
2 ms |
808 KB |
Output is correct |
22 |
Correct |
1 ms |
852 KB |
Output is correct |
23 |
Correct |
1 ms |
800 KB |
Output is correct |
24 |
Correct |
1 ms |
788 KB |
Output is correct |
25 |
Correct |
24 ms |
3736 KB |
Output is correct |
26 |
Correct |
14 ms |
3796 KB |
Output is correct |
27 |
Correct |
19 ms |
3732 KB |
Output is correct |
28 |
Correct |
19 ms |
3836 KB |
Output is correct |
29 |
Correct |
17 ms |
3804 KB |
Output is correct |
30 |
Correct |
27 ms |
3924 KB |
Output is correct |
31 |
Correct |
2 ms |
856 KB |
Output is correct |
32 |
Correct |
1 ms |
852 KB |
Output is correct |
33 |
Correct |
13 ms |
2904 KB |
Output is correct |
34 |
Correct |
1 ms |
852 KB |
Output is correct |
35 |
Correct |
17 ms |
3536 KB |
Output is correct |
36 |
Correct |
1 ms |
724 KB |
Output is correct |
37 |
Correct |
1 ms |
796 KB |
Output is correct |
38 |
Correct |
22 ms |
3532 KB |
Output is correct |
39 |
Correct |
21 ms |
3520 KB |
Output is correct |
40 |
Correct |
19 ms |
3540 KB |
Output is correct |
41 |
Correct |
15 ms |
3508 KB |
Output is correct |
42 |
Correct |
23 ms |
3504 KB |
Output is correct |
43 |
Correct |
1 ms |
724 KB |
Output is correct |
44 |
Correct |
1 ms |
724 KB |
Output is correct |
45 |
Correct |
1 ms |
724 KB |
Output is correct |
46 |
Correct |
1 ms |
724 KB |
Output is correct |
47 |
Correct |
1 ms |
796 KB |
Output is correct |
48 |
Correct |
1 ms |
772 KB |
Output is correct |
49 |
Correct |
15 ms |
3540 KB |
Output is correct |
50 |
Correct |
14 ms |
3480 KB |
Output is correct |
51 |
Correct |
17 ms |
3500 KB |
Output is correct |
52 |
Correct |
24 ms |
3512 KB |
Output is correct |
53 |
Correct |
24 ms |
3564 KB |
Output is correct |
54 |
Correct |
21 ms |
3640 KB |
Output is correct |
55 |
Correct |
31 ms |
3556 KB |
Output is correct |
56 |
Correct |
2 ms |
812 KB |
Output is correct |
57 |
Correct |
2 ms |
852 KB |
Output is correct |
58 |
Correct |
128 ms |
3060 KB |
Output is correct |
59 |
Correct |
125 ms |
3060 KB |
Output is correct |
60 |
Correct |
171 ms |
3060 KB |
Output is correct |
61 |
Correct |
115 ms |
3064 KB |
Output is correct |
62 |
Correct |
140 ms |
3064 KB |
Output is correct |
63 |
Correct |
156 ms |
3072 KB |
Output is correct |
64 |
Correct |
651 ms |
3624 KB |
Output is correct |
65 |
Correct |
707 ms |
3572 KB |
Output is correct |
66 |
Correct |
976 ms |
3560 KB |
Output is correct |
67 |
Correct |
13 ms |
3104 KB |
Output is correct |
68 |
Correct |
17 ms |
3832 KB |
Output is correct |
69 |
Correct |
17 ms |
3852 KB |
Output is correct |
70 |
Correct |
20 ms |
3840 KB |
Output is correct |
71 |
Correct |
24 ms |
3796 KB |
Output is correct |
72 |
Correct |
22 ms |
3756 KB |
Output is correct |
73 |
Correct |
21 ms |
3880 KB |
Output is correct |
74 |
Correct |
23 ms |
3752 KB |
Output is correct |