Binary Strings Gym - 101845B

https://cn.vjudge.net/problem/Gym-101845B 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=5e5+9;
const int mod=1e9+7;

void ch(char &c,char &cc)
{
    if(c=='1') c='0';
    else c='1';

    if(cc=='1') cc='0';
    else cc='1';
}

int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);

    string s,t,tmp;
    cin>>s>>t;
    int len=s.length();

    int minn=INF;

    for(int i=0;i<len;i++)
    {
        //fl();
        tmp="";
        int st=i;
        for(int j=0;j<len;j++)
        {
            tmp+=s[st++];
            st%=len;
        }
        string tmp2=tmp;
        //cout<<tmp<<endl;

        int ans=0;
        for(int j=0;j<len-1;j++)
        {
            if(t[j]!=tmp[j])
            {
                ans++;
                ch(tmp[j],tmp[j+1]);
            }
        }
        //cout<<tmp<<endl;;
        if(t[len-1]!=tmp[len-1])
        {
            ans=INF;
        }
        minn=min(minn,ans);

        tmp=tmp2;
        ans=0;
        ch(tmp[0],tmp[len-1]);
        ans++;
        for(int j=0;j<len-1;j++)
        {
            if(t[j]!=tmp[j])
            {
                ans++;
                ch(tmp[j],tmp[j+1]);
            }
        }
        if(t[len-1]!=tmp[len-1])
        {
            ans=INF;
        }
        minn=min(minn,ans);

    }
    if(minn==INF) minn=-1;
    cout<<minn<<endl;


    return 0;
}