# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596642 | definitelynotmee | Floppy (RMI20_floppy) | C++17 | 90 ms | 11384 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 <stdlib.h>
#include <string.h>
#include "floppy.h"
#include<bits/stdc++.h>
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;
void read_array(int subtask_id, const std::vector<int> &v) {
int n = v.size();
vector<int> jmp(n,-1);
string bits;
for(int i = 1; i < n; i++){
jmp[i] = i-1;
while(jmp[i]!=-1 && v[jmp[i]] < v[i])
jmp[i] = jmp[jmp[i]], bits.push_back('0');
bits.push_back('1');
}
save_to_floppy(bits);
}
std::vector<int> solve_queries(int subtask_id, int n,
const std::string &bits,
const std::vector<int> &a, const std::vector<int> &b) {
vector<int> answers(b.size());
vector<int> jmp(n,-1);
int ptr = 0;
for(int i = 1; i < n; i++){
jmp[i] = i-1;
while(true){
if(bits[ptr++] == '0'){
jmp[i] = jmp[jmp[i]];
} else break;
}
}
matrix<int> lift(20,vector<int>(n));
for(int i = 0; i < n; i++){
lift[0][i] = jmp[i];
}
for(int i = 1; i < 20; i++){
for(int j = 0; j < n; j++){
lift[i][j] = lift[i-1][lift[i-1][j]];
}
}
for(int i = 0; i < a.size(); i++){
int id = b[i];
for(int i = 19; i >= 0; i--){
if(lift[i][id] >= a[i])
id = lift[i][id];
}
answers[i] = id;
}
return answers;
}
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... |