#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
const int N = 205, M = 5e4 + 7;
const int INF = 1e9 + 19;
const long long LINF = 1e18 + 239;
struct Edge {
int v, u, c, d;
Edge() {}
Edge(int v, int u, int c, int d) : v(v), u(u), c(c), d(d) {}
};
int n, m;
Edge edg[M];
vector <int> find_dist(int s, bool rev, int p[N], vector <int> g[N], int ign = -1) {
vector <int> d(n, INF);
for (int i = 0; i < n; ++i)
p[i] = -1;
priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > q;
d[s] = 0;
q.push({0, s});
while (!q.empty()) {
auto cur = q.top();
q.pop();
int v = cur.second;
if (d[v] != cur.first)
continue;
for (auto id : g[v]) {
if (id == ign)
continue;
int w = edg[id].c, u = rev ? edg[id].v : edg[id].u;
if (d[v] + w < d[u]) {
d[u] = d[v] + w;
p[u] = id;
q.push({d[u], u});
}
}
}
return d;
}
vector <int> g[N], gr[N];
int p1[N], pn[N];
int rev_p1[N], rev_pn[N];
bool bad1[M], badn[M];
bool rev_bad1[M], rev_badn[M];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> edg[i].v >> edg[i].u >> edg[i].c >> edg[i].d;
edg[i].v--;
edg[i].u--;
g[edg[i].v].push_back(i);
gr[edg[i].u].push_back(i);
}
auto d1 = find_dist(0, 0, p1, g);
auto dn = find_dist(n - 1, 0, pn, g);
auto rev_d1 = find_dist(0, 1, rev_p1, gr);
auto rev_dn = find_dist(n - 1, 1, rev_pn, gr);
for (int i = 0; i < n; ++i) {
if (~p1[i])
bad1[p1[i]] = 1;
if (~pn[i])
badn[pn[i]] = 1;
if (~rev_p1[i])
rev_bad1[rev_p1[i]] = 1;
if (~rev_pn[i])
rev_badn[rev_pn[i]] = 1;
}
long long ans = LINF;
if (d1[n - 1] != INF && dn[0] != INF)
ans = (long long)d1[n - 1] + dn[0];
for (int i = 0; i < m; ++i) {
vector <int> cur_d1 = bad1[i] ? find_dist(0, 0, p1, g, i) : d1;
vector <int> cur_dn = badn[i] ? find_dist(n - 1, 0, pn, g, i) : dn;
vector <int> kek_d1 = rev_bad1[i] ? find_dist(0, 1, rev_p1, gr, i) : rev_d1;
vector <int> kek_dn = rev_badn[i] ? find_dist(n - 1, 1, rev_pn, gr, i) : rev_dn;
long long dist1 = cur_d1[n - 1] == INF ? LINF : cur_d1[n - 1], distn = cur_dn[0] == INF ? LINF : cur_dn[0];
if (cur_d1[edg[i].u] != INF && kek_dn[edg[i].v] != INF)
dist1 = min(dist1, (long long)edg[i].c + cur_d1[edg[i].u] + kek_dn[edg[i].v]);
if (cur_dn[edg[i].u] != INF && kek_d1[edg[i].v] != INF)
distn = min(distn, (long long)edg[i].c + cur_dn[edg[i].u] + kek_d1[edg[i].v]);
if (dist1 != LINF && distn != LINF)
ans = min(ans, dist1 + distn + edg[i].d);
}
if (ans == LINF)
cout << "-1\n";
else
cout << ans << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
26 ms |
384 KB |
Output is correct |
4 |
Correct |
28 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
0 ms |
384 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
37 ms |
384 KB |
Output is correct |
11 |
Correct |
36 ms |
384 KB |
Output is correct |
12 |
Correct |
36 ms |
384 KB |
Output is correct |
13 |
Correct |
6 ms |
384 KB |
Output is correct |
14 |
Correct |
17 ms |
384 KB |
Output is correct |
15 |
Correct |
14 ms |
384 KB |
Output is correct |
16 |
Correct |
16 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
242 ms |
2048 KB |
Output is correct |
2 |
Correct |
239 ms |
2036 KB |
Output is correct |
3 |
Correct |
243 ms |
2048 KB |
Output is correct |
4 |
Correct |
25 ms |
384 KB |
Output is correct |
5 |
Correct |
12 ms |
384 KB |
Output is correct |
6 |
Correct |
3 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
384 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
81 ms |
2048 KB |
Output is correct |
10 |
Correct |
81 ms |
1912 KB |
Output is correct |
11 |
Correct |
169 ms |
1920 KB |
Output is correct |
12 |
Correct |
175 ms |
2168 KB |
Output is correct |
13 |
Correct |
170 ms |
1920 KB |
Output is correct |
14 |
Correct |
166 ms |
2040 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
384 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
150 ms |
1628 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
190 ms |
1920 KB |
Output is correct |
6 |
Correct |
0 ms |
384 KB |
Output is correct |
7 |
Correct |
0 ms |
384 KB |
Output is correct |
8 |
Correct |
66 ms |
1912 KB |
Output is correct |
9 |
Correct |
69 ms |
1912 KB |
Output is correct |
10 |
Correct |
129 ms |
1920 KB |
Output is correct |
11 |
Correct |
132 ms |
1920 KB |
Output is correct |
12 |
Correct |
131 ms |
1920 KB |
Output is correct |
13 |
Correct |
0 ms |
384 KB |
Output is correct |
14 |
Correct |
0 ms |
384 KB |
Output is correct |
15 |
Correct |
0 ms |
384 KB |
Output is correct |
16 |
Correct |
0 ms |
384 KB |
Output is correct |
17 |
Correct |
0 ms |
384 KB |
Output is correct |
18 |
Correct |
0 ms |
384 KB |
Output is correct |
19 |
Correct |
132 ms |
2048 KB |
Output is correct |
20 |
Correct |
136 ms |
2040 KB |
Output is correct |
21 |
Correct |
134 ms |
1920 KB |
Output is correct |
22 |
Correct |
130 ms |
1920 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
26 ms |
384 KB |
Output is correct |
4 |
Correct |
28 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
0 ms |
384 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
37 ms |
384 KB |
Output is correct |
11 |
Correct |
36 ms |
384 KB |
Output is correct |
12 |
Correct |
36 ms |
384 KB |
Output is correct |
13 |
Correct |
6 ms |
384 KB |
Output is correct |
14 |
Correct |
17 ms |
384 KB |
Output is correct |
15 |
Correct |
14 ms |
384 KB |
Output is correct |
16 |
Correct |
16 ms |
384 KB |
Output is correct |
17 |
Correct |
242 ms |
2048 KB |
Output is correct |
18 |
Correct |
239 ms |
2036 KB |
Output is correct |
19 |
Correct |
243 ms |
2048 KB |
Output is correct |
20 |
Correct |
25 ms |
384 KB |
Output is correct |
21 |
Correct |
12 ms |
384 KB |
Output is correct |
22 |
Correct |
3 ms |
384 KB |
Output is correct |
23 |
Correct |
1 ms |
384 KB |
Output is correct |
24 |
Correct |
1 ms |
384 KB |
Output is correct |
25 |
Correct |
81 ms |
2048 KB |
Output is correct |
26 |
Correct |
81 ms |
1912 KB |
Output is correct |
27 |
Correct |
169 ms |
1920 KB |
Output is correct |
28 |
Correct |
175 ms |
2168 KB |
Output is correct |
29 |
Correct |
170 ms |
1920 KB |
Output is correct |
30 |
Correct |
166 ms |
2040 KB |
Output is correct |
31 |
Correct |
21 ms |
384 KB |
Output is correct |
32 |
Correct |
3 ms |
384 KB |
Output is correct |
33 |
Correct |
150 ms |
1628 KB |
Output is correct |
34 |
Correct |
2 ms |
384 KB |
Output is correct |
35 |
Correct |
190 ms |
1920 KB |
Output is correct |
36 |
Correct |
0 ms |
384 KB |
Output is correct |
37 |
Correct |
0 ms |
384 KB |
Output is correct |
38 |
Correct |
66 ms |
1912 KB |
Output is correct |
39 |
Correct |
69 ms |
1912 KB |
Output is correct |
40 |
Correct |
129 ms |
1920 KB |
Output is correct |
41 |
Correct |
132 ms |
1920 KB |
Output is correct |
42 |
Correct |
131 ms |
1920 KB |
Output is correct |
43 |
Correct |
0 ms |
384 KB |
Output is correct |
44 |
Correct |
0 ms |
384 KB |
Output is correct |
45 |
Correct |
0 ms |
384 KB |
Output is correct |
46 |
Correct |
0 ms |
384 KB |
Output is correct |
47 |
Correct |
0 ms |
384 KB |
Output is correct |
48 |
Correct |
0 ms |
384 KB |
Output is correct |
49 |
Correct |
132 ms |
2048 KB |
Output is correct |
50 |
Correct |
136 ms |
2040 KB |
Output is correct |
51 |
Correct |
134 ms |
1920 KB |
Output is correct |
52 |
Correct |
130 ms |
1920 KB |
Output is correct |
53 |
Correct |
268 ms |
2084 KB |
Output is correct |
54 |
Correct |
264 ms |
1920 KB |
Output is correct |
55 |
Correct |
267 ms |
1920 KB |
Output is correct |
56 |
Correct |
27 ms |
384 KB |
Output is correct |
57 |
Correct |
28 ms |
384 KB |
Output is correct |
58 |
Correct |
225 ms |
1656 KB |
Output is correct |
59 |
Correct |
237 ms |
1784 KB |
Output is correct |
60 |
Correct |
229 ms |
1536 KB |
Output is correct |
61 |
Correct |
215 ms |
1664 KB |
Output is correct |
62 |
Correct |
226 ms |
1784 KB |
Output is correct |
63 |
Correct |
230 ms |
1536 KB |
Output is correct |
64 |
Execution timed out |
1095 ms |
1984 KB |
Time limit exceeded |
65 |
Halted |
0 ms |
0 KB |
- |