# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
488370 | alexander707070 | Floppy (RMI20_floppy) | C++14 | 0 ms | 0 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;
string s;
void read_array (int subtask_id,vector<int> v){
for(int i=0;i<v.size();i++){
if(v[i]>=0)s.push_back('0');
else s.push_back('1');
v[i]=abs(v[i]);
for(int f=0;f<30;f++){
s.push_back(v[i]%2+'0');
v[i]/=2;
}
}
save_to_floppy(s);
}
int c[80007],p;
bool li[80007][20];
int dp[80007][20];
int power[20],lg[80007];
void calc(){
power[0]=1;
for(int i=1;i<20;i++)power[i]=power[i-1]*2;
lg[1]=0;
for(int i=2;i<=80000;i++)lg[i]=lg[i/2]+1;
}
int best(int x,int y){
if(c[x]<c[y])return x;
else return y;
}
int rmq(int i,int j){
if(j==0)return c[i];
if(li[i][j])return dp[i][j];
li[i][j]=true;
dp[i][j]=best(rmq(i,j-1),rmq(i+power[j-1],j-1));
return dp[i][j];
}
int mins(int l,int r){
return best( rmq(l,lg[r-l+1]) , rmq(r-power[lg[r-l+1]]+1,lg[r-l+1]) );
}
vector<int> ans;
vector<int> solve_queries(int subtask_id,int N,const string bits,const vector<int> a,const vector<int> b){
for(int i=0;i<bits.size();i+=31){
for(int f=i+1;f<=i+30;f++){
c[p]+=(bits[f]-'0');
c[p]*=2;
}
if(bits[i]=='1')c[p]*=-1;
p++;
}
calc();
for(int i=0;i<a.size();i++){
ans.push_back(mins(a[i],b[i]));
}
return ans;
}