# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625014 | andrei_boaca | Board (CEOI13_board) | C++14 | 225 ms | 1676 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;
typedef long long ll;
ll a,b;
string s;
vector<ll> val,va,vb;
void multiply()
{
ll lg=val.size();
int last=lg%2;
if(last==1)
val.push_back(1);
else
val[lg-1]++;
}
void divide()
{
ll lg=val.size();
int last=lg%2;
if(val[lg-1]==1)
val.pop_back();
else
val[lg-1]--;
}
void add()
{
ll lg=val.size();
int last=lg%2;
if(last==0)
{
if(val[lg-1]>1)
{
val[lg-1]--;
val.push_back(1);
}
else
{
val.pop_back();
lg--;
val[lg-1]++;
}
return;
}
else
{
ll nr1=val[lg-1];
ll nr0=val[lg-2];
val.pop_back();
val.pop_back();
lg-=2;
if(nr0==1)
{
val[lg-1]++;
val.push_back(nr1);
}
else
{
nr0--;
val.push_back(nr0);
val.push_back(1);
val.push_back(nr1);
}
}
}
void subtract()
{
int lg=val.size();
int last=lg%2;
if(last==1)
{
if(val[lg-1]==1)
{
lg--;
val.pop_back();
val[lg-1]++;
}
else
{
val[lg-1]--;
val.push_back(1);
}
return;
}
else
{
ll nr0=val[lg-1];
ll nr1=val[lg-2];
val.pop_back();
val.pop_back();
lg-=2;
if(nr1==1)
{
val[lg-1]++;
val.push_back(nr0);
}
else
{
nr1--;
val.push_back(nr1);
val.push_back(1);
val.push_back(nr0);
}
}
}
ll getniv(ll x)
{
for(ll d=0;d<=62;d++)
{
ll st=(1LL<<d);
ll dr=st*2LL-1;
if(x>=st&&x<=dr)
return d;
}
return -1;
}
vector<int> dif;
void getdif()
{
dif.clear();
dif.shrink_to_fit();
int t=0;
for(int i=va.size()-1;i>=0;i--)
{
int x=va[i]-t-vb[i];
t=0;
if(x<0)
{
x+=2;
t=1;
}
dif.push_back(x);
}
while(!dif.empty()&&dif.back()==0)
dif.pop_back();
if(dif.empty())
dif.push_back(0);
reverse(dif.begin(),dif.end());
}
int main()
{
cin>>s;
val.push_back(1);
for(char c:s)
{
if(c=='1')
multiply();
if(c=='2')
{
multiply();
add();
}
if(c=='U')
divide();
if(c=='L')
subtract();
if(c=='R')
add();
}
for(int i=0;i<val.size();i++)
{
if(i%2==0)
{
for(int j=1;j<=val[i];j++)
va.push_back(1);
}
else
{
for(int j=1;j<=val[i];j++)
va.push_back(0);
}
}
val.clear();
cin>>s;
val.push_back(1);
for(char c:s)
{
if(c=='1')
multiply();
if(c=='2')
{
multiply();
add();
}
if(c=='U')
divide();
if(c=='L')
subtract();
if(c=='R')
add();
}
for(int i=0;i<val.size();i++)
{
if(i%2==0)
{
for(int j=1;j<=val[i];j++)
vb.push_back(1);
}
else
{
for(int j=1;j<=val[i];j++)
vb.push_back(0);
}
}
ll rez=0;
ll ans=1e18;
if(va.size()<vb.size())
swap(va,vb);
while(va.size()>vb.size())
{
rez++;
va.pop_back();
}
bool need=0;
for(int i=0;i<va.size();i++)
if(va[i]!=vb[i])
{
if(va[i]<vb[i])
need=1;
break;
}
if(need)
swap(va,vb);
/*for(int i:va)
cout<<i;
cout<<'\n';
for(int i:vb)
cout<<i;
cout<<'\n';*/
getdif();
while(dif.size()>20)
{
dif.pop_back();
va.pop_back();
vb.pop_back();
rez+=2;
}
while(dif.size())
{
getdif();
ll x=0;
for(int i:dif)
x=x*2LL+i;
ans=min(ans,x+rez);
if(x==0)
break;
rez+=2;
va.pop_back();
vb.pop_back();
}
cout<<ans;
return 0;
}
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... |