# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
80393 | Plurm | Board (CEOI13_board) | C++11 | 1080 ms | 1136 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;
char a[100005];
char b[100005];
class holder : public vector<bool> {
public:
vector<int> hsh;
inline int ghash(){
return size() <= 20 ? -1 : hsh[size()-21];
}
inline int to_int(){
int v = 1;
for(int i = max((int)size()-20,0); i < size(); i++){
v *= 2;
if(at(i)) v++;
}
return v;
}
void push_back(bool b){
vector<bool>::push_back(b);
if(hsh.empty()) hsh.push_back(b ? 1 : 0);
else hsh.push_back((53*hsh.back() + (b ? 1 : 0)) % 1000003);
}
void pop_back(){
vector<bool>::pop_back();
hsh.pop_back();
}
};
inline void mmove(holder& x,char y){
int i;
switch(y){
case '1':
x.push_back(false);
break;
case '2':
x.push_back(true);
break;
case 'U':
x.pop_back();
break;
case 'L':
for(i = x.size()-1; i >= 0; i--){
if(x[i]){
x[i] = false;
break;
}else{
x[i] = true;
}
}
for(; i < x.size(); i++){
if(i == 0) x.hsh[i] = x[i] ? 1 : 0;
else x.hsh[i] = (x.hsh[i-1]*53 + (x[i] ? 1 : 0)) % 1000003;
}
break;
case 'R':
for(i = x.size()-1; i >= 0; i--){
if(x[i]){
x[i] = false;
}else{
x[i] = true;
break;
}
}
for(; i < x.size(); i++){
if(i == 0) x.hsh[i] = x[i] ? 1 : 0;
else x.hsh[i] = (x.hsh[i-1]*53 + (x[i] ? 1 : 0)) % 1000003;
}
break;
}
}
inline int glv(int x){
int l = 0;
while(x > 1){
x /= 2;
l++;
}
return l;
}
pair<int,int> mem[100005];
int main(){
gets(a);
gets(b);
if(strlen(a) < strlen(b)){
for(int i = 0; i < 100005; i++){
swap(a[i],b[i]);
}
}
holder ma;
holder mb;
for(int i = 0; a[i]; i++){
mmove(ma,a[i]);
}
int lla = ma.size();
while(!ma.empty()){
mem[ma.size()] = make_pair(ma.ghash(),ma.to_int());
ma.pop_back();
}
for(int i = 0; b[i]; i++){
mmove(mb,b[i]);
}
int llb = mb.size();
int d = 1e9;
while(!mb.empty()){
if(mb.ghash() == mem[mb.size()].first){
d = min(d,(int)(lla - mb.size() + llb - mb.size() + abs(mb.to_int() - mem[mb.size()].second)));
}
mb.pop_back();
}
printf("%d\n",d);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |