oj.uz

Submission #1053551

# Submission time Handle Problem Language Result Execution time Memory
1053551 2024-08-11T13:09:43 Z beaconmc Text editor (CEOI24_editor) C++14
16 / 100
 213 ms 18984 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 = 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 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory 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 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 440 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 172 ms 15872 KB Output is correct
20 Correct 175 ms 15952 KB Output is correct
21 Correct 178 ms 16468 KB Output is correct
22 Correct 169 ms 15440 KB Output is correct
23 Correct 213 ms 18984 KB Output is correct

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -