# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095326 | epicci23 | Text editor (CEOI24_editor) | C++17 | 827 ms | 464724 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;
const int INF = 1e18;
void _(){
int n,a,b,c,d;
cin >> n >> a >> b >> c >> d;
vector<int> pre(n+5),suf(n+5),ar(n+5);
int Sparse[n+5][20];
for(int i=1;i<=n;i++){
cin >> ar[i];
ar[i]++;
Sparse[i][0]=ar[i];
}
for(int j=1;j<20;j++){
for(int i=1;i+(1<<j)-1<=n;i++){
Sparse[i][j]=min(Sparse[i][j-1],Sparse[i+(1<<(j-1))][j-1]);
}
}
auto Get=[&](int l,int r)->int {
if(l>r) swap(l,r);
int k=__lg(r-l+1);
return min(Sparse[l][k],Sparse[r-(1<<k)+1][k]);
};
# | 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... |