Submission #1137644

#TimeUsernameProblemLanguageResultExecution timeMemory
1137644Jawad_Akbar_JJText editor (CEOI24_editor)C++20
5 / 100
0 ms328 KiB
#include <iostream> using namespace std; const int N = 1e6 + 10; int l[N]; int n, a, b, c, d; void solve1(int n){ if (a == c and b == d){ cout<<0<<'\n'; exit(0); } if (a == 1 and c == 1){ int Ans = abs(d - b); if (b < d) Ans = min(Ans, 2 + l[1] + 1 - d); else Ans = min(Ans, 1 + d); cout<<Ans<<'\n'; } else if (c == 2) cout<<1<<'\n'; else cout<<min(d, l[1] + 1 - d + 1)<<'\n'; exit(0); } int main(){ cin>>n>>a>>b>>c>>d; for (int i=1;i<=n;i++) cin>>l[i]; if (n <= 2) solve1(n); }
#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...