#include <bits/stdc++.h>
using namespace std;
#define ll long long
int const N=2e5+5;
int const mod=1e9+7;
void solve(){
int n;
cin>>n;
int sl,sc,tl,tc;
cin>>sl>>sc>>tl>>tc;
int L[n];
for (int i = 0; i < n; ++i)
cin>>L[i];
cout<<abs(sl-tl)+min(abs(sc-tc),(L[0]+1)-abs(sc-tc))<<endl;
}
int main(){
int t=1;
cin>>t;
while(t--)
solve();
return 0;
}
# | 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... |