Language: C++

#ifndef __MINMAX_H__
#define __MINMAX_H__

/* updated: 2020-08-02 */

#include <algorithm>
#include <functional>

/* 
// 最小値と最大値をビット演算の演算子オーバーロードで表記できるようにするクラス
// 演算子 | が max, 演算子 & が min を表す
// (扱うときは暗黙の型変換とオーバーロード解決に注意)
*/
template <class T, class Pred = std::less<T>>
class MinMax {
	T value_m = T();

public:
	MinMax() = default;
	MinMax(const T& value);
	MinMax(const MinMax<T, Pred>& other) = default;

	MinMax<T, Pred>& operator=(const T& value);
	MinMax<T, Pred>& operator=(const MinMax<T, Pred>& other) = default;

	MinMax<T, Pred>& operator|=(const T& other);
	MinMax<T, Pred>& operator&=(const T& other);

	operator T() const;
};

template <class T, class Pred>
MinMax<T, Pred> operator|(const MinMax<T, Pred>& a, const MinMax<T, Pred>& b);
template <class T, class Pred>
MinMax<T, Pred> operator&(const MinMax<T, Pred>& a, const MinMax<T, Pred>& b);
template <class T, class Pred, class U>
MinMax<T, Pred> operator|(const MinMax<T, Pred>& a, const U& b);
template <class T, class Pred, class U>
MinMax<T, Pred> operator&(const MinMax<T, Pred>& a, const U& b);
template <class T, class Pred, class U>
MinMax<T, Pred> operator|(const U& a, const MinMax<T, Pred>& b);
template <class T, class Pred, class U>
MinMax<T, Pred> operator&(const U& a, const MinMax<T, Pred>& b);

template<class T, class Pred>
MinMax<T, Pred>::MinMax(const T& value)
	: value_m(value) {
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator=(const T& value) {
	value_m = value;
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator|=(const T& other) {
	value_m = std::max(value_m, other, Pred());
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator&=(const T& other) {
	value_m = std::min(value_m, other, Pred());
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>::operator T() const {
	return value_m;
}

template<class T, class Pred>
MinMax<T, Pred> operator|(const MinMax<T, Pred>& a, const MinMax<T, Pred>& b) {
	MinMax<T, Pred> ret(a);
	ret |= b;
	return ret;
}

template<class T, class Pred>
MinMax<T, Pred> operator&(const MinMax<T, Pred>& a, const MinMax<T, Pred>& b) {
	MinMax<T, Pred> ret(a);
	ret &= b;
	return ret;
}

template<class T, class Pred, class U>
MinMax<T, Pred> operator|(const MinMax<T, Pred>& a, const U& b) {
	return a | MinMax<T, Pred>(b);
}

template<class T, class Pred, class U>
MinMax<T, Pred> operator&(const MinMax<T, Pred>& a, const U& b) {
	return a & MinMax<T, Pred>(b);
}

template<class T, class Pred, class U>
MinMax<T, Pred> operator|(const U& a, const MinMax<T, Pred>& b) {
	return MinMax<T, Pred>(a) | b;
}

template<class T, class Pred, class U>
MinMax<T, Pred> operator&(const U& a, const MinMax<T, Pred>& b) {
	return MinMax<T, Pred>(a) & b;
}

using MMInt = MinMax<int>;
using MMLL = MinMax<long long int>;
using MMDouble = MinMax<double>;

#endif
#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h&& j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "Interpolation.h"
#include "IntMod.h"
#include "KDTree.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "List.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

const int MX = 2000;
using Bits = bitset<MX>;
int n;

void print(Bits a) {
	REM(i, 0, n) {
		cout << a[i];
	}
}

MMInt dl[2000];
MMInt dr[2000];
int sub(Bits a, Bits b) {
	Fill(dl, INF);
	Fill(dr, INF);
	REP(i, 0, n) {
		if (b[i]) {
			dl[i] = 0;
			dr[i] = 0;
		}
	}

	REP(z, 0, 2) {
		dl[0] &= dl[n - 1] + 1;
		REP(i, 1, n) {
			dl[i] &= dl[i - 1] + 1;
		}
	}

	REP(z, 0, 2) {
		dr[n - 1] &= dr[0] + 1;
		REM(i, 1, n) {
			dr[i - 1] &= dr[i] + 1;
		}
	}

	vector<PP> v;
	REP(i, 0, n) {
		if (a[i]) {
			v.push_back(PP(dl[i], dr[i]));
		}
	}
	v.push_back(PP(0, INF));
	v.push_back(PP(INF, 0));
	sort(v);

	vector<PP> w;
	for (PP q : v) {
		while (true) {
			if (w.empty()) break;
			auto p = w.back();
			if (p.second > q.second) break;
			w.pop_back();
		}
		w.push_back(q);
	}

	MMInt mn = INF;
	REP(i, 1, w.size()) {
		PP p = w[i - 1];
		PP q = w[i];
		mn &= 2 * (p.first + q.second);
	}
	return mn;
}

int main() {
	string s = Next<string>();
	string t = Next<string>();
	n = s.size();
	Bits a(s);
	Bits b(t);

	MMInt mn = INF;
	{
		Bits cur = b;
		Bits par;
		REP(i, 0, n) {
			par |= cur;
			mn &= sub(a ^ cur, par) + (a ^ cur).count() + i;
			bool tmp = cur[n - 1];
			cur <<= 1;
			cur[0] = tmp;
			if (n < MX) cur[n] = false;
		}
	}
	{
		Bits cur = b;
		Bits par;
		REP(i, 0, n) {
			par |= cur;
			mn &= sub(a ^ cur, par) + (a ^ cur).count() + i;
			bool tmp = cur[0];
			cur >>= 1;
			cur[n - 1] = tmp;
		}
	}
	cout << (mn == INF ? -1 : mn) << endl;
	return 0;
}



Compiler output:
a.cc: In function 'int sub(Bits, Bits)':
a.cc:275:13: error: no matching function for call to 'sort(std::vector<std::pair<long int, long int> >&)'
  275 |         sort(v);
      |         ~~~~^~~
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:6:
/usr/include/c++/14/bits/stl_algo.h:4762:5: note: candidate: 'template<class _RAIter> void std::sort(_RAIter, _RAIter)'
 4762 |     sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
      |     ^~~~
/usr/include/c++/14/bits/stl_algo.h:4762:5: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/bits/stl_algo.h:4793:5: note: candidate: 'template<class _RAIter, class _Compare> void std::sort(_RAIter, _RAIter, _Compare)'
 4793 |     sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
      |     ^~~~
/usr/include/c++/14/bits/stl_algo.h:4793:5: note:   candidate expects 3 arguments, 1 provided
In file included from /usr/include/c++/14/algorithm:86:
/usr/include/c++/14/pstl/glue_algorithm_defs.h:292:1: note: candidate: 'template<class _ExecutionPolicy, class _RandomAccessIterator, class _Compare> __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void> std::sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare)'
  292 | sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp);
      | ^~~~
/usr/include/c++/14/pstl/glue_algorithm_defs.h:292:1: note:   candidate expects 4 arguments, 1 provided
/usr/include/c++/14/pstl/glue_algorithm_defs.h:296:1: note: candidate: 'template<class _ExecutionPolicy, class _RandomAccessIterator> __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void> std::sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator)'
  296 | sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last);
      | ^~~~
/usr/include/c++/14/pstl/glue_algorithm_defs.h:296:1: note:   candidate expects 3 arguments, 1 provided
a.cc: In function 'int main()':
a.cc:328:28: error: operands to '?:' have different types 'int' and 'MMInt' {aka 'MinMax<int>'}
  328 |         cout << (mn == INF ? -1 : mn) << endl;
      |                  ~~~~~~~~~~^~~~~~~~~
a.cc:328:28: note:   and each type can be converted to the other