제출 #1053551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053551		beaconmc	Text editor (CEOI24_editor)	C++14	16 / 100	213 ms	18984 KiB

Main

#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 != 0){
		ll A,B;
		ll temp = 0;
		temp += abs(b-0);
		temp += 1;
		A = a-1;
		B = arr[A];
		ans = min(ans, temp + abs(A-x) + abs(B-y));
	}
	if (a != n-1){
		ll A,B;
		ll temp = 0;
		temp += abs(b-arr[a]);
		temp += 1;
		A = a+1;
		B = 0;
		ans = min(ans, temp + abs(A-x) + abs(B-y));
	}
	ll A,B;
	ll temp = 0;
	temp += abs(a-(n-1));


	A = n-1;
	B = 0;
	ans = min(ans, temp + abs(A-x) + abs(B-y));
	temp += 1;
	A = n-2;
	B = arr[A];
	ans = min(ans, temp + abs(A-x) + abs(B-y));

	cout << ans << endl;




}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 26
• Subtask 4: 11 / 11
• Subtask 5: 0 / 44