Submission #1137485

#TimeUsernameProblemLanguageResultExecution timeMemory
1137485AbdullahIshfaqText editor (CEOI24_editor)C++20
0 / 100
0 ms396 KiB
#include <bits/stdc++.h> using namespace std; #define ll int #define MOD 1000000007 const ll lg = 18, N = 1e5 + 10; ll sp[N][lg]; void solve() { ll n, s1, e1, s2, e2; cin >> n >> s1 >> e1 >> s2 >> e2; vector<ll> sz(n + 1); for(int i = 1; i <= n ;i ++){ cin >> sz[i]; } ll mn = e1; if(s1 <= s2){ for(int i = s1 + 1; i <= s2; i ++){ mn = min(mn, sz[i] + 1); } } else{ for(int i = s1 - 1; i >= s2; i --){ mn = min(mn, sz[i] + 1); } } ll ans = abs(mn - e2); if(s2 != 1){ ans = min(ans, mn + 1 + abs(min(sz[s2] + 1, sz[s2 - 1] + 1) - e2)); } cout << abs(s1 - s2) + ans << '\n'; } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int tests = 1; // cin >> tests; for (int i = 1; i <= tests; i++) { solve(); } }
#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...