-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathE.cpp
More file actions
75 lines (66 loc) · 1.05 KB
/
E.cpp
File metadata and controls
75 lines (66 loc) · 1.05 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
//#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
int main()
{ quick;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin>>n;
string s,t;
cin>>s>>t;
if(count(all(s),'1')!=count(all(t),'1'))
{
cout<<-1<<endl;
return 0;
}
if(s==t)
{
cout<<0<<endl;
return 0;
}
vector<int> a(n,0);
fab(0,n,i)
{
if(s[i]!=t[i])
{
if(s[i]=='1')
a[i]=1;
else
a[i]=-1;
}
}
ll sum=0;
ll ans=0;
fab(0,n,i)
{
sum+=a[i];
ans=max(ans,sum);
if(sum<0)
sum=0;
}
sum=0;
fab(0,n,i)
{
sum+=-a[i];
ans=max(ans,sum);
if(sum<0)
sum=0;
}
cout<<ans<<endl;
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}