# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129170 | mahmoudbadawy | Lamps (JOI19_lamps) | C++17 | 384 ms | 4912 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;
string a,b;
int n;
int dis[(1<<18)];
int conv(string s)
{
int res=0;
for(int i=0;i<s.size();i++)
res=res*2+(s[i]-'0');
return res;
}
int main()
{
cin >> n >> a >> b;
if(a==string(n,'0'))
{
int ans[2]={b[0]=='0',b[0]=='1'};
for(int i=1;i<b.size();i++)
{
if(b[i]!=b[i-1])
ans[b[i]-'0']++;
}
cout << min(ans[1],1+ans[0]) << endl;
return 0;
}
queue<int> q;
q.push(conv(a));
int bb=conv(b);
memset(dis,-1,sizeof dis);
dis[conv(a)]=0;
while(q.size())
{
int s=q.front(); q.pop();
if(s==bb) break;
for(int i=0;i<n;i++)
{
int sd=s;
for(int j=i;j<n;j++)
{
sd&=(~(1<<j));
if(dis[sd]!=-1) continue;
dis[sd]=dis[s]+1;
q.push(sd);
}
}
for(int i=0;i<n;i++)
{
int sd=s;
for(int j=i;j<n;j++)
{
sd|=(1<<j);
if(dis[sd]!=-1) continue;
dis[sd]=dis[s]+1;
q.push(sd);
}
}
for(int i=0;i<n;i++)
{
int sd=s;
for(int j=i;j<n;j++)
{
sd^=(1<<j);
if(dis[sd]!=-1) continue;
dis[sd]=dis[s]+1;
q.push(sd);
}
}
}
cout << dis[bb] << endl;
}
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... |