oj.uz

Submission #1053754

# Submission time Handle Problem Language Result Execution time Memory
1053754 2024-08-11T16:58:32 Z n1k Text editor (CEOI24_editor) C++17
5 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

#if defined(LOCAL)
#include "debug.cpp"
#else
#define debug(x...) 0
#endif // LOCAL

using namespace std;

using ll = long long;

#define all(a) (a).begin(), (a).end()

void solve(){
	ll n, sr, sc, er, ec; cin >> n >> sr >> sc >> er >> ec;
	vector<ll> l(n), emin(n), smin(n);
	for(int i=0; i<n; i++) cin >> l[i];
	sr--, sc--, er--, ec--;

	emin[er]=l[er];
	smin[sr]=l[sr];
	for(int i=er+1; i<n; i++) emin[i]=min(emin[i-1], l[i]);
	for(int i=er-1; i>=0; i--) emin[i]=min(emin[i+1], l[i]);
	for(int i=sr+1; i<n; i++) smin[i]=min(smin[i-1], l[i]);
	for(int i=sr-1; i>=0; i--) smin[i]=min(smin[i+1], l[i]);

	ll ans = abs(er - sr) + abs(min(smin[er], sc) - ec);
	for(int r=0; r<n; r++){
		// mit to go to (r, 0) when not visiting (rr, 0)
		// left
		ll best = abs(r - sr) + min(smin[r], sc);
		// right
		if(r)
			best = min(best, abs((r-1) - sr) + l[r-1] - min(smin[r], sc));
		ll best2 = abs(r - er) + ec;
		if(er+1<n)
			best2=min(best2, abs(r - (er+1)) + l[er] - ec + 1);
		ans = min(ans, best + best2);
	}
	cout<<ans<<endl;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int t=1; //cin >> t;
	while(t--) solve();
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 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 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.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 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0.0 / 44.0

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