# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
859959 | MateiKing80 | 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>
#include "floppy.h"
using namespace std;
int lift[20][400002];
int st[400002];
void read_array(int subtask_id, const vector<int> &v) {
string bits = "";
stack<int> st;
for(auto i : v)
{
while(st.size() && st.top() < i)
{
bits += "1";
st.pop();
}
st.push(i) = i;
bits += "0";
}
save_to_floppy(bits);
}
vector<int> solve_queries(int subtask_id, int N, const string &bits, const vector<int> &a, const vector<int> &b)
{
int n = N, m = a.size();
int vf = 0;
int pos = 0;
for(int i = 1; i <= n; i++)
{
while(bits[pos] == '1')
{
vf--;
pos++;
}
lift[0][i] = st[vf];
st[++vf] = i;
pos++;
}
for(int i = 1; i < 20; i++)
{
for(int j = 1; j <= n; j++)
lift[i][j] = lift[i-1][lift[i-1][j]];
}
vector<int> ans;
for(int i = 0; i < m; i++)
{
int l = a[i], r = b[i];
l++, r++;
int id = r;
for(int j = LMAX-1; j >= 0; j--)
{
if(lift[j][id] >= l)
id = lift[j][id];
}
ans.push_back(id-1);
}
return ans;
}