제출 #1053529

#제출 시각아이디문제언어결과실행 시간메모리
1053529beaconmcText editor (CEOI24_editor)C++14
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> typedef long long ll; #define FOR(i,x,y) for(ll i=x; i<y; i++) #define FORNEG(i,x,y) for(ll i=x; i>y; i--) using namespace std; const ll INF = 100000000000000000; int main(){ ll n; cin >> n; vector<ll> arr(n); ll a,b; ll x,y; cin >> a >> b >> x >> y; a--;b--;x--;y--; FOR(i,0,n) cin >> arr[i]; ll ans = INF; ans = abs(a-x) + abs(b-y); if (a != n-1) ans = min(ans, abs(b-arr[a]) + 1 + abs(0-y) + abs((a+1)-x)); if (a != 0) ans = min(ans, abs(b) + 1 + abs(arr[x]-y) + abs((a-1)-x)); ans = min(ans, abs((n-1)-a) + abs((n-1) - x) + abs(0-y)); cout << ans << endl; }
#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...