답안 #1053539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053539 2024-08-11T13:01:13 Z beaconmc Text editor (CEOI24_editor) C++14
0 / 100
0 ms 348 KB
#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 = arr[A];
		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 = 1;
	ans = min(ans, temp + abs(A-x) + abs(B-y));

	cout << ans << endl;




}
















# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -