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;
map<string,int> dis;
map<string,string > st;
int main()
{
cin >> n >> a >> b;
queue<string> q;
q.push(a);
dis[a]=0;
while(q.size())
{
string s=q.front(); q.pop();
if(s==b) break;
for(int i=0;i<n;i++)
{
string sd=s;
for(int j=i;j<n;j++)
{
sd[j]='0';
if(dis.count(sd)) continue;
dis[sd]=dis[s]+1;
st[sd]=s;
q.push(sd);
}
}
for(int i=0;i<n;i++)
{
string sd=s;
for(int j=i;j<n;j++)
{
sd[j]='1';
if(dis.count(sd)) continue;
dis[sd]=dis[s]+1;
st[sd]=s;
q.push(sd);
}
}
for(int i=0;i<n;i++)
{
string sd=s;
for(int j=i;j<n;j++)
{
sd[j]=(1-(s[j]-'0'))+'0';
if(dis.count(sd)) continue;
dis[sd]=dis[s]+1;
st[sd]=s;
q.push(sd);
}
}
}
cout << dis[b] << endl;
}
# | 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... |