| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1137564 | SyedSohaib_123 | Text editor (CEOI24_editor) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define append push_back
#define int long long
const int N=2e5+10,LG=20;
int mod=1e9+7;
void solve(int tst) {
int n;
cin>>n;
int a,b,x,y;
cin>>a>>b>>x>>y;
vector<int>v(n+1,0);
for(int i=1;i<=n;i++){
cin>>v[i];
v[i]++;
}
if(n<=2){
if(a==x and x==1){
if(b>y){
cout<<min(b-y,v[1]-b+y+1);
}
else{
cout<<min(y-b,v[1]-y+2);
}
}
else if(x==2){
cout<<(a==1)<<endl;
}
else{
cout<<min(y,v[1]-y+1);
}
return;
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int t = 1;
// cin >> t;
for (int i = 0; i < t; i++) {
solve(i);
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
