Submission #1545376


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;
			if (r == (pos - 1 + n) % n) r = (r+1) % n;
			while (b[r] != '1') r = (r+1) % n;
			while (b[l] != '1') l = (l-1+n) % n;
			if (a[i] != b[pos]) ++here;
			int sl = (pos - l) + (pos < l ? n : 0);
			int sr = (r - pos) + (r < pos ? n : 0);
			lf[i] = sl; rt[i] = sr;
			if (sl <= shift || !sr || a[i] == b[pos]) 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.rbegin());
			best = min(best, here + 2*(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

Submission Time
Task D - Shift and Flip
User nobik
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2172 Byte
Status AC
Exec Time 622 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 4
AC × 54
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 1 ms 256 KB
subtask_1_04.txt AC 1 ms 256 KB
subtask_1_05.txt AC 142 ms 384 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 141 ms 384 KB
subtask_1_08.txt AC 1 ms 256 KB
subtask_1_09.txt AC 1 ms 256 KB
subtask_1_10.txt AC 2 ms 384 KB
subtask_1_11.txt AC 188 ms 384 KB
subtask_1_12.txt AC 175 ms 384 KB
subtask_1_13.txt AC 192 ms 384 KB
subtask_1_14.txt AC 470 ms 384 KB
subtask_1_15.txt AC 370 ms 384 KB
subtask_1_16.txt AC 282 ms 384 KB
subtask_1_17.txt AC 265 ms 384 KB
subtask_1_18.txt AC 216 ms 384 KB
subtask_1_19.txt AC 203 ms 384 KB
subtask_1_20.txt AC 198 ms 384 KB
subtask_1_21.txt AC 428 ms 384 KB
subtask_1_22.txt AC 428 ms 384 KB
subtask_1_23.txt AC 593 ms 512 KB
subtask_1_24.txt AC 622 ms 512 KB
subtask_1_25.txt AC 592 ms 512 KB
subtask_1_26.txt AC 2 ms 384 KB
subtask_1_27.txt AC 3 ms 384 KB
subtask_1_28.txt AC 14 ms 384 KB
subtask_1_29.txt AC 49 ms 384 KB
subtask_1_30.txt AC 196 ms 384 KB
subtask_1_31.txt AC 1 ms 256 KB
subtask_1_32.txt AC 2 ms 384 KB
subtask_1_33.txt AC 3 ms 384 KB
subtask_1_34.txt AC 13 ms 384 KB
subtask_1_35.txt AC 52 ms 384 KB
subtask_1_36.txt AC 202 ms 384 KB
subtask_1_37.txt AC 2 ms 384 KB
subtask_1_38.txt AC 3 ms 384 KB
subtask_1_39.txt AC 13 ms 384 KB
subtask_1_40.txt AC 50 ms 384 KB
subtask_1_41.txt AC 207 ms 384 KB
subtask_1_42.txt AC 206 ms 384 KB
subtask_1_43.txt AC 205 ms 384 KB
subtask_1_44.txt AC 206 ms 384 KB
subtask_1_45.txt AC 204 ms 384 KB
subtask_1_46.txt AC 206 ms 384 KB