# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796741 | amirhoseinfar1385 | Abracadabra (CEOI22_abracadabra) | C++17 | 311 ms | 33504 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;
const int maxn=200000+10;
int n,q;
int all[maxn],res[maxn],link[maxn];
set<int>st,salam;
void solve(int v){
st.clear();
st.insert(n+1);
salam.clear();
salam.insert(n+1);
for(int i=1;i<=n;i++){
link[all[i]]=i;
}
int now=n;
int ted=n/2;
for(int i=n;i>=1;i--){
//<<i<<endl;
auto x=*st.lower_bound(link[i]);
auto y=*salam.upper_bound(link[i]);
x=min(x,y);
if(x==link[i])
{
continue;
}
int len=x-link[i];
int z=0,ft=ted;
if(ted>0){
int f=min((len-1)/ted,v);
z=len-f*ted;
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... |