This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
sl--, sc--, el--, ec--;
vector<int> l(n);
for(int i = 0; i < n; i++) cin >> l[i];
cout << abs(sl - el) + min(abs(sc - ec), min((sl == n - 1 ? INT_MAX : l[0] - sc + ec), (sl == 0 ? INT_MAX : sc + 2 + l[0] - ec))) << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |