text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i, count = 0, ans = 0, c0 = 0, c1 = 0;
cin >> n;
string s, t, st = "";
cin >> s >> t;
for (i = 0; i < n; i++) {
if (s[i] != t[i]) {
st += s[i];
if (s[i] == '1')
count++;
else
count--;
}
}
if (count != 0)
cout << -1;
else if (st.length() == 0)
cout << 0;
else {
ans = 0;
for (i = 1; i < st.length(); i++) {
if (st[i] == '1') {
if (c0 > 0)
c0--;
else
ans++;
c1++;
} else {
if (c1 > 0)
c1--;
else
ans++;
c0++;
}
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> start, targ;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
string s, t;
cin >> s >> t;
int s_0 = 0, s_1 = 0, t_0 = 0, t_1 = 0;
for (auto &x : s) {
if (x == '0') {
start.push_back(0);
s_0++;
} else {
start.push_back(1);
s_1++;
}
}
for (auto &x : t) {
if (x == '0') {
targ.push_back(0);
t_0++;
} else {
targ.push_back(1);
t_1++;
}
}
if (s_0 != t_0 || s_1 != t_1) {
cout << -1 << '\n';
return 0;
}
set<int> zero_one, one_zero;
for (int i = 0; i < n; i++) {
if (s[i] == '0' && t[i] == '1') zero_one.insert(i);
if (s[i] == '1' && t[i] == '0') one_zero.insert(i);
}
int ans = 0;
while (!zero_one.empty()) {
ans++;
int beg1 = *zero_one.begin(), beg2 = *one_zero.begin();
bool is_begin_1_0, cur_1_0;
int cur_ind = min(beg1, beg2);
if (beg1 < beg2) {
is_begin_1_0 = false;
cur_1_0 = false;
} else {
is_begin_1_0 = true;
cur_1_0 = true;
}
vector<int> changes{cur_ind};
while (true) {
if (cur_1_0) {
auto it = zero_one.upper_bound(cur_ind);
if (it == zero_one.end())
break;
else {
cur_ind = *it;
changes.push_back(cur_ind);
cur_1_0 = !cur_1_0;
}
} else {
auto it = one_zero.upper_bound(cur_ind);
if (it == one_zero.end())
break;
else {
cur_ind = *it;
changes.push_back(cur_ind);
cur_1_0 = !cur_1_0;
}
}
}
if (is_begin_1_0 == cur_1_0) {
changes.pop_back();
}
for (auto &x : changes) {
zero_one.erase(x);
one_zero.erase(x);
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int inf = 1e9;
const int mo = 998244353;
int main() {
int n, c1 = 0, c2 = 0;
string s1, s2;
cin >> n >> s1 >> s2;
vector<int> vec;
for (auto i = (1); i <= (n); ++i) {
if (s1[i - 1] != s2[i - 1]) vec.push_back(s1[i - 1]);
if (s1[i - 1] == '1') c1++;
if (s2[i - 1] == '1') c2++;
}
if (c1 != c2) {
cout << "-1";
return 0;
}
int cnt0 = 0, cnt1 = 0, ans = 0;
for (auto i = (1); i <= (vec.size()); ++i) {
int cur = vec[i - 1] - '0';
if (cur) {
if (cnt0) {
cnt0--;
cnt1++;
} else {
cnt1++;
ans++;
}
} else {
if (cnt1) {
cnt1--;
cnt0++;
} else {
cnt0++;
ans++;
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
#pragma optimize("O3")
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e9 + 47;
const int base = 2e5 + 1;
const long long MAX = 1e6 + 1;
const double EPS = 1e-9;
const double PI = acos(-1.);
const int MAXN = 5000 + 47;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
int sum = 0, mx = 0, mn = 0, res = 0;
for (int i = (0); i < (n); ++i) {
if (s[i] != t[i]) {
if (s[i] == '1')
sum++;
else
sum--;
res = max(res, abs(sum - mn));
res = max(res, abs(mx - sum));
mx = max(mx, sum);
mn = min(mn, sum);
}
}
if (sum != 0)
cout << -1;
else
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
const long long int MOD = 1e9 + 7;
const long long int MOD1 = 998244353;
const long long int N = 2e5 + 5;
const long long int INF = 1000111000111000111LL;
const long double EPS = 1e-12;
const long double PI = 3.141592653589793116;
string s, t;
vector<long long int> v;
int32_t main() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
cin >> s >> t;
long long int c1 = 0, c2 = 0;
for (long long int i = 0; i < n; i++) {
if (s[i] == '1' && t[i] == '0') {
c1++;
v.push_back(1);
}
if (s[i] == '0' && t[i] == '1') {
c2++;
v.push_back(2);
}
}
if (s == t) {
return cout << 0, 0;
}
if (c1 != c2) return cout << -1, 0;
if (c1 == 0) {
return cout << 0, 0;
}
long long int ans = 0;
set<long long int> s1, s2;
for (long long int i = (0); i < ((long long int)((v).size())); i++) {
if (v[i] == 1)
s1.insert(i);
else
s2.insert(i);
}
long long int Tc = c1;
while (Tc--) {
long long int init = *s1.begin();
vector<long long int> v1, v2;
for (auto it = s1.begin(); it != s1.end();) {
auto nt = s2.upper_bound(*it);
if (nt == s2.end()) {
if (*s2.begin() > *s1.begin()) break;
v2.push_back(*s2.begin());
v1.push_back(*it);
break;
}
v2.push_back(*nt);
v1.push_back(*it);
it = s1.upper_bound(*nt);
}
if ((long long int)((v1).size())) {
ans++;
} else {
break;
}
for (auto it : v1) s1.erase(it);
for (auto it : v2) s2.erase(it);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, end0 = 0, end1 = 0, ans = 0, zs1 = 0, zs2 = 0, i;
string s1, s2;
cin >> n;
cin >> s1 >> s2;
for (i = 0; i < n; i++) {
if (s1[i] == '0') zs1++;
if (s2[i] == '0') zs2++;
}
if (zs1 != zs2) {
cout << "-1\n";
return 0;
}
for (i = 0; i < n; i++) {
if (s1[i] != s2[i]) {
if (s1[i] == '0') {
if (end1 == 0) {
end0++;
ans++;
} else {
end1--;
end0++;
}
} else {
if (end0 == 0) {
end1++;
ans++;
} else {
end0--;
end1++;
}
}
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a[1000005];
string s, t;
long long max_sum_subarray(long long x) {
long long cur = 0, ret = 0;
for (long long i = 0; i < n; i++) {
cur += x * a[i];
ret = max(ret, cur);
if (cur < 0) cur = 0;
}
return ret;
}
void solve() {
cin >> n >> s >> t;
long long sum = 0;
for (long long i = 0; i < n; i++) {
if (s[i] != t[i]) {
if (s[i] == '1')
a[i] = 1;
else
a[i] = -1;
}
sum += a[i];
}
if (sum) {
cout << -1 << endl;
return;
}
long long ans = max(max_sum_subarray(1), max_sum_subarray(-1));
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long tt;
tt = 1;
while (tt--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, cur, Max, Min;
char s[1000015], t[1000015];
int main() {
scanf("%d", &n);
scanf("%s%s", s + 1, t + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == t[i]) continue;
if (t[i] == '0')
cur--;
else
cur++;
Max = max(Max, cur);
Min = min(Min, cur);
}
if (cur != 0)
printf("-1");
else
printf("%d", Max - Min);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
cout << x << endl;
exit(0);
}
using ll = long long;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 5;
void check(string s, string t) {
sort(s.begin(), s.end());
sort(t.begin(), t.end());
if (s != t) out(-1);
}
int n;
int a[maxn], b[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s, t;
cin >> n >> s >> t;
check(s, t);
for (int i = 0; i < n; i++) {
a[i] = (s[i] == '1');
b[i] = (t[i] == '1');
}
vector<int> v;
for (int i = 0; i < n; i++) {
if (a[i] == 0 && b[i] == 1) {
v.push_back(0);
} else if (a[i] == 1 && b[i] == 0) {
v.push_back(1);
}
}
vector<int> last(2, 0);
for (int i : v) {
if (last[i ^ 1] == 0) {
last[i ^ 1]++;
}
last[i ^ 1]--;
last[i]++;
}
cout << last[0] + last[1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j = 0, k = 0, n, x = 0, y = 0, z = 0, ans = 0;
cin >> n;
string s, t;
cin >> s >> t;
int a[n];
for (i = 0; i < n; i++) {
if (s[i] != t[i]) {
if (s[i] == '1')
a[i] = 1;
else
a[i] = -1;
} else
a[i] = 0;
if (s[i] == '1') x++;
if (t[i] == '1') z++;
}
if (x != z)
cout << "-1";
else {
for (i = 0; i < n; i++) {
k = k + a[i];
if (k < 0) k = 0;
ans = max(ans, k);
}
k = 0;
for (i = 0; i < n; i++) {
k = k + (-1) * a[i];
if (k < 0) k = 0;
ans = max(ans, k);
}
cout << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
long long int i, j, a, b, n, x, y, z, t, k, sum, sum1;
vector<long long int> v, v1;
string s, s1;
unordered_map<long long int, long long int> m, m1;
unordered_map<long long int, vector<long long int>> m3;
t = 1;
while (t--) {
cin >> n >> s >> s1;
sum = 0;
sum1 = 0;
k = 0;
y = 0;
x = 0;
a = 0;
for (i = 0; i < n; i++) {
if (s[i] == '0' && s1[i] == '1') {
k++;
y--;
sum++;
} else if (s[i] == '1' && s1[i] == '0') {
k--;
y++;
sum1++;
}
x = max(x, k);
x = max(x, y);
k = max(k, a);
y = max(y, a);
}
if (sum != sum1) {
cout << "-1" << endl;
} else {
cout << x << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
long long ret = n % m;
if (ret < 0) ret += m;
return ret;
}
long long gcd(long long a, long long b) {
return (b == 0LL ? a : gcd(b, a % b));
}
long long exp(long long a, long long b, long long m) {
if (b == 0LL) return 1LL;
if (b == 1LL) return mod(a, m);
long long k = mod(exp(a, b / 2, m), m);
if (b & 1LL) {
return mod(a * mod(k * k, m), m);
} else
return mod(k * k, m);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
string s, t;
cin >> s >> t;
vector<long long> cnt(2);
for (long long i = 0; i < n; i++) {
cnt[s[i] - '0']++;
}
for (long long i = 0; i < n; i++) cnt[t[i] - '0']--;
if (cnt[0] != 0 or cnt[1] != 0) {
cout << -1 << "\n";
return 0;
}
long long t1 = 0, t2 = 0;
long long turn = 0;
long long res = 0;
vector<long long> v;
long long zer = 0, um = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == t[i]) continue;
if (s[i] == '0') {
if (um)
um--, zer++;
else
zer++, res++;
} else {
if (zer)
zer--, um++;
else
res++, um++;
}
}
cout << res << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
namespace io {
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
template <class I>
inline void fr(I &num) {
num = 0;
register char c = nc();
register int p = 1;
while (c < '0' || c > '9') c == '-' ? p = -1, c = nc() : c = nc();
while (c >= '0' && c <= '9') num = num * 10 + c - '0', c = nc();
num *= p;
}
template <class I>
inline I Max(I p, I q) {
return p > q ? p : q;
}
template <class I>
inline I Min(I p, I q) {
return p < q ? p : q;
}
template <class I>
inline I A(I x) {
return x < 0 ? -x : x;
}
template <class I>
inline void sp(I &p, I &q) {
I x = p;
p = q, q = x;
}
template <class I>
inline void ckMax(I &p, I q) {
p = (p > q ? p : q);
}
template <class I>
inline void ckMin(I &p, I q) {
p = (p < q ? p : q);
}
}; // namespace io
using io ::A;
using io ::ckMax;
using io ::ckMin;
using io ::fr;
using io ::Max;
using io ::Min;
using io ::nc;
using io ::sp;
const int N = 1000005;
int T, n, ans1, ans2;
char s[N], t[N];
int main() {
scanf("%d%s%s", &n, s + 1, t + 1);
register int i, now = 0, cn0 = 0, cn1 = 0;
for (i = 1; i <= n; ++i)
cn0 += (s[i] == '0'), cn0 -= (t[i] == '0'), cn1 += (s[i] == '1'),
cn1 -= (t[i] == '1');
if (cn0 || cn1) return puts("-1"), 0;
for (i = 1; i <= n; ++i) {
if (s[i] != t[i]) now += (s[i] == '0' ? 1 : -1);
ans1 = Max(ans1, now), ans2 = Min(ans2, now);
}
printf("%d", ans1 - ans2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
int n;
string a, b;
vector<pair<int, int>> f;
void insert(pair<int, int> u) {
if (int((f).size()) and f.back().first == u.first) {
f.back().second += u.second;
} else if (u.second) {
f.push_back(u);
}
}
void fix() {
if (f.back().first == f[0].first) {
f[0].second += f.back().second;
f.pop_back();
}
}
void solve() {
fix();
vector<pair<int, int>> g(f);
f.clear();
for (auto &u : g) {
u.second -= 1, insert(u);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
int ca = 0, cb = 0;
for (int i = (0); i < (n); ++i) {
ca += a[i] - '0';
cb += b[i] - '0';
if (a[i] != b[i]) {
insert(make_pair(a[i] - '0', 1));
}
}
if (ca != cb) {
cout << "-1\n";
} else {
int res = 0;
while (int((f).size())) {
solve();
res += 1;
}
cout << res << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int is_prime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return 0;
}
return 1;
}
int find_min(int a[], int left, int right, int elems) {
int low = 1, high = 1000000009, ans;
while (low <= high) {
int mid = (low + high) / 2;
int taken = 0;
for (int i = left; i <= right; i++) {
if (a[i] <= mid) {
taken++;
i++;
}
if (taken >= elems) break;
}
if (taken >= elems) {
ans = mid;
high = mid - 1;
} else {
low = mid + 1;
}
}
return ans;
}
int main() {
string s, t;
int n, sone = 0, tone = 0;
cin >> n;
cin >> s;
cin >> t;
string sdiff = "";
for (int i = 0; i < n; i++) {
if (s[i] == '1') sone++;
if (t[i] == '1') tone++;
if (s[i] != t[i]) sdiff += s[i];
}
if (sone != tone)
cout << -1 << endl;
else {
int len = sdiff.length();
int sum = 0;
int maxm = 0;
int minm = 0, ans1 = 0, ans2 = 0;
for (int i = 0; i < len; i++) {
if (sdiff[i] == '1')
sum++;
else
sum--;
minm = min(minm, sum);
maxm = max(maxm, sum - minm);
ans1 = maxm;
}
sum = 0;
maxm = 0;
minm = 0;
for (int i = 0; i < len; i++) {
if (sdiff[i] == '0')
sum++;
else
sum--;
minm = min(minm, sum);
maxm = max(maxm, sum - minm);
ans2 = maxm;
}
cout << max(ans1, ans2) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const int N = 1e6 + 6, mod = 998244353, M = 1e9 + 7;
const long long MAX = 5e18;
int n, c, ans, mn;
string s, t;
vector<int> v;
int main() {
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
v.push_back(s[i] == '0' ? 1 : -1);
c += v.back();
}
}
if (c) return puts("-1");
c = v.size();
for (int i = 0; i < c; i++) v.push_back(v[i]);
c = 0;
for (int i : v) {
c += i;
mn = min(c, mn);
ans = max(ans, c - mn);
}
ans = max(ans, abs(c));
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b > a) {
return gcd(b, a);
}
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long expo(long long a, long long b, long long mod) {
long long res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b = b >> 1;
}
return res;
}
vector<int> sieve(int n) {
int *arr = new int[n + 1]();
vector<int> vect;
for (int i = 2; i <= n; i++)
if (arr[i] == 0) {
vect.push_back(i);
for (int j = 2 * i; j <= n; j += i) arr[j] = 1;
}
return vect;
}
void extendgcd(long long a, long long b, long long *v) {
if (b == 0) {
v[0] = 1;
v[1] = 0;
v[2] = a;
return;
}
extendgcd(b, a % b, v);
long long x = v[1];
v[1] = v[0] - v[1] * (a / b);
v[0] = x;
return;
}
long long mminv(long long a, long long b) {
long long arr[3];
extendgcd(a, b, arr);
return arr[0];
}
long long mminvprime(long long a, long long b) { return expo(a, b - 2, b); }
bool revsort(long long a, long long b) { return a > b; }
void swap(int &x, int &y) {
int temp = x;
x = y;
y = temp;
}
long long combination(long long n, long long r, long long m, long long *fact) {
long long val1 = fact[n];
long long val2 = mminvprime(fact[r], m);
long long val3 = mminvprime(fact[n - r], m);
return ((val1 * val2) % m * val3) % m;
}
bool comp;
bool helper(long long value, long long *arr, long long k, int start, int end) {
long long count = 0;
int i = start;
while (i <= end) {
if (arr[i] <= value) {
count++;
i += 2;
} else
i++;
}
if (count >= k)
return true;
else
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
string a, b;
cin >> a >> b;
int count1 = 0;
int count2 = 0;
int count3 = 0;
int count4 = 0;
for (int i = 0; i < n; i++) {
if (a[i] == '0')
count1++;
else
count2++;
if (b[i] == '0')
count3++;
else
count4++;
}
if (count1 != count3 || count2 != count4)
cout << -1 << endl;
else {
int ans2 = 0;
int ans1 = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] == '0' && b[i] == '1') {
ans2++;
ans1--;
}
if (a[i] == '1' && b[i] == '0') {
ans2--;
ans1++;
}
if (ans1 <= 0) ans1 = 0;
if (ans2 <= 0) ans2 = 0;
ans = max(ans, max(ans1, ans2));
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
string s, t;
cin >> n >> s >> t;
vector<int> zero, one;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) (s[i] == '0') ? zero.push_back(i) : one.push_back(i);
}
if (zero.size() != one.size()) {
cout << "-1\n";
} else {
int z = 0, o = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1' && s[i] != t[i]) {
if (z) z--;
o++;
} else if (s[i] == '0' && s[i] != t[i]) {
if (o) o--;
z++;
}
}
cout << o + z << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
t = 1;
for (int I = 1; I <= t; I++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char ch = getchar();
int f = 1, x = 0;
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return f * x;
}
int n;
string s;
string t;
int main() {
while (cin >> n) {
cin >> s >> t;
int sum = 0;
int ma = 0, mi = 0;
for (int i = 0; i <= (n - 1); i++) {
sum += s[i] - '0';
sum -= t[i] - '0';
ma = max(ma, sum);
mi = min(mi, sum);
}
int ans;
if (sum != 0)
ans = -1;
else
ans = ma - mi;
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LONGINF = 9223372036854775807;
const long long MOD = 998244353;
string s, t;
set<int> change0, change1;
void solve() {
int n;
cin >> n >> s >> t;
for (int i = 0; i < n; ++i) {
if (s[i] != t[i] && s[i] == '0')
change0.insert(i);
else if (s[i] != t[i])
change1.insert(i);
}
if (change0.size() != change1.size()) {
cout << -1 << '\n';
return;
}
int res = 0;
while (!change0.empty()) {
++res;
if (*change0.begin() > *change1.begin()) change0.swap(change1);
int current = *change0.begin();
while (true) {
auto it0 = change0.lower_bound(current);
if (it0 == change0.end()) break;
auto it1 = change1.lower_bound(*it0);
if (it1 == change1.end()) break;
change0.erase(it0);
current = *it1;
change1.erase(it1);
}
}
cout << res << '\n';
}
signed main() {
cin.tie(0);
cout.tie(0);
std::ios_base::sync_with_stdio(0);
bool mult = false;
if (mult) {
int t;
cin >> t;
while (t--) solve();
} else
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000000 + 3];
int msa(int first) {
int mx = 0, cur = 0;
for (int i = 0; i < n; ++i) {
cur += first * a[i];
mx = max(mx, cur);
cur = max(0, cur);
}
return mx;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string s, t;
cin >> n;
cin >> s >> t;
int sum = 0;
for (int i = 0; i < n; ++i) {
if (s[i] != t[i]) {
if (s[i] == '1')
a[i] = 1;
else
a[i] = -1;
}
sum += a[i];
}
if (sum != 0) {
cout << -1 << '\n';
return 0;
}
cout << max(msa(1), msa(-1)) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
int ct = 0;
for (int q = 0; q < n; q++) {
if (s[q] == '0') {
ct++;
}
if (t[q] == '0') {
ct--;
}
}
if (ct != 0) {
cout << "-1\n";
return 0;
}
vector<int> diff;
for (int q = 0; q < n; q++) {
if (s[q] != t[q]) {
diff.push_back(s[q] - '0');
}
}
int sz = diff.size();
if (sz == 0) {
cout << "0\n";
return 0;
}
int cur = diff[0];
int ct1 = 1;
vector<int> distinct;
for (int q = 1; q < sz; q++) {
if (diff[q] == cur) {
ct1++;
} else {
distinct.push_back(ct1);
ct1 = 1;
cur = diff[q];
}
}
distinct.push_back(ct1);
int ans = INT_MIN;
int tot = 0;
int dsz = distinct.size();
set<int> pref;
pref.insert(0);
for (int q = 0; q < distinct.size(); q++) {
if (q % 2 == 0) {
tot += distinct[q];
} else {
tot -= distinct[q];
}
if (tot < 0) {
ans = max(ans, abs(tot - *pref.rbegin()));
} else {
ans = max(ans, tot - *pref.begin());
}
pref.insert(tot);
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int ll_MAX = 1e18 + 5;
const long long int MOD = 1e9 + 7;
long long int fast_expo(long long int x, long long int p) {
if (p == 0)
return 1;
else if (p % 2 == 0) {
long long int t = fast_expo(x, p / 2) % MOD;
return (t * t) % MOD;
} else
return (x * (fast_expo(x, p - 1)) % MOD) % MOD;
}
long long int gcd(long long int a, long long int b) {
if (a == 0 || b == 0)
return a + b;
else
return gcd(b % a, a);
}
bool check(long long int arr[], long long int s, long long int e,
long long int val, long long int num) {
long long int cnt = 0;
for (long long int i = s; i <= e; ++i) {
if (arr[i] <= val) {
cnt++;
i++;
}
}
if (cnt >= num) return true;
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long int t_c;
t_c = 1;
for (long long int t_i = 0; t_i < t_c; ++t_i) {
long long int n;
cin >> n;
string s, t;
cin >> s >> t;
long long int cnt = 0;
for (auto i : s) {
if (i == '0') cnt++;
}
for (auto i : t) {
if (i == '0') cnt--;
}
if (cnt != 0) {
cout << -1;
return 0;
}
string str;
for (long long int i = 0; i < n; ++i) {
if (s[i] != t[i]) {
str.push_back(s[i]);
}
}
if (str.size() == 0) {
cout << 0;
return 0;
}
long long int curr0 = 0, curr1 = 0;
vector<long long int> vect;
for (auto i : str) {
if (i == '0') {
curr0++;
if (curr1 != 0) vect.push_back(curr1);
curr1 = 0;
} else {
curr1++;
if (curr0 != 0) vect.push_back(-curr0);
curr0 = 0;
}
}
if (curr1) vect.push_back(curr1);
if (curr0) vect.push_back(-curr0);
if (vect.size() == 0) {
cout << 0 << "\n";
return 0;
}
long long int ans = 0;
vector<long long int> vect2;
while (1) {
ans++;
if (vect[vect.size() - 1] * vect[0] < 0) {
for (long long int i = 0; i < vect.size(); ++i) {
if (vect[i] > 1) {
if (vect2.size() > 0 && vect2[vect2.size() - 1] > 0) {
long long int val = vect2[vect2.size() - 1];
vect2.pop_back();
vect2.push_back(val + vect[i] - 1);
} else
vect2.push_back(vect[i] - 1);
} else if (vect[i] < -1) {
if (vect2.size() > 0 && vect2[vect2.size() - 1] < 0) {
long long int val = vect2[vect2.size() - 1];
vect2.pop_back();
vect2.push_back(val + vect[i] + 1);
} else
vect2.push_back(vect[i] + 1);
}
}
} else {
for (long long int i = 0; i < vect.size() - 1; ++i) {
if (vect[i] > 1) {
if (vect2.size() > 0 && vect2[vect2.size() - 1] > 0) {
long long int val = vect2[vect2.size() - 1];
vect2.pop_back();
vect2.push_back(val + vect[i] - 1);
} else
vect2.push_back(vect[i] - 1);
} else if (vect[i] < -1) {
if (vect2.size() > 0 && vect2[vect2.size() - 1] < 0) {
long long int val = vect2[vect2.size() - 1];
vect2.pop_back();
vect2.push_back(val + vect[i] + 1);
} else
vect2.push_back(vect[i] + 1);
}
}
if (vect[vect.size() - 1] > 0) {
if (vect2.size() > 0 && vect2[vect2.size() - 1] > 0) {
long long int val = vect2[vect2.size() - 1];
vect2.pop_back();
vect2.push_back(val + vect[vect.size() - 1]);
} else
vect2.push_back(vect[vect.size() - 1]);
} else if (vect[vect.size() - 1] < 0) {
if (vect2.size() > 0 && vect2[vect2.size() - 1] < 0) {
long long int val = vect2[vect2.size() - 1];
vect2.pop_back();
vect2.push_back(val + vect[vect.size() - 1]);
} else
vect2.push_back(vect[vect.size() - 1]);
}
}
if (vect2.size() == 0) break;
vect = vect2;
vect2.clear();
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
set<long long> zz;
set<long long> oo;
int main() {
ios::sync_with_stdio(false);
cin >> n;
string s1, s2;
cin >> s1 >> s2;
long long tot1z = 0, tot11 = 0;
long long tot2z = 0, tot21 = 0;
for (int i = 0; i < s1.length(); i++) {
if (s1[i] == '0') {
tot1z++;
} else {
tot11++;
}
if (s2[i] == '0') {
tot2z++;
} else
tot21++;
if (s1[i] != s2[i]) {
if (s1[i] == '0')
zz.insert(i);
else
oo.insert(i);
}
}
if (tot21 != tot11 || tot1z != tot2z) {
cout << -1 << endl;
return 0;
}
long long tot = 0;
while (!oo.empty() && !zz.empty()) {
tot++;
long long sto = *oo.begin();
long long stz = *zz.begin();
if (sto < stz) {
long long b = sto;
while (!oo.empty() && !zz.empty()) {
if (oo.lower_bound(b) != oo.end()) {
long long d = *oo.lower_bound(b);
if (zz.lower_bound(d) != zz.end()) {
long long x = *zz.lower_bound(d);
oo.erase(d);
zz.erase(x);
b = x;
} else
break;
} else
break;
}
} else {
long long b = stz;
while (!oo.empty() && !zz.empty()) {
if (zz.lower_bound(b) != zz.end()) {
long long d = *zz.lower_bound(b);
if (oo.lower_bound(d) != oo.end()) {
long long x = *oo.lower_bound(d);
zz.erase(d);
oo.erase(x);
b = x;
} else
break;
} else
break;
}
}
}
cout << tot << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n;
string a, b;
int main() {
ios::sync_with_stdio(false);
cin >> n >> a >> b;
string s;
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
s += a[i];
}
}
if (((int)(s).size()) & 1) {
cout << -1 << '\n';
return 0;
}
if (!((int)(s).size())) {
cout << 0 << '\n';
return 0;
}
set<int> A, B;
for (int i = 0; i < ((int)(s).size()); i++)
if (s[i] == '0')
A.insert(i);
else
B.insert(i);
int ans = 0;
while (((int)(A).size())) {
ans++;
set<int>& x = (*A.begin() < *B.begin()) ? A : B;
set<int>& y = (*A.begin() < *B.begin()) ? B : A;
int last = -1;
while (((int)(x).size())) {
auto itx = x.lower_bound(last);
if (itx == x.end()) break;
auto ity = y.lower_bound(*itx);
if (ity == y.end()) break;
last = *ity;
x.erase(itx);
y.erase(ity);
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long q;
q = 1;
while (q--) {
long long n;
cin >> n;
string a, b;
cin >> a >> b;
vector<bool> mm(n, 0);
long long type1 = 0;
long long type2 = 0;
long long ans = 0;
long long count = 0;
for (long long i = 0; i < n; ++i)
if (a[i] != b[i]) {
count++;
if (a[i] == '1') {
if (type2 != 0) type2--;
type1++;
} else {
if (type1 != 0) type1--;
type2++;
}
}
if (count % 2)
cout << -1 << endl;
else
cout << type1 + type2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct lex_compare {
public:
bool operator()(const pair<long long, long long>& lhs,
const pair<long long, long long>& rhs) const {
if (lhs.second == rhs.second) return lhs.first < rhs.first;
return (lhs.second > rhs.second);
}
};
class trp {
public:
long long a, b, c;
trp() {
this->a = 0;
this->b = 0;
this->c = 0;
}
trp(long long a, long long b, long long c) {
this->a = a;
this->b = b;
this->c = c;
}
};
class node {
public:
long long index, a, l;
long long d, h;
node* mr_img;
node* lf = NULL;
node* rt = NULL;
node* prt = NULL;
vector<node*> v;
node() {
index = 0, a = 0, l = 0;
d = 1, h = 0;
mr_img = NULL;
lf = NULL;
rt = NULL;
prt = NULL;
}
void adn(node* t) {
v.push_back(t);
this->l++;
}
};
node* nnd(long long a) {
node* t = new node();
t->a = a;
return t;
}
long long pw(long long a, long long b, long long m) {
if (b == 0) return 1;
if (b % 2 == 0) return (pw(a, b / 2, m) * pw(a, b / 2, m)) % m;
return (a * ((pw(a, b / 2, m) * pw(a, b / 2, m)) % m)) % m;
}
long long gc(long long a, long long b) {
if (b == 0) return a;
return gc(b, a % b);
}
vector<string> splt(string x, char w) {
vector<string> v;
string s;
int l = x.length();
for (int i = 0; i < l; i++) {
if (x[i] == w) {
v.push_back(s);
s = "";
} else {
s.push_back(x[i]);
}
}
v.push_back(s);
return v;
}
void ioe() {
freopen("in_3.txt", "r", stdin);
freopen("out_3.txt", "w", stdout);
freopen("er_3.txt", "w", stderr);
}
void solve() {
long long n, c = 0, l = 0, l1 = 0, l2 = 0;
string s1, s2;
cin >> n >> s1 >> s2;
for (int i = 0; i < n; i++) {
if (s1[i] == '1') c++;
if (s2[i] == '1') c--;
}
if (c != 0) {
cout << "-1\n";
return;
}
vector<long long> s;
for (int i = 0; i < n; i++) {
if (s1[i] == '1' && s2[i] == '0')
s.push_back(1), l++;
else if (s2[i] == '1' && s1[i] == '0')
s.push_back(0), l++;
}
if (l == 0) {
cout << "0\n";
return;
}
long long m1 = 1, c1 = 0, c2 = 0;
for (int i = 0; i < 2 * l; i++) {
if (s[i % l] == 0)
c2++, c1--;
else
c2--, c1++;
;
c1 = max(0ll, c1);
c2 = max(0ll, c2);
m1 = max(m1, max(c2, c1));
}
m1 = max(m1, max(c1, c2));
cout << m1 << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long t = 1;
long long f = t;
while (f--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
string s, t;
map<long long, long long> mp;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
cin >> s >> t;
string ss = s, tt = t;
sort(ss.begin(), ss.end());
sort(tt.begin(), tt.end());
if (ss != tt) {
cout << -1 << endl;
return 0;
}
string tmp;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) tmp += s[i];
}
s = tmp;
if (s.size() == 0) {
cout << 0 << endl;
return 0;
}
long long cnt = 1, id = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1])
cnt++;
else {
mp[id++] = cnt;
cnt = 1;
}
}
if (cnt > 0) mp[id] = cnt;
long long ans = 0;
while (mp.size()) {
ans++;
for (auto it = mp.begin(); it != mp.end(); it++) {
auto suc = it;
suc++;
if (suc != mp.end())
it->second--;
else {
if (mp.size() % 2 == 0) it->second--;
}
}
for (auto it = mp.begin(); it != mp.end();) {
if (it->second == 0) {
auto cur = it;
auto suc = it;
suc++;
if (it != mp.begin() && suc != mp.end()) {
it--;
it->second += suc->second;
mp.erase(suc);
mp.erase(cur);
it++;
} else {
it++;
mp.erase(cur);
}
} else
it++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while (!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
__attribute__((unused)) int idx,
__attribute__((unused)) int LINE_NUM) {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if (idx > 0)
cerr << ", ";
else
cerr << "Line(" << LINE_NUM << ") ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
template <class T>
bool ckmin(T& a, T& b) {
bool r = a > b;
a = min(a, b);
return r;
}
template <class T>
bool ckmax(T& a, T& b) {
bool r = a < b;
a = max(a, b);
return r;
}
const int MOD = 1e9 + 7;
const long long INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string second, t;
cin >> second >> t;
int cnts = 0;
int cntt = 0;
for (int i = 0; i < n; i++) {
if (second[i] == '1') cnts++;
if (t[i] == '1') cntt++;
}
if (cnts != cntt) {
cout << -1 << '\n';
;
return 0;
}
int currP = 0;
int currN = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (second[i] != t[i]) {
if (second[i] == '1') {
currP = max(1, currP + 1);
currN = min(1, currN + 1);
} else {
currP = max(-1, currP - 1);
currN = min(-1, currN - 1);
}
}
ans = max(ans, currP);
ans = max(ans, -currN);
}
cout << ans << '\n';
;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = long double;
const int mod = 1e9 + 7;
const int inf = 1e9 + 11;
const ll INF = 2e18;
const int N = 2e6 + 66;
const int M = 5005;
string s, t;
int a[N], b[N];
set<int> pos[2];
void solve() {
int n;
cin >> n >> s >> t;
for (int i = 1; i <= n; ++i) {
a[i] = (s[i - 1] == '1');
b[i] = (t[i - 1] == '1');
if (a[i] != b[i]) {
pos[a[i]].insert(i);
}
}
sort(s.begin(), s.end());
sort(t.begin(), t.end());
if (s != t) {
cout << -1;
return;
}
int cnt = 0;
while (pos[0].size() && pos[1].size()) {
int now = *pos[0].begin(), type = 0;
if (now > *pos[1].begin()) {
now = *pos[1].begin();
type = 1;
}
pos[type].erase(now);
type ^= 1;
int cur = 1;
while (pos[type].size() && *pos[type].rbegin() >= now) {
auto p = pos[type].lower_bound(now);
now = *p;
pos[type].erase(p);
type ^= 1;
cur ^= 1;
}
if (cur) {
type ^= 1;
pos[type].insert(now);
}
++cnt;
}
if (pos[0].size() || pos[1].size()) {
cout << -1;
return;
}
cout << cnt;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
int tt = 1;
while (tt--) {
solve();
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, ans;
string S, T;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
set<int> s[2];
cin >> n >> S >> T;
for (int i = 0; i < n; ++i) {
if (S[i] == '1' && T[i] == '0')
s[1].insert(i);
else if (S[i] == '0' && T[i] == '1')
s[0].insert(i);
}
if (s[1].size() != s[0].size()) {
cout << -1;
return 0;
}
while (1) {
int curr = -1, ok = 0;
if (s[0].empty() && s[1].empty()) break;
if (s[0].empty() || s[1].empty()) {
ans += max(s[0].size(), s[1].size());
break;
}
++ans;
if (*s[1].begin() < *s[0].begin()) ok ^= 1;
while (1) {
auto it = s[ok].lower_bound(curr);
if (it == s[ok].end())
break;
else {
curr = *it;
s[ok].erase(it);
ok ^= 1;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
char x[N], y[N];
int c[N];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
cin >> (x + 1) >> (y + 1);
int a = 0, b = 0, cnt = 0;
for (int i = 1; i <= n; i++) {
if (x[i] == '1') a++;
if (y[i] == '1') b++;
if (x[i] != y[i]) {
if (x[i] == '0')
c[++cnt] = 0;
else
c[++cnt] = 1;
}
}
if (a != b)
cout << -1 << endl;
else {
int num = 0, mx1 = 0, mx0 = 0;
for (int i = 1; i <= cnt; i++) {
if (c[i]) {
if (mx0)
mx0--, mx1++;
else
num++, mx1++;
} else {
if (mx1)
mx1--, mx0++;
else
num++, mx0++;
}
}
cout << num << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<long long>;
using vpi = vector<pair<long long, long long>>;
using pi = pair<long long, long long>;
const long long nax = 1e6 + 7;
const long long mod = 1e9 + 7;
const long long inf = numeric_limits<long long>::max() - (long long)1e3;
long long n, m;
long long cnt[2], swp[2];
void test() {
cin >> n;
string s, t;
cin >> s >> t;
for (long long i = 0; i < (long long)(long long)s.size(); i++) {
if (s[i] == t[i]) continue;
long long curr = s[i] - '0';
cnt[curr]++;
if (swp[1 - curr]) swp[1 - curr]--;
swp[curr]++;
}
cout << (cnt[0] == cnt[1] ? swp[0] + swp[1] : -1);
}
signed main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
long long T = 1;
while (T--) {
test();
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, mini, maxi, ert;
string a, b;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
if (a[i] == '1' && b[i] == '0') ert++, maxi = max(maxi, ert);
if (a[i] == '0' && b[i] == '1') ert--, mini = min(mini, ert);
}
if (ert)
cout << -1 << "\n";
else
cout << maxi - mini << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long N = 1e6 + 15;
vector<long long> A(N, 0);
long long n;
long long kadane(long long x) {
long long maxi = 0, cur = 0;
for (long long i = 0; i < n; i++) {
cur += x * A[i];
maxi = max(maxi, cur);
if (cur < 0) cur = 0;
}
return maxi;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n;
string s, t;
cin >> s >> t;
long long s0 = 0, s1 = 0, t0 = 0, t1 = 0;
string str = "";
for (long long i = 0; i < n; i++) {
if (s[i] != t[i]) {
if (s[i] == '1')
A[i] = -1;
else
A[i] = 1;
str += s[i];
}
if (s[i] == '0') s0++;
if (s[i] == '1') s1++;
if (t[i] == '0') t0++;
if (t[i] == '1') t1++;
}
if (t0 != s0)
cout << -1;
else {
cout << max(kadane(1), kadane(-1));
}
return 0;
}
|
#include <bits/stdc++.h>
template <class T>
inline void read(T &x) {
x = 0;
register char c = getchar();
register bool f = 0;
while (!isdigit(c)) f ^= c == '-', c = getchar();
while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
if (f) x = -x;
}
using namespace std;
int n, m, ans;
string s, t, c, w;
struct node {
int next, val;
} e[2000006];
int a[1000006];
int main() {
cin >> n;
cin >> s;
cin >> t;
int rs = 0, rt = 0, flag = 1;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
flag = 0;
break;
}
}
if (flag) {
cout << "0" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
if (s[i] == '1') {
rs++;
}
if (t[i] == '1') {
rt++;
}
}
if (rs != rt) {
cout << "-1" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
c += s[i];
m++;
}
}
while (m > 0) {
w = "";
int len = m;
int i;
if (c[c.size() - 1] == '1' && c[0] == '0') {
i = 1;
m -= 2;
while (i < c.size() - 1) {
if (i + 1 >= c.size() - 1) {
w += c[i];
break;
}
if (c[i] == '1' && c[i + 1] == '0') {
i += 2;
m -= 2;
} else {
w += c[i];
i++;
}
}
} else {
i = 0;
while (i < c.size()) {
if (i + 1 >= c.size()) {
w += c[i];
break;
}
if (c[i] == '1' && c[i + 1] == '0') {
i += 2;
m -= 2;
} else {
w += c[i];
i++;
}
}
}
c = w;
ans++;
if (len - 2 == m) {
ans += m / 2;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
string S, T;
int count_ones(string& s) {
int cnt = 0;
for (int i = 0; i < N; i++)
if (s[i] == '1') cnt++;
return cnt;
}
int main() {
cin >> N >> S >> T;
if (count_ones(S) != count_ones(T)) {
cout << -1 << endl;
return 0;
}
int mx = 0, mn = 0, c = 0;
for (int i = 0; i < N; i++)
if (S[i] != T[i]) {
if (S[i] == '0') {
c++;
mx = max(mx, c);
} else {
c--;
mn = min(mn, c);
}
}
cout << (mx - mn) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, m, ans;
int cnt0, cnt1;
char a[N], b[N];
int c[N];
int main() {
cin >> n;
int cnt1 = 0, cnt2 = 0;
scanf("%s", a + 1);
scanf("%s", b + 1);
for (int i = 1; i <= n; i++)
if (a[i] == '1') cnt1++;
for (int i = 1; i <= n; i++)
if (b[i] == '1') cnt2++;
if (cnt1 != cnt2) {
cout << -1;
return 0;
}
for (int i = 1; i <= n; i++) {
if (a[i] != b[i]) c[++m] = a[i] - 48;
}
cnt0 = cnt1 = 0;
for (int i = 1; i <= m; i++) {
if (c[i] == 1) {
if (cnt0 > 0)
cnt0--;
else
ans++;
cnt1++;
} else {
if (cnt1 > 0)
cnt1--;
else
ans++;
cnt0++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mod1 = 1e16 + 7;
const double tiaohe = 0.57721566490153286060651209;
long long oula(long long x) {
long long res = x;
for (register int i = 2; i <= x / i; ++i) {
if (x % i == 0) {
res = res / i * (i - 1);
while (x % i == 0) x /= i;
}
}
if (x > 1) res = res / x * (x - 1);
return res;
}
long long quickmod(long long a, long long n, long long m) {
long long s = 1;
while (n) {
if (n & 1) {
s = s * a % m;
}
a = (a * a) % m;
n = n / 2;
}
return s;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void ex_gcd(long long a, long long b, long long &x, long long &y,
long long &d) {
if (!b) {
d = a, x = 1, y = 0;
} else {
ex_gcd(b, a % b, y, x, d);
y -= x * (a / b);
}
}
long long inv(long long t, long long p) {
long long d, x, y;
ex_gcd(t, p, x, y, d);
return d == 1 ? (x % p + p) % p : -1;
}
bool isPrime(long long x) {
if (x == 2) return true;
if (x % 2 == 0) return false;
for (long long i = 2; i * i <= x; i++)
if (x % i == 0) return false;
return true;
}
double eqa = (1 + sqrt(5.0)) / 2.0;
const int N = 6e5 + 5;
int t;
int main() {
int n;
string a, b;
cin >> n >> a >> b;
vector<int> v;
int sum1 = 0, sum2 = 0;
for (register int i = 0; i <= a.size() - 1; ++i) {
if (a[i] == '1') sum1++;
if (b[i] == '1') sum2++;
if (a[i] != b[i]) {
if (a[i] == '1')
v.emplace_back(1);
else
v.emplace_back(0);
}
}
if (sum1 != sum2)
puts("-1");
else {
int z = 0, o = 0;
int ans = 0;
for (auto I : v) {
if (I == 1) {
if (z)
z--, o++;
else
o++, ans++;
} else {
if (o)
o--, z++;
else
z++, ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, t, k;
vector<long long> a(1000000);
int main() {
string s, t;
cin >> n;
cin >> s >> t;
if (count((s).begin(), (s).end(), '0') !=
count((t).begin(), (t).end(), '0')) {
cout << -1 << endl;
exit(0);
}
for (long long i = 0; i < n; i++)
if (s[i] == t[i]) s[i] = 'x';
stack<int> vals[2];
for (long long i = 0; i < n; i++) {
if (s[i] != 'x') {
int v = s[i] - '0';
if (vals[1 - v].empty())
vals[v].push(i);
else {
vals[v].push(vals[1 - v].top());
vals[1 - v].pop();
}
}
}
cout << vals[0].size() + vals[1].size() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long int inf64 = 1e18 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, i;
cin >> n;
string ss, t;
cin >> ss >> t;
int c0 = 0, c1 = 0;
for (i = 0; i < n; i++) {
if (ss[i] == '0')
c0++;
else
c1++;
}
for (i = 0; i < n; i++) {
if (t[i] == '0')
c0--;
else
c1--;
}
if (c0 != 0 || c1 != 0)
cout << -1;
else {
set<int> second[2];
for (i = 0; i < n; i++) {
if (ss[i] != t[i]) {
if (ss[i] == '0')
second[0].insert(i);
else
second[1].insert(i);
}
}
int ans = 0;
while (!second[0].empty() && !second[1].empty()) {
if (*second[0].begin() < *second[1].begin()) {
int curr = -1;
while (!second[0].empty() && !second[1].empty()) {
auto it2 = second[0].upper_bound(curr);
if (it2 == second[0].end()) break;
int x = *it2;
auto it = second[1].upper_bound(x);
if (it == second[1].end()) break;
curr = *it;
second[0].erase(it2);
second[1].erase(it);
}
} else {
int curr = -1;
while (!second[0].empty() && !second[1].empty()) {
auto it2 = second[1].upper_bound(curr);
if (it2 == second[1].end()) break;
int x = *it2;
auto it = second[0].upper_bound(x);
if (it == second[0].end()) break;
curr = *it;
second[1].erase(it2);
second[0].erase(it);
}
}
++ans;
}
cout << ans << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long power(long long a, long long b) {
if (b == 0) return 1;
long long res = power(a, b / 2);
long long ans = res * res;
if (b % 2 == 0) return ans;
return a * ans;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
string s, t;
cin >> s >> t;
const int N = 1e6 + 5;
bitset<N> b1(s), b2(t), b3;
if (b1.count() != b2.count()) {
cout << -1 << "\n";
return 0;
}
int ones = b1.count();
int ans = min(ones, n - ones);
b3 = b1 & b2;
int common_ones = b3.count();
ans = min(ans, ones - common_ones);
string x = "";
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
x += s[i];
}
}
int len = x.size();
if (!len) {
cout << 0 << "\n";
return 0;
}
int cnt = 0;
int z = 0, o = 0;
for (int i = 0; i < len; i++) {
if (x[i] == '0') {
if (o) o--;
z++;
} else {
if (z) z--;
o++;
}
}
cnt = o + z;
ans = min(ans, cnt);
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n;
string s, t;
cin >> n >> s >> t;
long long sum = 0;
long long sum1 = 0;
long long sum0 = 0;
long long mx0 = 0;
long long mx1 = 0;
for (long long i = 1; i <= n; i++) {
if (s[i - 1] != t[i - 1]) {
if (s[i - 1] == '1') {
sum1++;
sum0--;
sum++;
} else {
sum0++;
sum1--;
sum--;
}
mx0 = max(mx0, sum0);
mx1 = max(mx1, sum1);
if (sum0 < 0) sum0 = 0;
if (sum1 < 0) sum1 = 0;
}
}
if (sum != 0) {
cout << -1;
return 0;
}
long long ans = max(mx0, mx1);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n;
std::cin >> n;
std::string s, t;
std::cin >> s >> t;
std::set<int> a[2];
for (int i = 0; i < n; ++i)
if (s[i] != t[i]) a[s[i] - '0'].insert(i);
if (a[0].size() != a[1].size()) {
std::cout << -1 << '\n';
return 0;
}
int r = 0;
while (a[0].size()) {
++r;
int i = -1, j = (*a[1].begin() < *a[0].begin());
for (;;) {
auto it = a[j].upper_bound(i);
if (it == a[j].end()) break;
auto jt = a[j ^ 1].upper_bound(*it);
if (jt == a[j ^ 1].end()) break;
i = *jt;
a[j].erase(it);
a[j ^ 1].erase(jt);
}
}
std::cout << r << '\n';
}
|
#include <bits/stdc++.h>
const int LIM = 1e5;
using namespace std;
int n, sum = 0, ans = -1;
string s, t;
vector<int> a;
int kadane(int sgn) {
int cur = 0, mx = 0;
for (int i = 0; i < n; i++) {
cur += sgn * a[i];
mx = max(mx, cur);
if (cur < 0) cur = 0;
}
return mx;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
cin >> s >> t;
a.assign(n, 0);
for (int i = 0; i < n; i++) {
if (s[i] != t[i])
if (s[i] == '1')
a[i] = -1;
else
a[i] = 1;
sum += a[i];
}
if (sum == 0) ans = max(kadane(1), kadane(-1));
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) { cout << "NEXT\n"; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ", ";
err(++it, args...);
}
template <typename... T>
void rd(T&... args) {
((cin >> args), ...);
}
template <typename... T>
void ps(T... args) {
((cout << args << ' '), ...);
cout << '\n';
}
const long long MOD = 1e9 + 7, MOD1 = 998244353LL, MAX = 1e6 + 5;
const char nl = '\n';
const int INF = 1e9 + 5;
int n;
string s, t;
void solve() {
cin >> n >> s >> t;
int ans = 0, q01 = 0, q10 = 0, t01 = 0, t10 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0' && t[i] == '1') {
t01++;
if (q10) {
q10--;
} else {
ans++;
}
q01++;
} else if (s[i] == '1' && t[i] == '0') {
t10++;
if (q01) {
q01--;
} else {
ans++;
}
q10++;
}
}
if (t10 != t01) {
cout << "-1\n";
return;
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int __ = 1;
while (__--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O2")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const int N = 1000005;
string S, T;
int n;
set<int> g[2];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cin >> n;
cin >> S;
cin >> T;
int o1 = 0, o2 = 0;
for (char c : S)
if (c == '1') o1++;
for (char c : T)
if (c == '1') o2++;
if (o1 != o2) {
cout << "-1\n";
return 0;
}
set<int> st;
for (int i = 0; i < n; i++) {
if (S[i] == T[i]) continue;
if (S[i] == '0') {
g[0].insert(i);
} else {
g[1].insert(i);
}
st.insert(i);
}
int moves = 0;
while (st.size() > 0) {
moves++;
int pos = *st.begin();
int id;
if (g[0].find(pos) != g[0].end())
id = 0;
else
id = 1;
while (1) {
st.erase(st.find(pos));
g[id].erase(g[id].find(pos));
id = (id + 1) % 2;
auto it = g[id].upper_bound(pos);
if (it == g[id].end()) break;
pos = *it;
}
}
cout << moves << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
long long inv_euclid(long long a, long long m = 998244353) {
long long m0 = m;
long long y = 0, x = 1;
if (m == 1) return 0;
while (a > 1) {
long long q = a / m;
long long t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) x += m0;
return x;
}
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long max(long long a, long long b) {
if (a > b) return a;
return b;
}
long long min(long long a, long long b) {
if (a < b) return a;
return b;
}
long long ssum(long long n) { return (n * (n + 1)) / 2; }
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / (gcd(a, b)); }
int main() {
long long n;
cin >> n;
string s, t;
cin >> s >> t;
long long sum = 0;
long long a[n];
for (long long i = 0; i < n; i++) {
if (s[i] == t[i])
a[i] = 0;
else if (s[i] == '1')
a[i] = 1;
else
a[i] = -1;
sum += a[i];
}
if (sum) {
cout << "-1";
return 0;
}
long long ans = 0;
for (long long i = 0; i < n; i++) {
sum = max(sum + a[i], a[i]);
ans = max(ans, sum);
}
long long aa = 0, ss = 0;
for (long long i = 0; i < n; i++) {
ss = min(ss + a[i], a[i]);
aa = min(aa, ss);
}
cout << max(ans, abs(aa)) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
long long res = 1;
while (y > 0) {
if (y & 1) res = (res * x) % 998244353;
y = y / 2;
if (y != 0) x = (x * x) % 998244353;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0, i, j, ct = 0, ans = 0, x, y;
cin >> n;
string s, t;
cin >> s >> t;
set<int> v, w;
for (i = 0; i < n; i++) {
if (s[i] == '0' && t[i] == '1') {
v.insert(i);
} else if (s[i] == '1' && t[i] == '0') {
w.insert(i);
}
if (s[i] == '1') c++;
if (t[i] == '1') ct++;
}
if (ct != c)
cout << "-1";
else {
if (v.size() == 0) {
cout << "0";
return 0;
}
int flag = 1;
while (v.size() || w.size()) {
if (flag) {
x = *v.begin();
y = *w.begin();
flag = 0;
v.erase(v.begin());
w.erase(w.begin());
}
if (x < y) {
auto it = v.lower_bound(y);
if (it == v.end()) {
ans++;
flag = 1;
} else {
x = *it;
auto it1 = w.lower_bound(x);
if (it1 == w.end()) {
ans++;
flag = 1;
} else {
v.erase(it);
y = *it1;
w.erase(it1);
}
}
} else {
auto it = w.lower_bound(x);
if (it == w.end()) {
ans++;
flag = 1;
} else {
y = *it;
auto it1 = v.lower_bound(y);
if (it1 == v.end()) {
ans++;
flag = 1;
} else {
x = *it1;
v.erase(it1);
w.erase(it);
}
}
}
}
if (flag == 0) ans++;
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const long long maxn = 1e6 + 5;
const double eps = 1e-7;
const double PI = acos(-1);
void std_quick_io() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
std_quick_io();
int n;
cin >> n;
string a, b;
cin >> a >> b;
if (a == b) {
cout << 0 << endl;
return 0;
}
if (count(a.begin(), a.end(), '0') != count(b.begin(), b.end(), '0')) {
cout << -1 << endl;
return 0;
}
string s = "";
for (int i = 0; i < n; i++) {
if (a[i] == '0' && b[i] == '1') {
s += "0";
} else if (a[i] == '1' && b[i] == '0') {
s += "1";
}
}
int ans = 1;
queue<int> q1, q0;
for (int i = 0; i < s.size(); i++) {
int cnt;
if (s[i] == '0') {
if (!q1.empty()) {
cnt = q1.front();
q1.pop();
} else {
cnt = ans++;
}
q0.push(cnt);
} else {
if (!q0.empty()) {
cnt = q0.front();
q0.pop();
} else {
cnt = ans++;
}
q1.push(cnt);
}
}
if (ans > 1) {
ans--;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
string t;
cin >> t;
set<int> zero1;
set<int> one0;
for (int i = 0; i < n; i++) {
if (s[i] == '1' && t[i] == '0') {
one0.emplace(i);
} else if (s[i] == '0' && t[i] == '1') {
zero1.emplace(i);
}
}
if (one0.size() != zero1.size()) {
cout << -1 << endl;
return 0;
}
int ans = 0;
while (zero1.size() > 0) {
bool f = 1;
vector<int> rem1, rem0;
int curr = -1;
if (one0.size() > 0 && zero1.size() > 0) {
int ind1 = *one0.begin();
int ind2 = *zero1.begin();
f = ind1 < ind2;
}
while (one0.size() > 0 && zero1.size() > 0) {
if (f) {
auto ind = one0.lower_bound(curr);
if (ind == one0.end()) {
break;
}
curr = *ind;
rem1.push_back(curr);
f = !f;
} else {
auto ind = zero1.lower_bound(curr);
if (ind == zero1.end()) {
break;
}
curr = *ind;
rem0.push_back(curr);
f = !f;
}
}
int minn = min(rem0.size(), rem1.size());
if (minn == 0) break;
ans += 1;
for (int i = 0; i < minn; i++) {
zero1.erase(rem0[i]);
one0.erase(rem1[i]);
}
}
ans += zero1.size();
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long int fastpow(long long int base, long long int power,
long long int modulo = 1000000007) {
base %= modulo;
if (base < 0LL) base += modulo;
long long int x = base, cnt = power, ans = 1LL;
while (cnt) {
if (cnt & 1LL) ans = (ans * x) % modulo;
x = (x * x) % modulo;
cnt >>= 1LL;
}
return ans;
}
inline long long int inv(long long int base,
long long int modulo = 1000000007) {
return fastpow(base, modulo - 2LL, modulo);
}
void solve() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
int cns = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1') {
cns++;
}
if (t[i] == '1') {
cnt++;
}
}
if (cns != cnt) {
cout << "-1\n";
return;
}
int cur = 0, maxval = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0' && t[i] == '1') {
cur++;
} else if (s[i] == '1' && t[i] == '0') {
cur--;
}
maxval = max(maxval, cur);
cur = max(0, cur);
}
cur = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0' && t[i] == '1') {
cur--;
} else if (s[i] == '1' && t[i] == '0') {
cur++;
}
maxval = max(maxval, cur);
cur = max(0, cur);
}
cout << maxval << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
string s, t;
cin >> n >> s >> t;
int cnt = 0;
for (int i = 0; i < n; ++i) {
cnt += s[i] - '0';
cnt -= t[i] - '0';
}
if (cnt != 0) {
cout << -1 << '\n';
return 0;
}
int cnt0 = 0, cnt1 = 0;
for (int i = 0; i < n; ++i) {
if (s[i] != t[i]) {
if (s[i] == '0') {
if (cnt1) {
cnt1--;
cnt0++;
} else {
cnt0++;
}
} else {
if (cnt0) {
cnt0--;
cnt1++;
} else {
cnt1++;
}
}
}
}
cout << cnt0 + cnt1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
const int N = 100005;
void solve() {
long long n;
cin >> n;
string s, t;
cin >> s >> t;
long long c = 0, d = 0;
for (long long i = 0; i <= n - 1; i++) {
if (s[i] == '1') c++;
if (t[i] == '1') d++;
}
if (c != d) {
cout << "-1" << '\n';
return;
}
set<int> odd, even;
vector<pair<long long, long long> > v;
for (long long i = 0; i <= n - 1; i++) {
if (s[i] != t[i]) {
if (s[i] == '0')
v.push_back({i, 0});
else
v.push_back({i, 1});
}
}
for (long long i = 0; i <= (long long)v.size() - 1; i++) {
if (v[i].second == 0) {
if ((long long)even.size()) even.erase(even.begin());
odd.insert(i);
} else {
if ((long long)odd.size()) odd.erase(odd.begin());
even.insert(i);
}
}
long long ans = (long long)odd.size() + (long long)even.size();
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
while (TESTS--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, i, j, k;
string s, t;
string tmp1, tmp2;
cin >> n;
cin >> s >> t;
tmp1 = s;
tmp2 = t;
sort((tmp1).begin(), (tmp1).end());
sort((tmp2).begin(), (tmp2).end());
if (tmp1 != tmp2) {
cout << -1 << endl;
return 0;
}
long long cnt = 0;
long long ans = 0;
long long mn = 0;
for (i = 0; i < n; i++) {
if (s[i] == t[i]) continue;
if (s[i] == '1')
cnt++;
else
cnt--;
ans = max(ans, cnt - mn);
mn = min(mn, cnt);
}
mn = 0;
cnt = 0;
for (i = 0; i < n; i++) {
if (s[i] == t[i]) continue;
if (s[i] == '1')
cnt--;
else
cnt++;
ans = max(ans, cnt - mn);
mn = min(mn, cnt);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(NULL);
int n;
cin >> n;
string s, t;
cin >> s >> t;
vector<int> v;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
if (s[i] == '0') {
v.push_back(-1);
} else {
v.push_back(1);
}
}
}
if (accumulate(v.begin(), v.end(), 0) != 0) {
cout << -1 << endl;
return 0;
}
int c1 = 0, c2 = 0;
int ma1 = 0, ma2 = 0;
for (int i = 0; i < v.size(); i++) {
c1 += v[i];
ma1 = max(ma1, c1);
if (c1 < 0) c1 = 0;
}
for (int i = 0; i < v.size(); i++) {
c2 -= (v[i]);
ma2 = max(ma2, (c2));
if (c2 < 0) c2 = 0;
}
cout << max(ma1, ma2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
const long double PI = 3.14159265358979323846;
const long long MOD = 998244353;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s1, s2;
cin >> s1 >> s2;
set<int> f, s;
for (int i = 0; i < n; i++) {
if (s1[i] == '0' && s2[i] == '1') {
f.insert(i);
}
if (s1[i] == '1' && s2[i] == '0') {
s.insert(i);
}
}
if (s.size() != f.size()) {
cout << -1;
return 0;
}
int cnt = 0;
while (f.size()) {
int last, from;
if (*f.begin() > *s.begin()) {
swap(f, s);
}
int cur = *f.begin();
f.erase(f.begin());
from = 0;
while (true) {
from ^= 1;
if (from) {
auto it = s.lower_bound(cur);
if (it == s.end()) break;
cur = *it;
s.erase(it);
} else {
auto it = f.lower_bound(cur);
if (it == f.end()) break;
cur = *it;
f.erase(it);
}
}
if (from == 1) {
f.insert(cur);
}
cnt++;
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin >> n;
string s, t;
set<long long int> z, o;
cin >> s >> t;
for (long long int i = 0; i < (n); i++) {
if (s[i] != t[i]) {
if (s[i] == '1')
o.insert(i);
else
z.insert(i);
}
}
long long int ans = -1;
if (o.size() == z.size()) {
ans = 0;
while (o.size()) {
if (*o.begin() < *z.begin()) {
long long int cur = *o.begin();
while (z.upper_bound(cur) != z.end()) {
if (o.lower_bound(*z.lower_bound(cur)) != o.end()) {
long long int nxt = *o.lower_bound(*z.lower_bound(cur));
z.erase(*z.lower_bound(cur));
o.erase(cur);
cur = nxt;
} else {
z.erase(*z.lower_bound(cur));
o.erase(cur);
break;
}
}
ans++;
} else {
long long int cur = *z.begin();
while (o.lower_bound(cur) != o.end()) {
if (z.lower_bound(*o.lower_bound(cur)) != z.end()) {
long long int nxt = *z.lower_bound(*o.lower_bound(cur));
o.erase(*o.lower_bound(cur));
z.erase(cur);
cur = nxt;
} else {
o.erase(*o.lower_bound(cur));
z.erase(cur);
break;
}
}
ans++;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1123456;
int n;
char s[maxn], t[maxn];
int main() {
scanf("%d", &n);
scanf("%s%s", s + 1, t + 1);
int cnt = 0;
for (int(i) = (1); (i) <= (n); (i)++) {
if (s[i] == '0')
cnt++;
else
cnt--;
if (t[i] == '0')
cnt--;
else
cnt++;
}
if (cnt) {
puts("-1");
return 0;
}
int ans[2] = {};
for (int(i) = (1); (i) <= (n); (i)++)
if (s[i] != t[i]) {
if (s[i] == '0') {
ans[0]++;
if (ans[1] > 0) ans[1]--;
} else {
ans[1]++;
if (ans[0] > 0) ans[0]--;
}
}
printf("%d", ans[0] + ans[1]);
}
|
#include <bits/stdc++.h>
using namespace std;
const long long LINF = (long long)1e18 + 47;
const int INF = 2 * 1e9 + 47;
const int MOD = 1e9 + 7;
const int modulo = 1e8;
const int nax = (int)1e6 + 10;
const double EPS = 1e-7;
int c[nax];
int n;
vector<int> vec;
int get(int x) {
int mx = 0;
int cur = 0;
for (int i = (0); i < (vec.size()); i++) {
if (x == vec[i])
cur++;
else
cur--;
mx = max(mx, cur);
if (cur < 0) cur = 0;
}
return mx;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
string a, b;
cin >> a >> b;
for (int i = (0); i < (n); i++) {
if (a[i] != b[i]) {
if (a[i] == '1')
c[i] = 1;
else
c[i] = -1;
}
}
int cnt = 0;
for (int i = (0); i < (n); i++) {
if (c[i] == 1)
cnt++;
else if (c[i] == -1)
cnt--;
}
if (cnt) {
cout << -1 << '\n';
return 0;
}
for (int i = (0); i < (n); i++) {
if (c[i] != 0) {
vec.push_back(c[i]);
}
}
int ans = 0;
for (int i = (0); i < (vec.size()); i++) {
int j = i;
while (j < vec.size() && vec[j] == vec[i]) {
j++;
}
int len = j - i;
ans = max(ans, len);
i = j - 1;
}
cout << max(get(-1), get(1)) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
priority_queue<long long int, vector<long long int>, greater<long long int> >
ti;
vector<long long int> p[300005], a(300005, 0), b(200005, 0), f(400005, 0),
d(400005, 0), q[200005];
long long int vis[200005];
map<pair<long long int, long long int>, long long int> mp;
set<pair<long long int, long long int> > s;
set<long long int> st;
map<long long int, long long int> np, v;
queue<long long int> qy;
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int bpow(long long int a, long long int b) {
long long int res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % 1000000007;
a = (a * a) % 1000000007;
b >>= 1;
}
return res % 1000000007;
}
long long int fact(long long int i) {
f[0] = 1;
for (long long int k = 1; k <= i; k++) {
(f[k] = f[k - 1] * k) %= 1000000007;
}
return f[i];
}
long long int isprime(long long int n) {
if (n == 1) return 0;
for (long long int i = 2; i <= sqrt(n); i++)
if (n % i == 0) return 0;
return 1;
}
bool cmp(long long int i, long long int j) { return p[i].size() < p[j].size(); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
string s, t;
cin >> s >> t;
long long int c1 = 0, c2 = 0;
for (long long int i = 0; i < n; i++) {
if (s[i] == '1') c1++;
}
for (long long int i = 0; i < n; i++) {
if (t[i] == '1') c2++;
}
if (c1 != c2) {
cout << -1 << "\n";
exit(0);
}
map<long long int, long long int> mp;
for (long long int i = 0; i < n; i++) {
if (s[i] != t[i] && s[i] == '1') mp[i] = 1;
if (s[i] != t[i] && s[i] == '0') mp[i] = -1;
}
c1 = 0;
c2 = 0;
char c = '.';
for (long long int i = 0; i < n; i++) {
c1 += mp[i];
if (c1 < 0) c1 = 0;
c2 = max(c2, c1);
}
c1 = 0;
for (long long int i = 0; i < n; i++) {
c1 += (-mp[i]);
if (c1 < 0) c1 = 0;
c2 = max(c2, c1);
}
cout << c2 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int t, n;
int mx = -1e6 - 5, mn = 1e6 + 5, diff[N];
int main() {
scanf("%d", &n);
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i < n; i++) {
diff[i] = s1[i] - s2[i];
if (i > 0) diff[i] += diff[i - 1];
mx = max(mx, diff[i]);
mn = min(mn, diff[i]);
}
int ans = abs(mx - mn);
if (diff[n - 1])
printf("%d\n", -1);
else
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
int T, n, ans[1000010], ans1, ans2, sum1, sum2, cnt;
char aa[1000010], bb[1000010];
int main() {
scanf("%d%s%s", &n, aa + 1, bb + 1);
for (int i = 1; i <= n; i++)
if (aa[i] != bb[i])
sum1 = std::max(0, sum1 + (aa[i] == '1' ? 1 : -1)),
sum2 = std::max(0, sum2 + (aa[i] == '1' ? -1 : 1)),
cnt += aa[i] == '1' ? 1 : -1, ans1 = std::max(ans1, sum1),
ans2 = std::max(ans2, sum2);
printf("%d\n", cnt == 0 ? std::max(ans1, ans2) : -1);
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long fastPow(long long base, long long exp, long long mod) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) res = ((res % mod) * (base % mod)) % mod;
base = ((base % mod) * (base % mod)) % mod;
exp /= 2;
}
return res % mod;
}
void solve() {
long long n;
cin >> n;
string s, t;
cin >> s >> t;
long long c0 = 0, c1 = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '0')
c0++;
else
c1++;
}
for (long long i = 0; i < n; i++) {
if (t[i] == '0')
c0--;
else
c1--;
}
if (c0 != 0 || c1 != 0) {
cout << "-1\n";
return;
}
c0 = 0, c1 = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '1' && t[i] == '0') {
if (c0) c0--;
c1++;
} else if (s[i] == '0' && t[i] == '1') {
if (c1) c1--;
c0++;
}
}
cout << c0 + c1 << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long tc = 1;
while (tc--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
string s, t;
cin >> s >> t;
int ones = 0, zeros = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
zeros++;
else
ones++;
if (t[i] == '0')
zeros--;
else
ones--;
}
if (ones != 0 || zeros != 0) {
cout << -1;
return 0;
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
if (t[i] == '1') {
if (ones > 0)
ones--;
else
ans++;
zeros++;
} else {
if (zeros > 0)
zeros--;
else
ans++;
ones++;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long q, n, c, x, r, a1[2], a2[2], a[1000000][2], c0, c1;
string s1, s2;
bool b[1000001];
long long dfs(long long xf) {
if (!b[xf]) return xf;
return a[xf][s1[xf] - '0'] = dfs(a[xf][s1[xf] - '0']);
}
int main() {
cin >> n;
cin >> s1 >> s2;
for (int i = 0; i < n; i++) {
a1[s1[i] - '0']++;
a2[s2[i] - '0']++;
}
if (a1[0] != a2[0]) {
cout << -1;
return 0;
}
c0 = n;
c1 = n;
for (int i = n - 1; i >= 0; i--) {
a[i][0] = c0;
a[i][1] = c1;
if (s1[i] != s2[i]) {
if (s1[i] - '0' == 0)
c0 = i;
else
c1 = i;
}
}
for (int i = 0; i < n; i++) {
if (s1[i] != s2[i] && !b[i]) {
c = (s1[i] - '0' + 1) % 2;
x = i;
while (x != n) {
b[x] = 1;
if (b[a[x][c]]) a[x][c] = dfs(a[x][c]);
x = a[x][c];
c = (c + 1) % 2;
}
r++;
}
}
cout << r;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int_fast32_t inf = 1e9 + 7;
const int_fast32_t MOD = 1000000007;
const int_fast64_t llinf = 1e18;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int_fast32_t n;
cin >> n;
string s, t;
cin >> s >> t;
{
int_fast32_t cnt = 0;
for (int_fast64_t i = 0; i < (n); ++i) cnt += s[i] - '0';
for (int_fast64_t i = 0; i < (n); ++i) cnt -= t[i] - '0';
if (cnt != 0) {
cout << (-1) << "\n";
return 0;
}
}
int_fast32_t ans = 0;
int_fast32_t cnt[2] = {0, 0};
for (int_fast64_t i = 0; i < (n); ++i) {
if (s[i] == t[i]) continue;
if (s[i] == '0') {
if (cnt[1] > 0) {
cnt[1]--;
cnt[0]++;
} else {
cnt[0]++;
ans++;
}
} else {
if (cnt[0] > 0) {
cnt[0]--;
cnt[1]++;
} else {
cnt[1]++;
ans++;
}
}
}
cout << (ans) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int N = 1e9 + 7;
void solve() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
vector<int> v;
v.push_back(-1);
int s1 = 0, t1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1') {
s1++;
}
if (t[i] == '1') {
t1++;
}
if (s[i] != t[i]) {
v.push_back(s[i] - '0');
}
}
if (t1 != s1) {
cout << -1 << endl;
return;
}
int cnt = 0, curr, max_cnt = 0;
int zero = 0, one = 0;
for (int i = 1; i < v.size(); i++) {
if (v[i] == 0) {
if (one > 0) {
one--;
zero++;
} else {
zero++;
}
} else {
if (zero > 0) {
zero--;
one++;
} else {
one++;
}
}
}
cout << zero + one << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
char s1[1000005], s2[1000005];
int main() {
int km = 0, kn = 0, n, k = 0;
cin >> n >> s1 >> s2;
for (int i = 0; i < n; i++) {
if (s1[i] == '1' && s2[i] == '0') k++;
if (s1[i] == '0' && s2[i] == '1') k--;
km = max(km, k);
kn = min(kn, k);
}
if (k != 0)
printf("-1");
else
printf("%d", km - kn);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s1, s2;
cin >> s1 >> s2;
set<int> a, b;
for (int i = 0; i < n; i++) {
if (s1[i] == '1' && s2[i] == '0') a.insert(i);
if (s1[i] == '0' && s2[i] == '1') b.insert(i);
}
if (a.size() != b.size()) {
cout << -1 << endl;
return 0;
}
int c = 0;
while (a.size() + b.size()) {
auto it1 = a.begin();
auto it2 = b.begin();
int v1 = *it1, v2 = *it2;
if (v1 < v2) {
while (it1 != a.end() && it2 != b.end()) {
a.erase(it1);
b.erase(it2);
it1 = a.upper_bound(v2);
it2 = b.upper_bound(*it1);
v2 = *it2;
}
} else {
while (it1 != a.end() && it2 != b.end()) {
a.erase(it1);
b.erase(it2);
it2 = b.upper_bound(v1);
it1 = a.upper_bound(*it2);
v1 = *it1;
}
}
c++;
}
cout << c << endl;
return 0;
}
|
#include <bits/stdc++.h>
int n;
char s[1000005];
char t[1000005];
bool countEqual() {
int c1 = 0;
int c2 = 0;
for (int i = 0; i < n; i++) {
c1 += s[i] == '1';
c2 += t[i] == '1';
}
return c1 == c2;
}
int main() {
scanf("%d", &n);
scanf("%s", s);
scanf("%s", t);
if (!countEqual()) {
printf("-1\n");
return 0;
}
int ans = 0;
int curr = 0;
for (int i = 0; i < n * 2; i++) {
int ix = i % n;
if (s[ix] == '1' && t[ix] == '0') {
curr++;
if (curr > ans) ans = curr;
}
if (s[ix] == '0' && t[ix] == '1') {
curr = std::max(0, curr - 1);
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
string S, T;
set<long long> st[2];
long long solve() {
long long ans = 0;
while (!st[0].empty() && !st[1].empty()) {
long long sta = *st[0].begin();
long long tick = 0;
long long root = 0;
ans++;
long long cnt = 0;
if (*st[1].begin() < sta) {
sta = *st[1].begin();
tick = root = 1;
}
while (true) {
st[tick].erase(sta);
cnt++;
tick ^= 1;
auto iter = st[tick].upper_bound(sta);
if (iter == st[tick].end()) {
if (tick == root)
break;
else {
if (cnt == 1) return -1;
st[tick ^ 1].insert(sta);
break;
}
} else
sta = *iter;
}
}
if (!st[0].empty() || !st[1].empty()) return -1;
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> S >> T;
for (long long i = (long long)0; i <= (long long)n - 1; i++) {
if (S[i] == T[i]) continue;
if (S[i] == '0')
st[0].insert(i);
else
st[1].insert(i);
}
cout << solve() << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
inline long long add(long long a, long long b) {
a += b;
if (a >= mod) a -= mod;
return a;
}
inline long long sub(long long a, long long b) {
a -= b;
if (a < 0) a += mod;
return a;
}
inline long long mul(long long a, long long b) {
return (long long)((long long)a * b % mod);
}
long long n;
vector<long long> a;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long t = 1;
while (t--) {
cin >> n;
string s1, s2;
cin >> s1 >> s2;
vector<long long> v(2 * n + 1, 0);
long long c1 = 0, c2 = 0;
for (long long i = (1); i <= (n); i++) {
if (s1[i - 1] != s2[i - 1]) {
s1[i - 1] == '1' ? v[i] = 1 : v[i] = -1;
s1[i - 1] == '1' ? c1++ : c2++;
}
}
for (long long i = (n + 1); i <= (2 * n); i++) {
v[i] = v[i - n];
}
long long l = 0;
long long ans = 0;
for (long long i = (1); i <= (2 * n); i++) {
l = max(l + v[i], (long long)0);
ans = max(l, ans);
}
if (c1 != c2)
cout << -1;
else
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char c[1200001], c1[1200001], c2[1200001];
int n, i, k, kol1, kol2, ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (i = 1; i <= n; i++) {
cin >> c[i];
if (c[i] == '0') kol1++;
}
for (i = 1; i <= n; i++) {
cin >> c1[i];
if (c1[i] == '0') kol2++;
}
if (kol1 != kol2) {
cout << "-1" << '\n';
return 0;
}
for (i = 1; i <= n; i++) {
if (c[i] == '0' && c1[i] == '1') {
k++;
c2[k] = '0';
}
if (c[i] == '1' && c1[i] == '0') {
k++;
c2[k] = '1';
}
}
kol1 = kol2 = 0;
for (i = 1; i <= k; i++)
if (c2[i] == '0') {
kol1++;
if (kol2 == 0) {
ans++;
continue;
}
kol2--;
} else {
kol2++;
if (kol1 == 0) {
ans++;
continue;
}
kol1--;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int i = 0, j, k = 0, ans = 0, r, len, f = 0, m = 0, n, l = 0, p;
string s, t;
cin >> n;
cin >> s >> t;
vector<int> ind;
map<char, int> freq;
for (i = (0); i < (n) && !(0); i++) freq[s[i]]++;
for (i = (0); i < (n) && !(f); i++) {
freq[t[i]]--;
if (freq[t[i]] < 0) f = 1;
if (s[i] != t[i]) ind.push_back(i);
}
k = 0;
int maxi = 0, mini = 0;
for (i = (0); i < (ind.size()) && !(0); i++) {
if (s[ind[i]] == '1')
k++;
else
k--;
maxi = max(maxi, k);
mini = min(mini, k);
}
if (f)
cout << "-1";
else
cout << maxi - mini;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1, i = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {+1, -1, 0, 0};
int dy[] = {0, 0, +1, -1};
int n;
char s[1000005];
char t[1000005];
set<int> st[2];
set<int>::iterator it;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
scanf("%d", &n);
scanf("%s", s);
scanf("%s", t);
int cnts0 = 0, cnts1 = 0, cntt0 = 0, cntt1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
if (s[i] == '0')
st[0].insert(i);
else
st[1].insert(i);
}
if (s[i] == '0')
cnts0++;
else
cnts1++;
if (t[i] == '0')
cntt0++;
else
cntt1++;
}
if (cnts0 != cntt0) {
cout << "-1" << endl;
return 0;
}
st[0].insert(1000005);
st[1].insert(1000005);
int ans = 0;
while (true) {
int n0 = 1000005, n1 = 1000005;
it = st[0].begin();
n0 = *it;
it = st[1].begin();
n1 = *it;
if (n0 == 1000005 && n1 == 1000005) break;
int pos, cur = 0;
if (n0 > n1)
cur = 1, pos = n1;
else
cur = 0, pos = n0;
++ans;
while (true) {
st[cur].erase(pos);
it = st[cur ^ 1].lower_bound(pos);
if (*it == 1000005) break;
pos = *it;
cur ^= 1;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
string s, t;
vector<int> a(n + 1);
cin >> s >> t;
for (int i = 0; i < n; ++i) {
if (s[i] != t[i]) {
if (s[i] == '1') {
a[i] = 1;
} else {
a[i] = -1;
}
} else {
a[i] = 0;
}
}
int sum = 0;
int ma = 0, mi = (int)1e9 + 7;
for (int i = 0; i < n; ++i) {
sum += a[i];
ma = max(sum, ma);
mi = min(mi, sum);
}
if (sum != 0) {
cout << "-1" << endl;
return;
}
cout << ma - mi << endl;
}
int main() {
{ solve(); }
}
|
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int a, long long int b) {
if (b == 0) {
return 1;
}
if (b & 1) {
return a * power(a * a, b / 2);
}
return power(a * a, b / 2);
}
void solve() {
int n;
cin >> n;
string s, t;
getline(cin >> ws, s);
getline(cin >> ws, t);
int state[2] = {0};
int ss[2] = {0}, tt[2] = {0};
for (int i = 0; i < n; i++) {
if (s[i] == '1') {
ss[1]++;
} else {
ss[0]++;
}
if (t[i] == '1') {
tt[1]++;
} else {
tt[0]++;
}
}
int ans = 0;
if (ss[0] == tt[0] && ss[1] == tt[1]) {
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
if (s[i] == '0') {
if (state[1] > 0) {
state[1]--;
state[0]++;
} else {
state[0]++;
ans = max(ans, state[0]);
}
} else {
if (state[0] > 0) {
state[0]--;
state[1]++;
} else {
state[1]++;
ans = max(ans, state[1]);
}
}
}
}
cout << ans << endl;
} else {
cout << -1 << endl;
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<pii>;
int n, s[1000000], t[1000000];
vi a;
int solve() {
int c01 = 0, c10 = 0;
for (int i = 0; i < n; ++i) {
if (!s[i] && t[i]) c01++, a.push_back(0);
if (s[i] && !t[i]) c10++, a.push_back(1);
}
if (c01 != c10) return -1;
int c0 = 0, c1 = 0;
for (auto it : a)
if (it == 0) {
if (c1) c1--;
c0++;
} else {
if (c0) c0--;
c1++;
}
return c0 + c1;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%1d", s + i);
for (int i = 0; i < n; ++i) scanf("%1d", t + i);
int ans = solve();
printf("%d", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000 * 1000 * 1000 + 7;
const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const long long MOD2 = 998244353;
const long long N = 5000 * 100 + 1;
const long long N2 = 1000 * 1000 + 5;
const long double PI = 3.14159265;
const long long R = 250;
long long gcd(long long a, long long b) {
if (!b) return a;
return gcd(b, a % b);
}
long long power(long long x, long long y, long long p) {
long long res = 1;
x %= p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
string s, t;
cin >> n >> s >> t;
long long hi = 0, l = 0;
long long cur = 0;
for (long long i = 0; i < n; i++) {
cur += s[i] - t[i];
l = min(cur, l);
hi = max(cur, hi);
}
if (cur) {
cout << -1 << "\n";
} else {
cout << hi - l << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s, t;
cin >> s >> t;
int h = 0, mn = 0, mx = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == t[i]) continue;
if (s[i] == '0') {
++h;
} else {
--h;
}
mn = min(mn, h);
mx = max(mx, h);
}
if (h) {
cout << "-1\n";
} else {
cout << mx - mn << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long int LINF = 0x3f3f3f3f3f3f3f3fll;
const int MOD = 1e9 + 7;
const long double pi = acos(-1);
void solve() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
{
int ones = 0;
for (auto it : s) {
if (it == '1') ones++;
}
for (auto it : t) {
if (it == '1') ones--;
}
if (ones != 0) {
cout << -1 << '\n';
return;
}
}
string w;
for (int i = 0; i < n; i++) {
if (s[i] == t[i]) continue;
w.push_back(s[i]);
}
int ans = 0;
int n0 = 0, n1 = 0;
for (auto it : w) {
if (it == '0') {
if (n1) n1--;
n0++;
} else {
if (n0) n0--;
n1++;
}
ans = max(ans, n0 + n1);
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0);
int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
string s, t;
cin >> s >> t;
set<long long int> a;
set<long long int> b;
long long int o = 0;
long long int z = 0;
for (long long int i = 0; i < n; i++) {
if (s[i] != t[i]) {
if (s[i] == '1') {
a.insert(i);
o++;
} else {
b.insert(i);
z++;
}
}
}
if (z != o) {
cout << -1;
} else {
long long int cnt = 0;
long long int ans = 0;
auto it1 = a.begin();
auto it2 = b.begin();
while (!a.empty()) {
if ((*it1) < (*it2)) {
cnt++;
a.erase(it1);
it1 = a.upper_bound((*it2));
} else {
cnt++;
b.erase(it2);
it2 = b.upper_bound((*it1));
}
if (it1 == a.end() || it2 == b.end()) {
ans++;
if (cnt % 2 == 1) {
if (it1 != a.end()) {
a.erase(it1);
} else {
b.erase(it2);
}
}
cnt = 0;
it1 = a.begin();
it2 = b.begin();
}
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
while (tc--) {
int n;
string s, t;
cin >> n >> s >> t;
vector<bool> v;
int x = 0, y = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0' && t[i] == '1') {
v.push_back(0);
x++;
}
if (s[i] == '1' && t[i] == '0') {
v.push_back(1);
y++;
}
}
if (x != y)
cout << "-1\n";
else if (x == 0)
cout << "0\n";
else {
x = y = 0;
for (int i = 0; i < n; i++) {
if (s[i] == t[i]) continue;
if (s[i] == '1') {
if (y) y--;
x++;
} else {
if (x) x--;
y++;
}
}
cout << x + y << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
string s2(s), t2(t);
sort(s2.begin(), s2.end());
sort(t2.begin(), t2.end());
if (s2 != t2) {
cout << -1 << "\n";
return;
}
int open[2] = {0};
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
int type = s[i] == '1';
if (not open[type]) {
open[1 - type]++;
} else if (open[type]) {
open[type]--;
open[1 - type]++;
}
}
}
cout << open[0] + open[1] << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 9;
int main() {
int n, count1 = 0, count2 = 0, sum0 = 0, sum1 = 0;
cin >> n;
string a, b;
cin >> a >> b;
for (int i = 0; i < n; i++) {
if (a[i] == '0') count1++;
if (b[i] == '0') count2++;
}
if (count1 != count2) {
cout << "-1";
} else {
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
if (a[i] == '0') {
sum0++;
if (sum1) {
sum1--;
}
}
if (a[i] == '1') {
sum1++;
if (sum0) {
sum0--;
}
}
}
}
cout << sum0 + sum1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n;
cin >> n;
string s, t;
cin >> s >> t;
long long int cnt = 0;
long long int ans = 0;
long long int mn = 0, mx = 0;
for (long long int i = 0; i < (long long int)(n); i++) {
if (s[i] == '0' && t[i] == '1')
cnt++;
else if (s[i] == '1' && t[i] == '0')
cnt--;
ans = max({ans, abs(cnt - mx), abs(cnt - mn)});
mn = min(mn, cnt);
mx = max(mx, cnt);
}
if (cnt != 0) {
cout << -1 << '\n';
return;
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t = 1;
for (long long int i = 0; i < (long long int)(t); i++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> Rv(pair<int, int> a) { return {a.second, a.first}; }
int n, xy, x;
string s, t, a;
set<pair<int, int> > se, es;
void A(int v, int i) {
se.insert({i, v});
es.insert({v, i});
}
void A(pair<int, int> a) { A(a.first, a.second); }
void R(int v, int i) {
se.erase(se.find({i, v}));
es.erase(es.find({v, i}));
}
void R(pair<int, int> a) { R(a.first, a.second); }
pair<int, int> seb() { return Rv(*se.begin()); }
pair<int, int> esb() { return (*es.begin()); }
pair<int, int> see() { return Rv(*(--se.end())); }
pair<int, int> ese() { return (*(--es.end())); }
void G(pair<int, int> a, pair<int, int> b) {
R(a), R(b);
A(a.first + b.first - x, a.second);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> s >> t;
for (int i = 0; i < n; ++i) {
if (s[i] != t[i]) {
a += s[i];
if (s[i] == '1')
++xy;
else
--xy;
}
}
if (xy) {
cout << -1 << endl;
return 0;
} else if (a.size() == 0) {
cout << 0 << endl;
return 0;
}
n = a.size();
int g = 1, gg = 1;
for (int i = 1; i < n; ++i) {
if (a[i - 1] != a[i]) {
A(g, gg);
++gg;
g = 1;
} else {
++g;
}
}
A(g, gg);
while (es.size()) {
if (((int)se.size() & 1) && (se.size() != 1)) G(seb(), see());
g = esb().first;
gg = esb().second;
x = g;
set<pair<int, int> >::iterator it = se.find({gg, g}), ti = it;
if (it != se.begin() && it != (--se.end())) {
++it, --ti;
G(Rv(*ti), Rv(*it));
}
R({g, gg});
}
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const int bit = 32;
const double pi = acos(-1.0);
char a[M], b[M];
vector<int> v;
int main() {
int n;
scanf("%d", &n);
scanf("%s%s", a, b);
int ans = 0, p = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
if (a[i] == '1')
p++;
else
p--;
v.push_back(a[i] - '0');
}
}
if (p) {
puts("-1");
return 0;
}
int len = v.size();
int st = 0;
for (int i = 0; i < v.size(); i++) {
if (v[i] == 0) {
st++;
ans = max(ans, st);
} else {
st--;
if (st < 0) st = 0;
}
}
st = 0;
for (int i = 0; i < v.size(); i++) {
if (v[i] == 1) {
st++;
ans = max(ans, st);
} else {
st--;
if (st < 0) st = 0;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, cur, ans = 0;
cin >> n;
string a, b;
cin >> a;
cin >> b;
set<int> s;
set<int> t;
vector<int> v;
vector<int> w;
vector<int> x;
vector<int> y;
set<int>::iterator it1;
set<int>::iterator it2;
for (int i = 0; i < n; ++i) {
if (a[i] == '1' && b[i] == '0')
s.insert(i);
else if (a[i] == '0' && b[i] == '1')
t.insert(i);
}
if ((int)(s).size() != (int)(t).size()) {
cout << -1;
return 0;
}
while ((int)(s).size()) {
++ans;
cur = -1;
v.clear();
w.clear();
x.clear();
y.clear();
while (1) {
it1 = s.lower_bound(cur);
if (it1 == s.end()) break;
it2 = t.lower_bound(*it1);
if (it2 == t.end()) break;
cur = *it2;
v.push_back(*it1);
w.push_back(*it2);
s.erase(it1);
t.erase(it2);
}
for (int i : v) s.insert(i);
for (int i : w) t.insert(i);
cur = -1;
while (1) {
it1 = t.lower_bound(cur);
if (it1 == t.end()) break;
it2 = s.lower_bound(*it1);
if (it2 == s.end()) break;
cur = *it2;
x.push_back(*it1);
y.push_back(*it2);
t.erase(it1);
s.erase(it2);
}
if ((int)(v).size() > (int)(x).size()) {
for (int i : x) t.insert(i);
for (int i : y) s.insert(i);
for (int i : v) s.erase(s.lower_bound(i));
for (int i : w) t.erase(t.lower_bound(i));
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5;
long long n, s0, t0, k10, k01;
char s[N], t[N];
signed main() {
scanf("%lld%s%s", &n, s + 1, t + 1);
for (long long i = 1; i <= n; i++) s0 += (s[i] == '0'), t0 += (t[i] == '0');
if (s0 != t0) puts("-1"), exit(0);
for (long long i = 1; i <= n; i++) {
if (s[i] == '0' && t[i] == '1') {
k01++;
if (k10) k10--;
}
if (s[i] == '1' && t[i] == '0') {
k10++;
if (k01) k01--;
}
}
printf("%lld\n", k01 + k10);
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
long long n, i, j, cnt, ans, m;
string second, t;
deque<pair<long long, long long>> v;
signed main() {
iostream::sync_with_stdio(0);
cin.tie(0);
cin >> n >> second >> t;
for (char h : second) cnt += h - '0';
for (char h : t) cnt -= h - '0';
if (cnt != 0) {
cout << "-1";
exit(0);
}
for (i = 0; i < n; i++) {
if (second[i] == t[i]) continue;
j = i + 1;
cnt = 1;
while (j < n) {
if (second[j] == t[j]) {
j++;
continue;
}
if (second[i] != second[j]) break;
cnt++;
j++;
}
v.push_back({second[i] - '0', cnt});
i = j - 1;
}
while (v.size() > 0) {
if (v[0].first == 1) {
if (v.back().first == 1) {
v[0].second += v.back().second;
v.pop_back();
}
} else {
if (v.back().first == 0)
v.back().second += v[0].second;
else
v.push_back(v[0]);
v.pop_front();
}
m = 1e9;
for (auto x : v) m = min(m, x.second);
ans += m;
for (i = 0; i < v.size(); i++) v[i].second -= m;
deque<pair<long long, long long>> v1 = v;
v.clear();
for (i = 0; i < v1.size(); i++) {
if (v1[i].second == 0) continue;
j = i + 1;
cnt = v1[i].second;
while (j < v1.size()) {
if (v1[j].second == 0) {
j++;
continue;
}
if (v1[i].first != v1[j].first) break;
cnt += v1[j].second;
j++;
}
v.push_back({v1[i].first, cnt});
i = j - 1;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, i, c = 0, d = 0;
cin >> n;
string a, b, s1 = "", s2 = "";
cin >> a >> b;
for (i = 0; i < n; i++) {
if (a[i] == '0') c++;
if (b[i] == '0') d++;
if (a[i] != b[i]) {
s1 += a[i];
s2 += b[i];
}
}
if (a == b) {
cout << 0;
return 0;
}
if (c != d) {
cout << "-1";
return 0;
}
long long ans = 1;
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) break;
}
if (i == s1.size() - 1) {
cout << 1;
return 0;
}
long long one = 0, zero = 0;
for (i = 0; i < s1.size(); i++) {
if (s1[i] == '0') {
if (one) {
one--;
zero++;
} else
zero++;
} else {
if (zero) {
zero--;
one++;
} else
one++;
}
}
cout << one + zero;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6;
int a[N];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, cnt = 0;
cin >> n;
string S, T, s, t;
cin >> S >> T;
for (int i = 0; i < n; i++) {
if (S[i] != T[i]) s += S[i], t += T[i];
if (S[i] == '0') cnt++;
if (T[i] == '0') cnt--;
}
if (cnt != 0) return cout << -1 << "\n", 0;
n = s.size();
int m = 1, block = 1;
char cur = s[0];
for (int i = 1; i < n; i++) {
if (s[i] != cur)
a[m++] = block, block = 1, cur = s[i];
else
block++;
}
a[m] = block;
if (s[0] == s[n - 1] && block != n) a[1] += a[m], m--;
int mn = 0, mx = 0, MN = 0, MX = 0, sum = 0;
for (int i = 1; i <= m; i++) {
sum += a[i] * (i % 2 ? 1 : -1);
MX = max(MX, sum - mn), MN = min(MN, sum - mx);
mx = max(mx, sum), mn = min(mn, sum);
}
int ans = max(max(MX, -MN), max(sum - MN, MX - sum));
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
using lld = long double;
using ulli = unsigned long long int;
using pll = pair<lli, lli>;
using ttt = pair<lli, pll>;
using vttt = vector<ttt>;
using vll = vector<pll>;
using vl = vector<lli>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using cd = complex<lld>;
const double PI = acos(-1);
string get(string s) {
sort(s.begin(), s.end());
return s;
}
int tejas_919(int kkkk) {
lli n, m, k, q, u, v, temp = 0, ans = 0;
cin >> n;
string s, t;
cin >> s >> t;
if (get(s) != get(t)) return cout << -1 << '\n', 0;
int c0 = 0, c1 = 0;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == t[i]) continue;
if (s[i] == '0') {
if (c1) c1--;
c0++;
} else {
if (c0) c0--;
c1++;
}
}
cout << c0 + c1 << '\n';
return 0;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed << setprecision(10);
int t = 1;
for (int i = 0; i < t; i++) {
tejas_919(i + 1);
}
{};
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b;
set<int> s, t;
int ans = 0;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
;
int n;
cin >> n;
cin >> a >> b;
for (int i = 0; i < n; i++) {
if (a[i] == b[i]) continue;
if (a[i] == '0' && b[i] == '1')
s.insert(i);
else
t.insert(i);
}
if (t.size() != s.size()) {
cout << "-1\n";
return 0;
}
while (!s.empty() && !t.empty()) {
int L = -1, ok = 0;
if (*(s.begin()) < *(t.begin())) ok = 1;
while (true) {
if (ok) {
auto it = s.lower_bound(L);
if (it == s.end()) break;
auto nxt = t.lower_bound(*it);
if (nxt == t.end()) break;
L = int(*nxt);
s.erase(it);
t.erase(nxt);
} else {
auto it = t.lower_bound(L);
if (it == t.end()) break;
auto nxt = s.lower_bound(*it);
if (nxt == s.end()) break;
L = *nxt;
t.erase(it);
s.erase(nxt);
}
}
ans++;
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000010];
char t[1000010];
int n;
void solve() {
cin >> n >> s >> t;
char prv = 'a';
int ans = 0;
int c = 0;
int par = 0;
int n0 = 0, n1 = 0;
for (int i = 0; i < 2 * n; ++i) {
int j = i % n;
if (s[j] == t[j]) continue;
if (s[j] == '1') {
++par;
if (n1 > 0)
++n1;
else
n1 = 1;
--n0;
} else {
--par;
if (n0 > 0)
++n0;
else
n0 = 1;
--n1;
}
if (ans < n1) ans = n1;
if (ans < n0) ans = n0;
}
if (par) ans = -1;
cout << ans << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
string s, t;
int main() {
cin >> n;
cin >> s;
cin >> t;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == t[i]) {
a[i] = 0;
} else if (s[i] == '1') {
a[i] = 1;
} else {
a[i] = -1;
}
sum += a[i];
}
if (sum != 0) {
cout << "-1\n";
return 0;
}
int summx = 0, atsummx = 0;
for (int i = 0; i < n; i++) {
atsummx += a[i];
if (atsummx < 0) {
atsummx = 0;
}
summx = max(summx, atsummx);
}
atsummx = 0;
for (int i = 0; i < n; i++) {
atsummx += -a[i];
if (atsummx < 0) {
atsummx = 0;
}
summx = max(summx, atsummx);
}
cout << summx << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
long long int llog(long long int n) {
long long int cnt = 0;
while (n % 2 == 0) {
n /= 2;
cnt++;
}
return cnt;
}
long long int power(long long int a, long long int b) {
long long int ans = 1;
while (b != 0) {
ans *= a;
b--;
}
return ans;
}
void solve() {
int n, ones = 0, zeros = 0;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
ones += (s[i] == '1');
zeros += (t[i] == '1');
}
if (ones != zeros) {
cout << "-1\n";
return;
}
if (s == t) {
cout << "0\n";
return;
}
ones = zeros = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1' && t[i] == '0') {
if (ones != 0) ones--;
zeros++;
} else if (s[i] == '0' && t[i] == '1') {
if (zeros != 0) zeros--;
ones++;
}
}
cout << ones + zeros << endl;
}
int main() {
int t;
t = 1;
for (int q = 0; q < t; q++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m[3][3];
string s, s1;
int main() {
int n;
cin >> n;
cin >> s >> s1;
int r = 0, re = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1') r++;
}
for (int i = 0; i < n; i++) {
if (s1[i] == '1') re++;
}
if (r != re) {
cout << -1;
return 0;
}
for (int i = 0; i < n; i++) {
if (s[i] == s1[i]) continue;
if (s[i] == '1') {
if (m[0][1] > 0) {
m[0][1]--;
m[1][0]++;
} else if (m[0][0] > 0) {
m[0][0]--;
m[1][1]++;
} else {
m[1][1]++;
}
} else if (s[i] == '0') {
if (m[1][1] > 0) {
m[1][1]--;
m[0][0]++;
} else if (m[1][0] > 0) {
m[1][0]--;
m[0][1]++;
} else {
m[0][1]++;
}
}
}
int g = 0;
re = m[0][1] + m[1][1];
g += re / 2 + (re % 2);
re = m[1][0] + m[0][0];
g += re;
cout << g;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.