Submission #1544340

---

Source Code Expand

#include <bits/stdc++.h>

#define FOR(i,b,e) for(int i=(b); i <= (e); ++i)
#define FORD(i,b,e) for(int i=(b); i >= (e); --i)
#define REP(i,n) for(int i=0; i < (n); ++i)
#define SIZE(c) (int) (c).size()
#define ALL(c) (c).begin(), (c).end()
#define PB push_back
#define MP make_pair
#define ST first
#define ND second
#define FWD(i,a,b) for (int i=(a); i<(b); ++i)
#define BCK(i,a,b) for (int i=(a); i>(b); --i)
#define PI 3.14159265358979311600
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

typedef vector < int > VI;
typedef vector<ll> VL;

typedef long double K;

const int inf = 1000 * 1000 * 1000 + 7;
const int N = 2005;

int n;
string a, b;
int lf[N], rt[N];
vector<int> g[N];
multiset<int> s;
int result = inf;

void solve() {
	REP(shift, n + 1) {
		REP(i, n + 1) g[i].clear();
		s.clear();
		int l, r;
		int here = shift;
		REP(i, n) {
			int pos = (i + shift) % n;
			if (!i) l = r = pos;
			if (b[pos] == '1') l = pos;
			while (b[r] != '1') r = (r+1) % n;
			while (b[l] != '1') l = (l-1+n) % n;
			lf[i] = l; rt[i] = r;
			if (r == pos) r = (r+1) % n;
			if (a[i] == b[pos]) continue;
			++here;
			int sl = (i - l) + (i < l ? n : 0);
			int sr = (r - i) + (r < i ? n : 0);
			if (sl <= shift) continue;
			g[sl - shift].push_back(sr);
			s.insert(sr);
		}
		int best = inf;
		REP(sh, n + 1) {
			for (auto& item : g[sh]) s.erase(s.find(item));
			int val = s.empty() ? 0 : (*s.begin());
			best = min(best, here + sh + val);
		}
		result = min(result, best);
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> a >> b;
	n = SIZE(a);
	int check = 0;
	REP(i, n) if (b[i] == '1') check |= 1;
	REP(i, n) if (a[i] == '1') check |= 2;
	if (check == 2) {
		cout << -1 << '\n';
		return 0;
	}
	if (!check) {
		cout << 0 << '\n';
		return 0;
	}

	REP(i, 2) {
		solve();
		// reverse(a.begin(), a.end());
		// reverse(b.begin(), b.end());
	}

	cout << result << '\n';

	return 0;
}

Submission Info

Judge Result