#include "walk.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ari2 = array<int, 2>;
using ari3 = array<int, 3>;
using arl2 = array<ll, 2>;
using arl3 = array<ll, 3>;
#define vt vector
#define size(x) (int((x).size()))
#define all(x) begin(x), end(x)
#define REP(a, b, c, d) for (int a = (b); (d) > 0 ? a <= (c) : a >= (c); a += (d))
#define FOR(a, b, c) REP(a, b, c, 1)
#define ROF(a, b, c) REP(a, b, c, -1)
ll ST12(vt<int> X, vt<int> H, vt<int> L, vt<int> R, vt<int> Y, int S, int G, int LEN) {
const int N = size(X), M = size(L);
vt<ari3> points;
FOR(i, 0, M-1)
FOR(j, L[i], R[i])
points.push_back({j, Y[i], i});
FOR(i, 0, N-1)
points.push_back({i, 0, -1});
sort(all(points));
points.erase(unique(all(points)), end(points));
vt<int> prv(M, -1);
vt<vt<ari2>> adj(size(points));
priority_queue<arl2, vt<arl2>, greater<arl2>> pq;
vt<ll> dst(size(points), LLONG_MAX);
FOR(i, 0, size(points)-1) {
if (i && points[i][0] == points[i-1][0] && points[i][1] <= H[points[i][0]]) {
adj[i-1].push_back({i, points[i][1] - points[i-1][1]});
adj[i].push_back({i-1, points[i][1] - points[i-1][1]});
}
if (~points[i][2] && ~prv[points[i][2]]) {
adj[i].push_back({prv[points[i][2]], X[points[i][0]] - X[points[prv[points[i][2]]][0]]});
adj[prv[points[i][2]]].push_back({i, X[points[i][0]] - X[points[prv[points[i][2]]][0]]});
}
if (~points[i][2])
prv[points[i][2]] = i;
if (points[i][0] == S && !points[i][1])
pq.push({dst[i] = 0, i});
}
while (size(pq)) {
auto [d, i] = pq.top();
pq.pop();
if (points[i][0] == G && !points[i][1])
return d;
if (d > dst[i])
continue;
#ifdef DEBUG
cout << "at " << X[points[i][0]] << ' ' << points[i][1] << " with dist of " << d << '\n';
#endif
for (auto &[j, v] : adj[i])
if (d + v < dst[j])
pq.push({dst[j] = d + v, j});
}
return -1;
}
ll ST34(vt<int> X, vt<int> H, vt<int> L, vt<int> R, vt<int> Y, int S, int G) {
}
ll min_distance(vt<int> X, vt<int> H, vt<int> L, vt<int> R, vt<int> Y, int S, int G) {
const int N = size(X), M = size(L);
if (!S && G == N-1)
return ST34(X, H, L, R, Y, S, G);
bool sub2 = true;
int LEN = N;
FOR(i, 0, M-1) {
sub2 &= R[i] - L[i] < 15;
LEN += R[i] - L[i] + 1;
}
if (sub2 || N < 51 && M < 51)
return ST12(X, H, L, R, Y, S, G, LEN);
}
Compilation message
walk.cpp: In function 'll ST34(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:70:1: warning: no return statement in function returning non-void [-Wreturn-type]
70 | }
| ^
walk.cpp: In function 'll min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:82:22: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
82 | if (sub2 || N < 51 && M < 51)
| ~~~~~~~^~~~~~~~~
walk.cpp:84:1: warning: control reaches end of non-void function [-Wreturn-type]
84 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Runtime error |
2 ms |
604 KB |
Execution killed with signal 6 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 6 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
4444 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
4444 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Runtime error |
2 ms |
604 KB |
Execution killed with signal 6 |
| 3 |
Halted |
0 ms |
0 KB |
- |
