#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve() {
int n, sl, sc, el, ec;
cin >> n >> sl >> sc >> el >> ec;
int l[n+1];
for(int i=1; i<=n; ++i) {
cin >> l[i];
++l[i];
}
if(n == 1) {
ans = abs(ec - sc);
ans = min(ans, sc + l[1] - ec);
ans = min(ans, l[1] - sc + ec);
cout << ans << endl;
return;
}
if(n == 2) {
if(sl == el) {
cout << abs(ec - sc) << endl;
return;
}
int ans;
if(sl == 1) {
int y = sc;
y = min(y, l[2]);
ans = 1 + abs(y - ec);
ans = min(ans, sc + l[2] - ec);
ans = min(ans, l[1] - sc + ec);
cout << ans << endl;
} else {
int y = sc;
y = min(y, l[1]);
ans = 1 + abs(y - ec);
ans = min(ans, sc + l[1] - ec);
ans = min(ans, l[2] - sc + ec);
cout << ans << endl;
}
return;
}
priority_queue<pair<int,pair<int,int>>>pq;
vector<vector<int>>dp(n+1, vector<int>(5005, INT_MAX));
vector<vector<bool>>visited(n+1, vector<bool>(5005, 0));
dp[sl][sc] = 0;
pq.push({0, {sl, sc}});
while(!pq.empty()) {
int x = pq.top().second.first, y = pq.top().second.second;
if(x == el && y == ec) break;
pq.pop();
if(visited[x][y]) continue;
visited[x][y] = 1;
if(x != n) { // down
int new_y = y;
new_y = min(new_y, l[x+1]);
if(dp[x+1][new_y] > dp[x][y] + 1) {
dp[x+1][new_y] = dp[x][y] + 1;
pq.push({-dp[x+1][new_y], {x+1, new_y}});
}
}
if(x != 1) { // up
int new_y = y;
new_y = min(new_y, l[x-1]);
if(dp[x-1][new_y] > dp[x][y] + 1) {
dp[x-1][new_y] = dp[x][y] + 1;
pq.push({-dp[x-1][new_y], {x-1, new_y}});
}
}
if(y == 1 && x != 1) { // left up
int new_x = x - 1, new_y = l[new_x];
if(dp[x][y] + 1 < dp[new_x][new_y]) {
dp[new_x][new_y] = dp[x][y] + 1;
pq.push({-dp[new_x][new_y], {new_x, new_y}});
}
} else if(y != 1) { // left
if(dp[x][y] + 1 < dp[x][y-1]) {
dp[x][y-1] = dp[x][y] + 1;
pq.push({-dp[x][y-1], {x, y-1}});
}
}
if(y == l[x] && x != n) { // right down
int new_x = x+1, new_y = 1;
if(dp[x][y] + 1 < dp[new_x][new_y]) {
dp[new_x][new_y] = dp[x][y] + 1;
pq.push({-dp[new_x][new_y], {new_x, new_y}});
}
} else if(y != l[x]) { // right
if(dp[x][y] + 1 < dp[x][y+1]) {
dp[x][y+1] = dp[x][y] + 1;
pq.push({-dp[x][y+1], {x, y+1}});
}
}
}
cout << dp[el][ec] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1;
while(t--) solve();
return 0;
}
Compilation message
Main.cpp: In function 'void solve()':
Main.cpp:15:9: error: 'ans' was not declared in this scope; did you mean 'abs'?
15 | ans = abs(ec - sc);
| ^~~
| abs
