# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
624989 | andrei_boaca | 게임판 (CEOI13_board) | C++14 | 1081 ms | 1804 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
}
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';*/
vector<int> dif;
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.back()==0)
dif.pop_back();
if(dif.empty())
dif.push_back(0);
reverse(dif.begin(),dif.end());
while(dif.size())
{
if(dif.size()<=50)
{
ll x=0;
for(int i:dif)
x=x*2LL+i;
ans=min(ans,x+rez);
}
rez+=2;
dif.pop_back();
}
cout<<ans;
return 0;
}
컴파일 시 표준 에러 (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... |