#define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define endl '\n'
#endif
#define int long long
#define all(x) x.begin(), x.end()
typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef vector<bool> vb; typedef vector<vector<bool>> vvb; typedef pair<int, int> pii; typedef map<int, int> mii; typedef map<int, vector<int>> mivi;
const int mod = 1000000007; // 10^9 + 7
const int INF = 1e17;
#define MAXN 200
#define MAXM 50000
struct Edge {
int u, v, c, d;
};
int n, m;
Edge edges[MAXM];
list<int> adj[MAXN];
int dist[MAXN][MAXN];
int cost(int s, int t, int ri){
priority_queue<pii> pq;
pq.push({0, s});
vi dis(n, INF);
dis[s] = 0;
while (!pq.empty()){
auto [d, u] = pq.top();
pq.pop();
if (dis[u] != d) continue;
if (ri != -1 && edges[ri].v == u){
int v = edges[ri].u, cd = edges[ri].c;
if (d + cd < dis[v]){
dis[v] = d + cd;
pq.push({dis[v], v});
}
}
for (int i : adj[u]){
if (i == ri) continue;
int v = edges[i].v, cd = edges[i].c;
if (d + cd < dis[v]){
dis[v] = d + cd;
pq.push({dis[v], v});
}
}
}
return dis[t];
}
int cost(int ri = -1){ return cost(0, n-1, ri) + cost(n-1, 0, ri); }
void solve(){
cin >> n >> m;
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++)
dist[i][j] = INF;
dist[i][i] = 0;
}
for (int i = 0; i < m; i++){
auto &[u, v, c, d] = edges[i];
cin >> u >> v >> c >> d;
u--, v--;
adj[u].push_back(i);
dist[u][v] = min(dist[u][v], c);
}
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
int ans = cost();
for (int i = 0; i < m; i++){
auto [u, v, c, d] = edges[i];
int fw = min(dist[0][n-1], dist[0][v] + c + dist[u][n-1]),
bw = min(dist[n-1][0], dist[n-1][v] + c + dist[u][0]);
if (fw < INF && bw < INF && (fw + bw + d) < ans)
ans = min(ans, cost(i) + d);
}
cout << (ans >= INF ? -1 : ans) << endl;
}
int32_t main(){
#ifndef ONLINE_JUDGE
auto begin = chrono::high_resolution_clock::now();
freopen("sol.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T = 1;// cin >> T;
for (int i = 1; i <= T; i++){
#ifndef ONLINE_JUDGE
if (T != 1)
cout << "Test Case #" << i << endl;
#endif
solve();
}
#ifndef ONLINE_JUDGE
auto elapsed = chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now() - begin);
cout << "Time Taken : " << (elapsed.count() * 1e-9) << " seconds" << endl;
#endif
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
600 KB |
Output is correct |
2 |
Correct |
7 ms |
796 KB |
Output is correct |
3 |
Correct |
8 ms |
604 KB |
Output is correct |
4 |
Correct |
9 ms |
844 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
7 ms |
796 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
98 ms |
828 KB |
Output is correct |
11 |
Correct |
453 ms |
844 KB |
Output is correct |
12 |
Correct |
24 ms |
604 KB |
Output is correct |
13 |
Correct |
10 ms |
844 KB |
Output is correct |
14 |
Correct |
8 ms |
604 KB |
Output is correct |
15 |
Correct |
11 ms |
840 KB |
Output is correct |
16 |
Correct |
14 ms |
844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
104 ms |
3676 KB |
Output is correct |
2 |
Correct |
272 ms |
3908 KB |
Output is correct |
3 |
Correct |
122 ms |
3672 KB |
Output is correct |
4 |
Correct |
12 ms |
1112 KB |
Output is correct |
5 |
Correct |
10 ms |
604 KB |
Output is correct |
6 |
Correct |
7 ms |
816 KB |
Output is correct |
7 |
Correct |
7 ms |
600 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
930 ms |
3904 KB |
Output is correct |
10 |
Correct |
560 ms |
3896 KB |
Output is correct |
11 |
Correct |
213 ms |
3676 KB |
Output is correct |
12 |
Correct |
217 ms |
3676 KB |
Output is correct |
13 |
Correct |
116 ms |
3888 KB |
Output is correct |
14 |
Correct |
211 ms |
3672 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
600 KB |
Output is correct |
2 |
Correct |
7 ms |
604 KB |
Output is correct |
3 |
Correct |
19 ms |
3224 KB |
Output is correct |
4 |
Correct |
7 ms |
796 KB |
Output is correct |
5 |
Correct |
21 ms |
3780 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
41 ms |
3672 KB |
Output is correct |
9 |
Correct |
41 ms |
3672 KB |
Output is correct |
10 |
Correct |
24 ms |
3900 KB |
Output is correct |
11 |
Correct |
29 ms |
3932 KB |
Output is correct |
12 |
Correct |
22 ms |
3676 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
0 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
344 KB |
Output is correct |
19 |
Correct |
23 ms |
3908 KB |
Output is correct |
20 |
Correct |
23 ms |
3672 KB |
Output is correct |
21 |
Correct |
22 ms |
3852 KB |
Output is correct |
22 |
Correct |
22 ms |
3676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
600 KB |
Output is correct |
2 |
Correct |
7 ms |
796 KB |
Output is correct |
3 |
Correct |
8 ms |
604 KB |
Output is correct |
4 |
Correct |
9 ms |
844 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
7 ms |
796 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
98 ms |
828 KB |
Output is correct |
11 |
Correct |
453 ms |
844 KB |
Output is correct |
12 |
Correct |
24 ms |
604 KB |
Output is correct |
13 |
Correct |
10 ms |
844 KB |
Output is correct |
14 |
Correct |
8 ms |
604 KB |
Output is correct |
15 |
Correct |
11 ms |
840 KB |
Output is correct |
16 |
Correct |
14 ms |
844 KB |
Output is correct |
17 |
Correct |
104 ms |
3676 KB |
Output is correct |
18 |
Correct |
272 ms |
3908 KB |
Output is correct |
19 |
Correct |
122 ms |
3672 KB |
Output is correct |
20 |
Correct |
12 ms |
1112 KB |
Output is correct |
21 |
Correct |
10 ms |
604 KB |
Output is correct |
22 |
Correct |
7 ms |
816 KB |
Output is correct |
23 |
Correct |
7 ms |
600 KB |
Output is correct |
24 |
Correct |
0 ms |
348 KB |
Output is correct |
25 |
Correct |
930 ms |
3904 KB |
Output is correct |
26 |
Correct |
560 ms |
3896 KB |
Output is correct |
27 |
Correct |
213 ms |
3676 KB |
Output is correct |
28 |
Correct |
217 ms |
3676 KB |
Output is correct |
29 |
Correct |
116 ms |
3888 KB |
Output is correct |
30 |
Correct |
211 ms |
3672 KB |
Output is correct |
31 |
Correct |
7 ms |
600 KB |
Output is correct |
32 |
Correct |
7 ms |
604 KB |
Output is correct |
33 |
Correct |
19 ms |
3224 KB |
Output is correct |
34 |
Correct |
7 ms |
796 KB |
Output is correct |
35 |
Correct |
21 ms |
3780 KB |
Output is correct |
36 |
Correct |
0 ms |
348 KB |
Output is correct |
37 |
Correct |
0 ms |
348 KB |
Output is correct |
38 |
Correct |
41 ms |
3672 KB |
Output is correct |
39 |
Correct |
41 ms |
3672 KB |
Output is correct |
40 |
Correct |
24 ms |
3900 KB |
Output is correct |
41 |
Correct |
29 ms |
3932 KB |
Output is correct |
42 |
Correct |
22 ms |
3676 KB |
Output is correct |
43 |
Correct |
0 ms |
344 KB |
Output is correct |
44 |
Correct |
0 ms |
348 KB |
Output is correct |
45 |
Correct |
0 ms |
348 KB |
Output is correct |
46 |
Correct |
0 ms |
348 KB |
Output is correct |
47 |
Correct |
0 ms |
348 KB |
Output is correct |
48 |
Correct |
0 ms |
344 KB |
Output is correct |
49 |
Correct |
23 ms |
3908 KB |
Output is correct |
50 |
Correct |
23 ms |
3672 KB |
Output is correct |
51 |
Correct |
22 ms |
3852 KB |
Output is correct |
52 |
Correct |
22 ms |
3676 KB |
Output is correct |
53 |
Correct |
154 ms |
3900 KB |
Output is correct |
54 |
Correct |
140 ms |
3908 KB |
Output is correct |
55 |
Correct |
143 ms |
3672 KB |
Output is correct |
56 |
Correct |
8 ms |
604 KB |
Output is correct |
57 |
Correct |
9 ms |
600 KB |
Output is correct |
58 |
Correct |
127 ms |
3524 KB |
Output is correct |
59 |
Correct |
199 ms |
3268 KB |
Output is correct |
60 |
Correct |
301 ms |
3284 KB |
Output is correct |
61 |
Correct |
153 ms |
3268 KB |
Output is correct |
62 |
Execution timed out |
1033 ms |
3160 KB |
Time limit exceeded |
63 |
Halted |
0 ms |
0 KB |
- |