# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
606314 | krit3379 | Fancy Fence (CEOI20_fancyfence) | C++17 | 56 ms | 12524 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>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 100005
int n;
long long t[4*N],mi[4*N],h[N],w[N],qs[N],m,pos,mod=1e9+7,ans;
void cre(int x,int l,int r){
if(l==r){t[x]=l,mi[x]=h[l];return ;}
int mid=(l+r)/2;
cre(x*2,l,mid);
cre(x*2+1,mid+1,r);
if(mi[x*2]<mi[x*2+1])t[x]=t[x*2];
else t[x]=t[x*2+1];
mi[x]=min(mi[x*2],mi[x*2+1]);
}
void query(int x,int l,int r,int ll,int rr){
if(l>rr||ll>r||ll>rr)return ;
if(ll<=l&&r<=rr){
if(mi[x]<m)m=mi[x],pos=t[x];
return ;
}
int mid=(l+r)/2;
query(x*2,l,mid,ll,rr);
query(x*2+1,mid+1,r,ll,rr);
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |