Submission #1137700

#TimeUsernameProblemLanguageResultExecution timeMemory
1137700UmairAhmadMirzaText editor (CEOI24_editor)C++20
0 / 100
0 ms324 KiB
#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]; if(sl==tl) cout<<abs(sc-tc)<<endl; else{ int ans1=abs(tl-sl)+abs(sc-tc); //backward int ans2=sc+abs((sl-1)-tl)+abs((L[0]+1)-tc); int ans3=(2+L[0]-sc)+abs((sl+1)-tl)+abs((L[0]+1)-tc); cout<<min(min(ans1,ans2),ans3)<<endl; } } int main(){ int t=1; cin>>t; while(t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...