text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
const double PI = acos(-1);
template <typename T> constexpr bool chmax(T &a, const T &b) {
if(a >= b) return false;
a = b;
return true;
}
template <typename T> constexpr bool chmin(T &a, const T &b) {
if(a <= b) return false;
a = b;
return true;
}
/*-------------------------------------------*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
vector<int> h{0};
for(auto c : s) {
int cur = h.back() + (c == '1' ? 1 : -1);
h.push_back(cur);
}
vector<int> z = h;
FORR(i, n) chmax(z[i], z[i + 1]);
int mx = *max_element(ALL(h));
int ans = 1 << 30;
rep(_, 2) {
int cur = 0, mn = 0;
rep(i, n) {
if(s[i] == '?') {
if(cur + z[i + 1] - h[i] + 2 <= mx)
cur++;
else
cur--;
} else if(s[i] == '0')
cur--;
else
cur++;
chmin(mn, cur);
}
chmin(ans, mx - mn);
mx++;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = (int) s.length();
int z = 0, cur = 0;
for (auto& c : s) {
if (c == '1') {
cur++;
} else {
cur--;
}
z = max(z, cur);
}
auto f = [&](const int& m) {
vector<int> v;
v.push_back(0);
string t = s;
for (int i = 0; i < n; i++) {
if (s[i] == '1') {
v.push_back(v.back() + 1);
} else {
if (s[i] == '?') {
t[i] = '0';
}
v.push_back(v.back() - 1);
}
}
for (int i = n - 1; i >= 0; i--) {
v[i] = max(v[i], v[i + 1]);
}
int add = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '?') {
if (v[i + 1] + add + 2 <= m) {
add += 2;
t[i] = '1';
}
}
}
v.clear();
v.push_back(0);
for (auto& c : t) {
if (c == '1') {
v.push_back(v.back() + 1);
} else {
v.push_back(v.back() - 1);
}
}
return *min_element(v.begin(), v.end());
};
cout << min(z - f(z), (z + 1) - f(z + 1)) << '\n';
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef long long ll;
typedef pair < int, int > pii;
typedef vector < int > vi;
const int N = 1e6 + 500;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
int mini = 0, maxi = 0, n;
char s[N];
int desno[N];
int probaj(int x){
if(desno[0] < x)
return n;
int cur = 0, gran = 0;
for(int i = 0;i < n;i++){
if(s[i] == '1'){
cur++;
}
else if(s[i] == '0'){
cur--;
}
else{
if(cur + desno[i + 1] > x)
cur--;
else
cur++;
}
gran = max(cur, gran);
}
return gran - x;
}
int main(){
scanf("%s", s);
n = strlen(s);
desno[n] = 0;
for(int i = n - 1;i >= 0;i--){
if(s[i] == '1' || s[i] == '?'){
desno[i] = min(desno[i + 1] + 1, 0);
}
else{
desno[i] = desno[i + 1] - 1;
}
}
int sol = n;
for(int x = desno[0];x >= desno[0] - 50;x--)
sol = min(sol, probaj(x));
printf("%d\n", sol);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
/*
右側の塊を考えて、なるべく現在と逆のを書きつつ、やばそうなら右側のと逆を書く
*/
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
signed main(){
string s;cin>>s;
int n=s.size();
vector<int> o(n+1,0),z(n+1,0);
int ot=0,zt=0;
for(int i=n-1;i>=0;i--){
if(s[i]=='0')z[i]=++zt;
else{chmax(--zt,0);z[i]=zt;}
}
for(int i=n-1;i>=0;i--){
if(s[i]=='1')o[i]=++ot;
else{chmax(--ot,0);o[i]=ot;}
}
int ans=0;
ot=zt=0;
for(int i=0;i<n;i++){
if(s[i]=='0'){
chmax(ans,++zt);
chmax(--ot,0);
}
else if(s[i]=='1'){
chmax(ans,++ot);
chmax(--zt,0);
}
else{
if(zt+z[i+1]>ot+o[i+1]){
chmax(ans,++ot);
chmax(--zt,0);
}
else{
chmax(ans,++zt);
chmax(--ot,0);
}
}
}
int ans2=ans;
ans=ot=zt=0;
for(int i=0;i<n;i++){
if(s[i]=='0'){
chmax(ans,++zt);
chmax(--ot,0);
}
else if(s[i]=='1'){
chmax(ans,++ot);
chmax(--zt,0);
}
else{
if(zt+z[i+1]>=ot+o[i+1]){
chmax(ans,++ot);
chmax(--zt,0);
}
else{
chmax(ans,++zt);
chmax(--ot,0);
}
}
}
cout<<min(ans,ans2)<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_back
#define fi first
#define se second
#define SZ(x) ((int)(x.size()))
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline ll read(){
ll x = 0; char ch = gc(); bool positive = 1;
for (; !isdigit(ch); ch = gc()) if (ch == '-') positive = 0;
for (; isdigit(ch); ch = gc()) x = x * 10 + ch - '0';
return positive ? x : -x;
}
inline void write(ll a){
if(a<0){
a=-a; putchar('-');
}
if(a>=10)write(a/10);
putchar('0'+a%10);
}
inline void writeln(ll a){write(a); puts("");}
inline void wri(ll a){write(a); putchar(' ');}
ll rnd(){
ull ans=0;
For(i,0,4)ans=ans<<15^rand();
return ans%((ull)1<<63);
}
const int N=1000005;
char ch[N];
int ans;
int main(){
#ifdef Brollan
//freopen("1.in","r",stdin);
#endif
scanf("%s",ch+1);
int n=strlen(ch+1);
int x=0,y=0;
Rep(i,n,1){
if(ch[i]=='0'){x++; y--;}
else if(ch[i]=='1'){x--; y++;}
else {x--; y--;}
x=max(x,0);
y=max(y,0);
ans=max(ans,max(x,y));
}
int l=0,r=ans,sum=ans,zt=1;
For(i,1,n){
if(l==r)zt=0;
if(ch[i]=='0'){
l++; r++;
if(r>sum){if(zt)r=sum; else {r=sum-1;}}
}else if(ch[i]=='1'){
l--; r--;
if(l<0){if(zt)l=0; else {l=1;}}
}else{
l--; r++;
if(r>sum){if(zt)r=sum; else {r=sum-1; }}
if(l<0){if(zt)l=0; else {l=1; }}
}
if(l>sum||r<0){
sum++; break;
}
//cout<<l<<" "<<r<<" mx:"<<mx<<" sum:"<<sum<<" "<<zt<<endl;
}
cout<<sum<<endl;
}
/*
20
01
40
50/31
41/22
23/04
14/05
*/ |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 1000010
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int mx,n,a[N],b[N];
char s[N];
void init(){
int sum=0;
for(int i=1;i<=n;++i){
sum+=(s[i]=='1'?1:-1);
mx=max(mx,sum);
a[i]=sum;
}
b[n]=a[n];
for(int i=n-1;i>=0;--i){
b[i]=max(a[i],b[i+1]);
}
}
int calc(int lim){
int mn=0,sum=0;
for(int i=1;i<=n;++i){
if(s[i]=='1')++sum;
else if(s[i]=='0')--sum;
else{
if(b[i]-a[i-1]+sum+2<=lim)++sum;
else --sum;
}
mn=min(mn,sum);
}
return mn;
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
init();
printf("%d\n",min(mx-calc(mx),mx+1-calc(mx+1)));
return 0;
}
|
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
#define LL long long
#define fgx cerr<<"--------------"<<endl;
#define dgx cerr<<"=============="<<endl;
inline int read(){
int x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
return x*f;
}
const int MAXN = 1000010;
const int INF = 2147483600;
int N; char s[MAXN+1]; int g[MAXN+1];
inline int fn(int x){
int mn=0,now=0;
for(int i=1;i<=N;i++){
if(s[i]=='1') ++now;
else if(s[i]=='0') --now;
else{
if(now+1+max(g[i+1],0)<=x) ++now;
else --now;
}
mn=min(mn,now);
} return x-mn;
}
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
scanf("%s",s+1); N=strlen(s+1); g[N+1]=0;
for(int i=N;i>=1;i--){
int val=(s[i]!='1'?-1:1);
g[i]=max(val,g[i+1]+val);
} int mx=0,now=0;
for(int i=1;i<=N;i++){ if(s[i]!='1') --now; else ++now; mx=max(mx,now); }
printf("%d\n",min(fn(mx),fn(mx+1)));
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int INF = 1e9;
int solve(string s, int up) {
int n = s.size();
vector <int> pref(n + 1);
for (int i = 0; i < n; ++i) {
int x;
if (s[i] == '1')
x = 1;
else
x = -1;
pref[i + 1] = pref[i] + x;
}
vector <int> suff(n + 1, -INF);
for (int i = n - 1; i >= 0; --i)
suff[i] = max(suff[i + 1], pref[i + 1]);
int rem = 0, cur = 0;
int mn = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '?') {
if (suff[i] + 2 * (rem + 1) <= up) {
++rem;
++cur;
}
else {
--cur;
}
}
else if (s[i] == '1') {
++cur;
}
else {
--cur;
}
//cout << "cur : " << cur << endl;
mn = min(mn, cur);
}
return up - mn;
}
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
string s;
cin >> s;
int n = s.size();
int mx = 0, cur = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') {
++cur;
}
else {
--cur;
}
mx = max(mx, cur);
}
cout << min(solve(s, mx), solve(s, mx + 1)) << endl;
} |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
template<class T> void read(T &x){
int f=0; x=0; char ch=getchar();
for(;!isdigit(ch);ch=getchar()) f|=(ch=='-');
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
if(f) x=-x;
}
const int N=1000005;
int f[N],n,mn,sum,mx;
char s[N];
int solve(){
n=strlen(s+1);
per(i,n,1){
f[i]=f[i+1];
if(s[i]=='0') f[i]--;
else f[i]++;
f[i]=min(f[i],0);
}
mn=f[1];
sum=mx=0;
rep(i,1,n){
if(s[i]=='0') sum--;
else if(s[i]=='1') sum++;
else{
if(sum-1+f[i+1]<mn) sum++;
else sum--;
}
mx=max(mx,sum);
}
return mx-mn;
}
int main(){
scanf("%s",s+1);
int n=strlen(s+1);
int ans=solve();
reverse(s+1,s+n+1);
ans=min(ans,solve());
rep(i,1,n){
if(s[i]=='1') s[i]='0';
else if(s[i]=='0') s[i]='1';
}
ans=min(ans,solve());
reverse(s+1,s+n+1);
ans=min(ans,solve());
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
char s[1010101];
int a[1010101];
int b[1010101];
int main()
{
scanf("%s", s + 1);
n = strlen(s + 1);
for(int i = 1; i <= n; i++)
{
if(s[i] == '1')
a[i] = 1;
else
a[i] = -1;
a[i] += a[i-1];
}
b[n] = a[n];
for(int i = n - 1; i >= 0; i--)
b[i] = max(b[i+1], a[i]);
int c = 0, mi = 0;
for(int i = 1; i <= n; i++)
{
if(s[i] == '?' && c + 2 + b[i] <= b[0])
c += 2;
mi = min(mi, a[i] + c);
}
int ans = 1e7;
ans = min(ans, b[0] - mi);
c = 0, mi = 0;
for(int i = 1; i <= n; i++)
{
if(s[i] == '?' && c + 2 + b[i] <= b[0] + 1)
c += 2;
mi = min(mi, a[i] + c);
}
ans = min(ans, b[0] + 1 - mi);
printf("%d\n", ans);
return 0;
} |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#include <assert.h>
#include <bitset>
#define Endl endl
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define over(A) {cout<<A<<endl;exit(0);}
#define all(A) A.begin(),A.end()
#define ceil(a,b) ((a-1)/b+1)
#define quickcin ios_base::sync_with_stdio(false);
const int mod=1e9+7;
const int inf=1039074182;
const ll llinf=1LL*inf*inf;
using namespace std;
template <typename T1,typename T2> inline void chmin(T1 &x,T2 b) {if(b<x) x=b;}
template <typename T1,typename T2> inline void chmax(T1 &x,T2 b) {if(b>x) x=b;}
template <typename T1,typename T2> inline void chadd(T1 &x,T2 b) {x+=b;if(x>=mod) x-=mod;}
template <typename T1,typename T2> inline void chmul(T1 &x,T2 b) {x=1LL*x*b%mod;}
template <typename T1,typename T2> inline void chmod(T1 &x,T2 b) {x%=b,x+=b;if(x>=b) x-=b;}
string s;
int n;
int sum[1000005];
int maxch[1000005];
int main(){
cin>>s;
n=s.size();
string ts=s;
int mx=0;
for(int i=0;i<n;i++){
sum[i]=(i?sum[i-1]:0)+(s[i]=='1'?1:-1);
chmax(mx,sum[i]);
}
int res=inf;
for(int k=0;k<2;k++){
s=ts;
int mx=0;
for(int i=0;i<n;i++){
sum[i]=(i?sum[i-1]:0)+(s[i]=='1'?1:-1);
chmax(mx,sum[i]);
}
mx+=k;
for(int i=n-1;i>=0;i--){
maxch[i]=min((i==n-1?inf:maxch[i+1]),(mx-sum[i])/2);
}
int ss=0;
for(int i=0;i<n;i++){
if(s[i]!='?'){
continue;
}
if(ss<maxch[i]){
ss++;
s[i]='1';
}
}
for(int i=0;i<n;i++){
if(s[i]=='?') s[i]='0';
}
int mn=0;
for(int i=0;i<n;i++){
sum[i]=(i?sum[i-1]:0)+(s[i]=='1'?1:-1);
chmin(mn,sum[i]);
}
chmin(res,mx-mn);
}
cout<<res<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
template<typename T,typename... A>
void err(T a,A... x){cout << a << ' '; err(x...);}
#else
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;
template<class T> void mkuni(vector<T>&v)
{
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
}
template<class T>
void print(T x,int suc=1)
{
cout<<x;
if(suc==1) cout<<'\n';
else cout<<' ';
}
template<class T>
void print(const vector<T>&v,int suc=1)
{
for(int i=0;i<v.size();i++)
print(v[i],i==(int)(v.size())-1?suc:2);
}
const int INF=0x3f3f3f3f;
string s;
int solve(int x)
{
int n=s.length();
vi pre(n);
vi suf(n);
for(int i=0;i<n;i++)
{
if(s[i]=='1') pre[i]=1;
else pre[i]=-1;
if(i) pre[i]+=pre[i-1];
}
for(int i=n-1;i>=0;i--)
{
suf[i]=pre[i];
if(i!=n-1) suf[i]=max(suf[i],suf[i+1]);
}
int mi=0;
int cur=0;
for(int i=0;i<n;i++)
{
if(s[i]=='?'&&suf[i]+2+cur<=x)
cur+=2;
mi=min(mi,pre[i]+cur);
}
return x-mi;
}
int main()
{
cin>>s;
if(s.length()==1)
{
print(1);
return 0;
}
int cur=0,mx=0;
for(auto u:s)
{
if(u=='?'||u=='0')
cur--;
else cur++;
mx=max(mx,cur);
}
//dbg(mx);
//for(int i=mx;i<mx+20;i++) dbg(i,solve(i));
print(min(solve(mx),solve(mx+1)));
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
std::string s; std::cin >> s;
int da[4], db[4];
da[0] = db[0] = da[3] = -1;
da[1] = db[1] = db[3] = 1;
int a0 = 0, a1 = 1, b0 = 0, b1 = -1;
int c0 = a0-b0, c1 = a0-b1, c2 = a1-b0, c3 = a1-b1;
for(auto c: s) {
a0 += da[c&3]; if(a0 < 0) a0 = 1;
a1 += da[c&3]; if(a1 < 0) a1 = 1;
b0 += db[c&3]; if(b0 > 0) b0 = -1;
b1 += db[c&3]; if(b1 > 0) b1 = -1;
c0 = std::max(c0, a0-b0);
c1 = std::max(c1, a0-b1);
c2 = std::max(c2, a1-b0);
c3 = std::max(c3, a1-b1);
}
fin(std::min(std::min(c0, c1), std::min(c2, c3)));
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= int(b); i++)
#define per(i, a, b) for (int i = (a); i >= int(b); i--)
using namespace std;
const int maxn = 1e6;
char s[maxn + 5];
int n, b[maxn + 5];
int solve(int low) {
int x = 0, hi = 0;
rep(i, 1, n) {
if (s[i] != '?') {
x += s[i] == '0' ? 1 : -1;
} else {
if (x - 1 + b[i + 1] >= low) x--;
else x++;
}
hi = max(hi, x);
}
return hi - low;
}
int main() {
scanf("%s", s + 1), n = strlen(s + 1);
per(i, n, 1) b[i] = min(0, b[i + 1] + (s[i] != '1' ? 1 : -1));
printf("%d\n", min(solve(b[1]), solve(b[1] - 1)));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
char s[maxn];
int n;
int L[maxn], R[maxn], par[maxn];
bool check(int mid)
{
for(int i = 0; i <= n; ++i) L[i] = R[i] = par[i] = 0;
L[n] = 0; R[n] = mid;
for(int i = n - 1; ~i; --i)
{
if(s[i + 1] == '0')
{
L[i] = L[i + 1] + 1;
R[i] = min(mid, R[i + 1] + 1);
if(par[i + 1] && R[i + 1] == mid) R[i] = min(R[i], mid - 1);
}
else if(s[i + 1] == '1')
{
L[i] = max(0, L[i + 1] - 1);
R[i] = R[i + 1] - 1;
if(par[i + 1] && L[i + 1] == 0) L[i] = max(L[i], 1);
}
else
{
L[i] = max(0, L[i + 1] - 1);
R[i] = min(mid, R[i + 1] + 1);
if(par[i + 1])
{
if(L[i + 1] == 0) L[i] = max(L[i], 1);
if(R[i + 1] == mid) R[i] = min(R[i], mid - 1);
}
}
if(L[i] > R[i]) return 0;
if(L[i] == R[i] || par[i + 1]) par[i] = 1;
}
return 1;
}
int main()
{
scanf("%s", s + 1);
n = strlen(s + 1);
int l = 1, r = n;
while(l <= r)
{
int mid = l + r >> 1;
if(check(mid)) r = mid - 1;
else l = mid + 1;
}
printf("%d\n", l);
return 0;
} |
#include <cstdio>
#include <cstring>
#include <vector>
int main()
{
static char s[1000010];
scanf("%s",s);
int n=strlen(s);
std::vector<int> down(n+1);
down[n]=0;
int c=0;
for(int i=n-1;i>=0;i--){
down[i]=(s[i]=='0'?down[i+1]-1:std::min(down[i+1]+1,0));
}
int m=down[0];
int ans=n;
for(int b=0;b<2;b++){
int M=0,c=0;
for(int i=0;i<n;i++){
if(s[i]=='0'||(s[i]=='?'&&c-1+down[i+1]>=m-b)){
c--;
}
else{
c++;
}
M=std::max(M,c);
}
ans=std::min(ans,M-(m-b));
}
printf("%d\n",ans);
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<iostream>
#define RI register int
#define CI const int&
using namespace std;
const int N=1000005;
char s[N]; int n,pfx[N],smi[N];
inline int work(CI mi)
{
RI i; int cur=0,mx=0; for (i=1;i<=n;++i)
{
if (s[i]=='?'&&smi[i]-cur-2>=mi) cur+=2;
mx=max(mx,pfx[i]-cur);
}
return mx-mi;
}
int main()
{
RI i; for (scanf("%s",s+1),n=strlen(s+1),i=1;i<=n;++i)
pfx[i]=pfx[i-1]+(s[i]=='0'?-1:1); smi[n]=pfx[n];
for (i=n-1;~i;--i) smi[i]=min(smi[i+1],pfx[i]);
return printf("%d",min(work(smi[0]),work(smi[0]-1))),0;
} |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif
#define sz(x) ((int) (x).size())
#define TASK "text"
const int inf = (int) 1.01e9;
const long long infll = (long long) 1.01e18;
const ld eps = 1e-9;
const ld pi = acos((ld) -1);
#ifdef DEBUG
mt19937 mrand(300);
#else
mt19937 mrand(chrono::steady_clock::now().time_since_epoch().count());
#endif
int rnd(int x) {
return mrand() % x;
}
void precalc() {
}
const int maxn = (int) 1e6 + 5;
char tmp[maxn];
int n;
string s;
bool read() {
if (scanf("%s", tmp) < 1) {
return false;
}
s = tmp;
n = sz(s);
return true;
}
bool check(int len) {
int l = 0, r = len;
bool odd = false;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
l--;
r--;
} else if (s[i] == '1') {
l++;
r++;
} else {
l--;
r++;
}
if (l < 0) {
l += 1 + (int) odd;
}
if (r > len) {
r -= 1 + (int) odd;
}
if (l > r) {
return false;
}
if (l == r) {
odd = true;
}
}
return true;
}
void solve() {
int l = 0, r = n;
while (l < r - 1) {
int m = (l + r) / 2;
if (check(m)) {
r = m;
} else {
l = m;
}
}
printf("%d\n", r);
}
int main() {
precalc();
#ifdef DEBUG
assert(freopen(TASK ".in", "r", stdin));
assert(freopen(TASK ".out", "w", stdout));
#endif
while (read()) {
solve();
#ifdef DEBUG
eprintf("Time %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
}
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
std::string s; std::cin >> s;
int da[4], db[4];
da[1] = db[0] = da[3] = db[3] = -1;
da[0] = db[1] = 1;
int ma = 0, mb = 0;
int a[2] = {-1, 0}, b[2] = {-1, 0};
for(int i = 0; i < s.size(); ++i) {
char c = s[i];
ma += da[c&3]; if(ma < 0) ma = 0;
mb += db[c&3]; if(mb < 0) mb = 0;
a[i&1] = std::max(a[i&1], ma);
b[i&1] = std::max(b[i&1], mb);
}
ma = std::max(a[0], a[1]); if(a[0] == a[1]) ++ma;
mb = std::max(b[0], b[1]); if(b[0] == b[1]) ++mb;
fin(std::max(ma, mb));
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define uint unsigned int
#define ull unsigned long long
#define inf 1010000000
#define infll 1010000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define mpr make_pair
#define fi first
#define se second
#define pq priority_queue<int>
#define pqll priority_queue<ll>
#define up(x,y) (x<(y)?x=(y):0)
#define dn(x,y) (x>(y)?x=(y):0)
#define ad(x,y) (x=(x+(y))%mod)
#define cbn(x,y) ((ll)fac[x]*inv[y]%mod*inv[(x)-(y)]%mod)
using namespace std;
int read(); ll readll();
int n; char ch[1000009];
bool check(int B){
int i,x=0,y=B,z=2;
for (i=1; i<=n; i++) if (ch[i]=='0'){
x--; y--; if (z<2) z^=1;
if (x<0) x=0; if (z<2 && (x&1)!=z) x=1;
if (x>y) return 0;
} else if (ch[i]=='1'){
x++; y++; if (z<2) z^=1;
if (y>B) y=B; if (z<2 && (y&1)!=z) y--;
if (x>y) return 0;
} else{
if (z==2){
if (x==y) z=y&1^1; x--; y++;
if (x<0) x=0; if (z<2 && (x&1)!=z) x++;
if (y>B) y=B; if (z<2 && (y&1)!=z) y--;
if (x>y) return 0;
} else{
x--; y++; z^=1;
if (x<0) x=0; if ((x&1)!=z) x++;
if (y>B) y=B; if ((y&1)!=z) y--;
if (x>y) return 0;
}
}
return 1;
}
int main(){
scanf("%s",ch+1); n=strlen(ch+1);
int l=1,r=n,mid;
while (l<r){
mid=l+r>>1;
if (check(mid)) r=mid; else l=mid+1;
}
printf("%d\n",l);
return 0;
}
int read(){
int x=0; char ch=getchar(); bool flag=0;
while (ch<'0' || ch>'9'){ if (ch=='-') flag=1; ch=getchar(); }
while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
return flag?-x:x;
}
ll readll(){
ll x=0; char ch=getchar(); bool flag=0;
while (ch<'0' || ch>'9'){ if (ch=='-') flag=1; ch=getchar(); }
while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
return flag?-x:x;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
typedef pair<int,int> PII;
typedef vector<int> VInt;
#define FOR(i, a, b) for(i = (a); i < (b); ++i)
#define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i)
#define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
#define MP make_pair
bool check(string& S, int limit)
{
int i;
int a = 0, b = limit, step = 1;
FOR(i, 0, SIZE(S))
{
if(S[i] == '0')
{
--a;
--b;
}
else if(S[i] == '1')
{
++a;
++b;
}
else
{
--a;
++b;
}
if(a < 0) a += step;
if(b > limit) b -= step;
if(a > b) return false;
if(a == b) step = 2;
}
return true;
}
void SolveTest(int test)
{
string S;
cin >> S;
int mn = 0, mx = SIZE(S);
while(mx - mn > 1)
{
int md = (mx + mn)/2;
if(check(S, md)) mx = md;
else mn = md;
}
cout << mx << endl;
}
int main()
{
int T, t;
T = 1;
FOR(t, 0, T) SolveTest(t);
return 0;
}; |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <complex>
#include <vector>
#include<limits>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const long double pi = 3.141592653589793;
#define debug(x) cout << #x << " = " << (x) << endl;
#define rep(i, n) for(int i = 0;i < n;i++)
#define repi(i, j, n) for(int i = j;i < n;i++)
#define pb push_back
#define mp make_pair
#define mod 998244353
#define F first
#define S second
char ch;
int A[1 << 20], B[1 << 20], C[1 << 20], N = 1;
int solve(int M) {
int max_left = 0, max_min = 0;
int ops = 0;
for(int i = 1;i < N;i++) {
if(B[i] && (C[i] + 2*(ops + 1) <= M)) {
ops += 1;
}
int to_add = 2*ops;
max_min = min(A[i] + to_add, max_min);
max_left = max(A[i] + to_add, max_left);
}
// debug(M);
// debug(max_min);
return M - max_min;
}
int main() {
// freopen("input.in","r",stdin);
//freopen("output.out","w",stdout);
while(cin>>ch) {
A[N] = (ch == '1' ? 1 : -1);
if(ch == '?') B[N] = 1;
N += 1;
}
int Z = A[0];
for(int i = 1;i < N;i++) {
A[i] += A[i-1];
Z = max(Z, A[i]);
}
C[N-1] = A[N-1];
for(int i = N-2;i >= 1;i--) {
C[i] = max(A[i], C[i+1]);
}
// rep(i,4) cout<<A[i+1]<<" "<<B[i+1] << " "<<C[i+1]<<endl;
cout << min(solve(Z), solve(Z+1)) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read(){
ll a=0,b=getchar(),c=1;
while(!isdigit(b))c=b=='-'?-1:1,b=getchar();
while(isdigit(b))a=a*10+b-'0',b=getchar();
return a*c;
}
int n,ans;
char s[1200005];
bool check(int t){
int l=0,r=t,p=0;
for(int i=1;i<=n;i++){
if(s[i]=='0')l++,r++;
if(s[i]=='1')l--,r--;
if(s[i]=='?')l--,r++;
if(!p){
l=max(l,0);
r=min(r,t);
}
else{
if(l<0)l=1;
if(r>t)r=t-1;
}
if(l>r)return 0;
if(l==r)p=1;
}
return 1;
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
int l=1,r=n;
while(l<=r){
int mid=(l+r)>>1;
if(check(mid))
ans=mid,r=mid-1;
else l=mid+1;
}
printf("%d",ans);
return 0;
} |
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <vector>
#define TRACE(x) std::cout << #x << " = " << x << "\n"
#define _ << " _ " <<
using namespace std;
const int MAX = 1001000;
int fl[MAX][2], fr[MAX][2];
int main() {
std::ios_base::sync_with_stdio(false);
string S;
cin >> S;
int N = S.size();
auto can = [&](int K) -> bool {
for (int i = 0; i <= N; ++i) {
for (int j = 0; j < 2; ++j) {
fl[i][j] = MAX, fr[i][j] = -MAX;
}
}
fl[0][0] = 0, fr[0][0] = K - (K % 2 ? 1 : 0);
fl[0][1] = 1, fr[0][1] = K - (K % 2 ? 0 : 1);
for (int i = 0; i <= N; ++i) {
for (int j = 0; j < 2; ++j) {
fl[i][j] = max(fl[i][j], fl[0][j]);
fr[i][j] = min(fr[i][j], fr[0][j]);
if (fl[i][j] > fr[i][j]) fl[i][j] = MAX, fr[i][j] = -MAX;
}
if (i == N) break;
if (S[i] == '0') {
for (int j = 0; j < 2; ++j) {
fl[i + 1][j ^ 1] = fl[i][j] - 1;
fr[i + 1][j ^ 1] = fr[i][j] - 1;
}
} else if (S[i] == '1') {
for (int j = 0; j < 2; ++j) {
fl[i + 1][j ^ 1] = fl[i][j] + 1;
fr[i + 1][j ^ 1] = fr[i][j] + 1;
}
} else {
for (int j = 0; j < 2; ++j) {
fl[i + 1][j ^ 1] = fl[i][j] - 1;
fr[i + 1][j ^ 1] = fr[i][j] + 1;
}
}
}
return fl[N][0] <= fr[N][0] || fl[N][1] <= fr[N][1];
};
int lo = 0, hi = N;
while (lo < hi) {
int mid = (lo + hi) / 2;
if (can(mid))
hi = mid;
else
lo = mid + 1;
}
cout << lo << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define debug(x) cerr<<#x<<": "<<x<<endl
#define trav(a,x) for(auto &a:x)
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin>>s;
int n = sz(s);
int lo = 1, hi = n;
while(lo<hi) {
int mid = (lo+hi)/2;
bool either = false;
rep(par,0,2) {
int l = par;
int r = mid-(mid%2);
if(mid%2==0) r-=par;
else r+=par;
bool ok = true;
rep(i,0,n) {
if(s[i]=='0') {
++l;
++r;
if(r>mid) r-=2;
}
else if(s[i]=='1') {
--r;
--l;
if(l<0) l+=2;
}
else {
if(r+1<=mid) ++r;
else --r;
if(l-1>=0) --l;
else ++l;
}
if(l>r) {
ok = false;
break;
}
}
if(ok) either = true;
}
if(either) hi = mid;
else lo = mid+1;
}
cout<<lo<<"\n";
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
std::string s; std::cin >> s;
int ans = s.size();
int aa[] = {0, 1, 0, 1};
int bb[] = {0, -1, -1, 0};
for(int i = 0; i < 4; ++i) {
int a = aa[i], b = bb[i];
int cur = a-b;
for(auto c: s) {
if(c=='0') { --a; --b; }
else if(c=='1') { ++a; ++b; }
else { --a; ++b; }
if(a < 0) a += 2;
if(b > 0) b -= 2;
cur = std::max(cur, a-b);
}
ans = std::min(ans, cur);
}
fin(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n;
char s[N];
int sum[N], pmx[N], pmi[N];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
sum[0] = 0;
pmx[0] = 0;
pmi[0] = 0;
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + 1 - 2 * (s[i] == '0');
pmx[i] = max(pmx[i - 1], sum[i]);
pmi[i] = min(pmi[i - 1], sum[i]);
}
int suf_mi = sum[n], suf_mx = sum[n];
int ans = pmx[n] - pmi[n];
for (int i = n; i; i--) {
suf_mi = min(suf_mi, sum[i]);
suf_mx = max(suf_mx, sum[i]);
if (s[i] == '?') {
if (pmx[i - 1] + 1 < suf_mx) {
suf_mx -= 2;
suf_mi -= 2;
ans = min(ans, max(pmx[i - 1], suf_mx) - min(pmi[i - 1], suf_mi));
}
}
}
suf_mi = sum[n], suf_mx = sum[n];
bool found = false;
for (int i = n; i; i--) {
suf_mi = min(suf_mi, sum[i]);
suf_mx = max(suf_mx, sum[i]);
if (s[i] == '?') {
if (pmx[i - 1] + 1 == suf_mx) {
ans = min(ans, max(pmx[i - 1], suf_mx - 2) - min(pmi[i - 1], suf_mi - 2));
if (!found) {
suf_mi -= 2;
suf_mx -= 2;
found = true;
}
} else if (pmx[i - 1] + 1 < suf_mx) {
suf_mx -= 2;
suf_mi -= 2;
ans = min(ans, max(pmx[i - 1], suf_mx) - min(pmi[i - 1], suf_mi));
}
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) ((x).size()))
typedef long long ll;
typedef long double ld;
int n;
string s;
int isPos(int u) {
int l = 0, h = u;
bool d = u == 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
l--, h--;
else if (s[i] == '1')
l++, h++;
else
l--, h++;
if (!d)
l = max(l, 0), h = min(h, u);
else {
if (l < 0)
l += 2;
if (h > u)
h -= 2;
}
if (l == h)
d = true;
if (l > h)
return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
cin >> s;
n = sz(s);
int l = -1, r = n;
while (l + 1 < r) {
int m = (l + r) / 2;
if (isPos(m))
r = m;
else
l = m;
}
cout << r << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef double D;
typedef long long int LL;
#define st first
#define nd second
#define PLL pair <LL, LL>
#define PII pair <int, int>
const int N = 1e6 + 7;
const int MX = 1e9 + 7;
const LL INF = 1LL * MX * MX;
int n;
char in[N];
int limit[N];
int check(int v){
int zeroes = 0, ones = 0, mx = 0;
for(int i = 1; i <= n; ++i){
char c = in[i];
if(c == '0'){
++zeroes;
}
else if(c == '1'){
++ones;
mx = max(mx, ones - zeroes);
}
else{
if(zeroes - ones + limit[i] + 1 <= v)
++zeroes;
else{
++ones;
mx = max(mx, ones - zeroes);
}
}
}
return mx + v;
}
int main(){
scanf("%s", in + 1);
n = strlen(in + 1);
int mx = 0;
for(int i = n; i >= 1; --i){
limit[i] = mx;
if(in[i] == '0'){
++mx;
}
else{
--mx;
if(mx < 0)
mx = 0;
}
}
int ans = N;
int s = mx, e = n;
while(e - s >= 5){
int mid = (s + e) / 2;
int Left = min(check(mid - 1), check(mid));
int Right = min(check(mid + 1), check(mid + 2));
ans = min(ans, min(Left, Right));
if(Left < Right)
e = mid;
else
s = mid + 1;
}
for(int i = s; i <= e; ++i)
ans = min(ans, check(i));
printf("%d\n", ans);
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
std::string s; std::cin >> s;
int da[4], db[4];
da[0] = db[0] = da[3] = -1;
da[1] = db[1] = db[3] = 1;
int a = 0, b = 0, m = 0, M = 0;
int c0 = a-b, c1 = c0 + 1, c2 = c0 + 1, c3 = c0 + 2;
for(auto c: s) {
a += da[c&3]; if(a < 0) { a += 1; m ^= 1; }
b += db[c&3]; if(b > 0) { b -= 1; M ^= 1; }
c0 = std::max(c0, a-b+m+M);
c1 = std::max(c1, a-b+m+(M^1));
c2 = std::max(c2, a-b+(m^1)+M);
c3 = std::max(c3, a-b+(m^1)+(M^1));
}
fin(std::min(std::min(c0, c1), std::min(c2, c3)));
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>;
#define llinf ((long long)1e18)
#define inf int(1e9+1e6)
#define maxn (1000006)
ll n,psum[maxn];
string A;
int main(){
FAST
cin>>A;
n=A.size();
A='*'+A;
FOR(i,1,n){
psum[i]=psum[i-1]+(A[i] == '1' ? 1 : -1);
}
ll Z = *max_element(psum, psum+n+1);
auto f=[&](ll x){
mmst(psum,0);
FOR(i,1,n){
psum[i]=psum[i-1]+(A[i] == '1' ? 1 : -1);
}
vector<ll> suf_max(n+2, -llinf);
DEC(i,n,1)suf_max[i]=max(suf_max[i+1], psum[i]);
ll change=0;
FOR(i,1,n){
if(A[i] == '?'){
if(suf_max[i] + 2 * (change+1) <= x) ++ change;
}
psum[i] += 2 * change;
}
return *min_element(psum, psum+n+1);
};
cout<<min(Z - f(Z), Z+1 - f(Z+1))<<'\n';
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
//#define debug(x) ;
#define debug(x) cerr << #x << " = " << x << "\n";
ostream& operator<<(ostream& cerr, vector<ll> aux) {
cerr << "[";
for (auto e : aux) cerr << e << ' ';
cerr << "]";
return cerr;
}
const int maxN = 1000011;
int n, curr, z;
char s[maxN];
int aux[maxN];
stack<int> where;
int check(int lower) {
int higher = 0;
curr = 0;
while (!where.empty()) where.pop();
for (int i = 0; i < n; i++) {
aux[i] = (s[i] == '1' ? +1 : -1);
curr += aux[i];
if (s[i] == '?') where.push(i);
if (curr < lower) {
aux[where.top()] = 1;
where.pop();
curr += 2;
}
}
while (!where.empty()) where.pop();
for (int i = 0; i < n; i++) {
if (i > 0) aux[i] += aux[i - 1];
higher = max(higher, aux[i]);
}
return higher - lower;
}
int main()
{
//freopen("test.in", "r", stdin);
scanf("%s", s);
n = strlen(s);
for (int i = 0; i < n; i++) {
curr += (s[i] == '0' ? -1 : +1);
z = min(z, curr);
}
printf("%d", min(check(z), check(z - 1)));
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = s.size();
while (left < right) {
int mid = (left + right) / 2;
bool flag = false;
for (int base = 0; !flag && base <= 1; base++) {
int low = base;
int high = mid;
if ((high - low) & 1) {
high--;
}
bool ok = high >= low;
for (int i = 0; ok && i < s.size(); i++) {
if (s[i] == '1' || low < 1) {
low++;
}
else {
low--;
}
if (s[i] == '0' || high > mid - 1) {
high--;
}
else {
high++;
}
ok = high >= low;
}
flag = ok;
}
if (flag) {
right = mid;
}
else {
left = mid + 1;
}
}
cout << left << endl;
} |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int,int>
#define pll pair<ll,ll>
#define IT iterator
#define PB push_back
#define fi first
#define se second
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define CLR(a,v) memset(a,v,sizeof(a));
#define CPY(a,b) memcpy(a,b,sizeof(a));
#define debug puts("wzpakking")
#define y1 ysghysgsygsh
using namespace std;
const int N=1000005;
char s[N];
int n;
bool check(int v){
int l0=0,r0=v,l1=1,r1=v;
v&1?r0--:r1--;
For(i,1,n){
int nl0=1e9,nr0=-1e9;
int nl1=1e9,nr1=-1e9;
if (s[i]!='1'){
if (l1<=r1){
nl0=min(nl0,l1-1);
nr0=max(nr0,r1-1);
}
if (l0<=r0){
nl1=min(nl1,l0-1);
nr1=max(nr1,r0-1);
}
}
if (s[i]!='0'){
if (l1<=r1){
nl0=min(nl0,l1+1);
nr0=max(nr0,r1+1);
}
if (l0<=r0){
nl1=min(nl1,l0+1);
nr1=max(nr1,r0+1);
}
}
if (nl0<0) nl0+=2;
if (nr0>v) nr0-=2;
if (nl1<0) nl1+=2;
if (nr1>v) nr1-=2;
//cout<<l0<<' '<<l1<<' '<<r0<<' '<<r1<<endl;
l0=nl0; l1=nl1; r0=nr0; r1=nr1;
//cout<<l0<<' '<<l1<<' '<<r0<<' '<<r1<<endl;
}
return l0<=r0||l1<=r1;
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
int l=1,r=n,ans=-1;
while (l<=r){
int mid=(l+r)/2;
if (check(mid))
ans=mid,r=mid-1;
else l=mid+1;
}
cout<<ans;
}
/*
>_<
*/ |
/***************************************************************
File name: B.cpp
Author: huhao
Create time: Sun 07 Jun 2020 08:22:30 PM CST
***************************************************************/
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define fr(i,a,b) for(int i=(a),end_##i=(b);i<=end_##i;i++)
#define fd(i,a,b) for(int i=(a),end_##i=(b);i>=end_##i;i--)
int read()
{
int r=0,t=1,c=getchar();
while(c<'0'||c>'9')
{
t=c=='-'?-1:1;
c=getchar();
}
while(c>='0'&&c<='9')
{
r=r*10+c-48;
c=getchar();
}
return r*t;
}
const int N=1000010;
int f,g,F,G,n;
char s[N];
void solve(int m,int w,int l,int r)
{
if(l<0){ f=std::max(f,m); l+=2; }
if(r>w){ g=std::max(g,m); r-=2; }
if(l>r) return ;
if(m>n){ printf("%d\n",w); exit(0); }
if(s[m]=='0') solve(m+1,w,l+1,r+1);
else if(s[m]=='1') solve(m+1,w,l-1,r-1);
else solve(m+1,w,l-1,r+1);
}
int main()
{
scanf("%s",s+1); n=strlen(s+1);
f=g=1;
fr(i,1,n)
{
F=f; G=g; f=-1; g=-1;
if(F!=-1) solve(F,i,0,0);
if(G!=-1) solve(G,i,i,i);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
constexpr int MX = 1000005;
char s[MX];
int ac[MX], am[MX], t, n, z, mi[2], aa[2];
int main(){
scanf("%s", s);
n = strlen(s);
rep(i,n) z = max(z, ac[i] = t += s[i] == '1' ? 1 : -1);
am[n-1] = ac[n-1];
for(int i=n-2; i>=0; i--) am[i] = max(am[i+1], ac[i]);
rep(i,n) rep(j,2){
if(s[i] == '?' && am[i] + aa[j] + 2 <= z + j) aa[j] += 2;
if(mi[j] > ac[i] + aa[j]) mi[j] = ac[i] + aa[j];
}
printf("%d\n", min(z-mi[0],z+1-mi[1]));
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
std::string s; std::cin >> s;
int da[4], db[4];
da[1] = db[0] = da[3] = db[3] = -1;
da[0] = db[1] = 1;
int a0 = 0, b0 = 0, a1 = -1, b1 = -1, ma = 0, mb = 0;
for(int i = 0; i < s.size(); ++i) {
char c = s[i];
ma += da[c&3]; if(ma < 0) ma = 0;
mb += db[c&3]; if(mb < 0) mb = 0;
if(i&1) {
a0 = std::max(a0, ma);
b0 = std::max(b0, mb);
} else {
a1 = std::max(a1, ma);
b1 = std::max(b1, mb);
}
}
ma = std::max(a0, a1); if(a0 == a1) ++ma;
mb = std::max(b0, b1); if(b0 == b1) ++mb;
fin(std::max(ma, mb));
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f;
}
char s[MAXN];
int n, a[MAXN], sMin[MAXN]; bool b[MAXN];
void init() {
for (int i = 1; i <= n; i++) {
if (s[i] == '0') a[i] = a[i - 1] - 1;
else a[i] = a[i - 1] + 1;
if (s[i] == '?') b[i] = true;
}
sMin[n + 1] = n + 5;
for (int i = n; i >= 0; i--)
sMin[i] = min(sMin[i + 1], a[i]);
}
int work(int limit) {
int mns = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == '?' && sMin[i] - mns - 2 >= limit) {
b[i] = false;
mns += 2;
}
a[i] -= mns;
}
int Max = 0;
for (int i = 1; i <= n; i++)
chkmax(Max, a[i]);
return Max - limit;
}
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
int ans = n + 5, tmp = 0;
init(); chkmin(ans, work(sMin[0]));
init(); chkmin(ans, work(sMin[0] - 1));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define mem(a,k) memset(a,k,sizeof(a))
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
#define fore(i,v) for(int i=g[v],d=es[i].d;i;i=es[i].nxt,d=es[i].d)
using namespace std;
#define Pr(f,...) fprintf(stderr,f,##__VA_ARGS__),fflush(stderr)
typedef long long ll;
template<typename T>
void read(T &x){
x=0;
char c;
for(c=getchar();!isdigit(c);c=getchar());
for(;isdigit(c);c=getchar())x=x*10+c-'0';
}
const int N=1e6+50,P=1e9+7,oo=P;
int mul(int a,int b){ return 1ll*a*b%P; }
//int add(int a,int b){ a+=b; return a>=P?a-P:a; }
int sub(int a,int b){ a-=b; return a<0?a+P:a; }
int gcd(int a,int b){ return !b?a:gcd(b,a%b); }
int z,n,sum[N],mx[N],ans;
char s[N];
int main(int argc,char *argv[]){
#ifdef CURIOUSCAT
freopen("d.in","r",stdin);
#endif
scanf("%s",s+1);
z=0,n=strlen(s+1);
rep(i,1,n){
sum[i]=sum[i-1]+(s[i]=='1'?1:-1);
cmax(z,sum[i]);
}
mx[n+1]=-oo;
dec(i,n,1){
mx[i]=max(mx[i+1],sum[i]);
}
ans=oo;
lop(k,0,2){
int w=0,mn=0;
rep(i,1,n){
if(s[i]=='?'&&w+mx[i]+2<=z+k){
w+=2;
}
cmin(mn,w+sum[i]);
}
cmin(ans,z+k-mn);
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define cs const
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define bg begin
namespace IO{
cs int RLEN=1<<22|1;
char ibuf[RLEN],*ib,*ob;
inline char gc(){
(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob)?EOF:*ib++;
}
inline int read(){
char ch=gc();
int res=0;bool f=0;
while(!isdigit(ch))f=ch=='-',ch=gc();
while(isdigit(ch))res=(res*10)+(ch^48),ch=gc();
return f?-res:res;
}
inline ll readll(){
char ch=gc();
ll res=0;bool f=0;
while(!isdigit(ch))f=ch=='-',ch=gc();
while(isdigit(ch))res=(res*10)+(ch^48),ch=gc();
return f?-res:res;
}
inline int readstring(char *s){
int top=0;char ch=gc();
while(isspace(ch))ch=gc();
while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
s[top+1]='\0';return top;
}
}
using IO::read;
using IO::readll;
using IO::readstring;
template<typename tp>inline void chemx(tp &a,tp b){(a<b)?(a=b):0;}
template<typename tp>inline void chemn(tp &a,tp b){(a>b)?(a=b):0;}
cs int N=1000005;
int n,lmn,a[N];
char str[N];
int main(){
#ifdef Stargazer
freopen("lx.in","r",stdin);
#endif
n=readstring(str);
for(int i=1,s=0;i<=n;i++){
s+=(str[i]=='1')?1:-1;
chemx(lmn,s),a[i]=s;
}int res=1e9;
for(int i=n-1;i>=1;i--)chemx(a[i],a[i+1]);
for(int t=0;t<2;t++){
lmn+=t;int f=0;
for(int i=1,s=0,del=0;i<=n;i++){
if(str[i]=='?'&&a[i]+s+2<=lmn)s+=2;
del+=(str[i]=='1')?1:-1;
chemn(f,del+s);
}
chemn(res,lmn-f);
}cout<<res<<'\n';return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define Maxn 1000007
char s[Maxn];
int val[Maxn],sum[Maxn],r[Maxn];
bool flag[Maxn];
int n;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
memset(flag,false,sizeof(flag));
int mx=0;
for (int i=1;i<=n;i++)
{
if (s[i]=='1') val[i]=1;
else if (s[i]=='0') val[i]=-1;
else
{
flag[i]=true;
val[i]=-1;
}
sum[i]=sum[i-1]+val[i];
mx=max(mx,sum[i]);
}
r[n]=sum[n];
for (int i=n-1;i;i--)
r[i]=max(sum[i],r[i+1]);
int tmp=0;
for (int i=1;i<=n;i++)
if (flag[i])
{
if (r[i]+tmp+2<=mx)
{
tmp+=2;
val[i]=1;
}
}
int mn=0;
for (int i=1;i<=n;i++)
{
sum[i]=sum[i-1]+val[i];
mn=min(mn,sum[i]);
}
int ans=mx-mn;
++mx;
for (int i=1;i<=n;i++)
{
if (s[i]=='1') val[i]=1;
else if (s[i]=='0') val[i]=-1;
else
{
flag[i]=true;
val[i]=-1;
}
sum[i]=sum[i-1]+val[i];
}
r[n]=sum[n];
for (int i=n-1;i;i--)
r[i]=max(sum[i],r[i+1]);
tmp=0;
for (int i=1;i<=n;i++)
if (flag[i])
{
if (r[i]+tmp+2<=mx)
{
tmp+=2;
val[i]=1;
}
}
mn=0;
for (int i=1;i<=n;i++)
{
sum[i]=sum[i-1]+val[i];
mn=min(mn,sum[i]);
}
ans=min(ans,mx-mn);
printf("%d\n",ans);
return 0;
} |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_n;_i>=_a;--_i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(_a) ({REP(_i,1,n) cout<<_a[_i]<<',';hr;})
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+7, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}
ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}
inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}
//head
#ifdef __APPLE__
const int N = 1e2+50;
#else
const int N = 1e6+50;
#endif
int n, mi[N], sum[N];
char s[N];
int solve(int x) {
int tot = 0, now = 0, mx = 0;
REP(i,1,n) {
if (s[i]=='?') {
if (mi[i]-tot-2>=x) --now,tot+=2;
else ++now;
}
else if (s[i]=='0') --now;
else ++now;
mx = max(mx, now);
}
return mx;
}
int main() {
scanf("%s", s+1);
n = strlen(s+1);
REP(i,1,n) sum[i] = sum[i-1]+(s[i]=='0'?-1:1);
mi[n] = sum[n];
PER(i,0,n-1) mi[i] = min(mi[i+1], sum[i]);
printf("%d\n", min(solve(mi[0])-mi[0],solve(mi[0]-1)-mi[0]+1));
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#ifdef DEBUG
#define display(x) cerr << #x << " = " << (x) << endl;
#define displaya(a, st, n)\
{cerr << #a << " = {";\
for(int qwq = (st); qwq <= (n); ++qwq) {\
if(qwq == (st)) cerr << ((a)[qwq]);\
else cerr << ", " << ((a)[qwq]);\
} cerr << "}" << endl;}
#define displayv(v) displaya(v, 0, (int)(v).size() - 1)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define display(x) ;
#define displaya(a, st, n) ;
#define displayv(v) ;
#define eprintf(...) if(0) fprintf(stderr, "...")
#endif
template<typename T> bool chmin(T &a, const T &b) { return a > b ? a = b, true : false; }
template<typename T> bool chmax(T &a, const T &b) { return a < b ? a = b, true : false; }
template<typename A, typename B>
ostream& operator << (ostream& out, const pair<A, B> &p) {
return out << '(' << p.first << ", " << p.second << ')';
}
const int maxN = 1000000 + 5;
int n, s[maxN];
char a[maxN];
int work(int low) {
s[0] = 0;
for(int i = 1; i <= n; ++i) s[i] = s[i - 1] + 1 - 2 * int(a[i] == '0');
for(int i = n, pf = s[n]; i >= 1; --i) {
chmin(pf, s[i]);
s[i] = pf - s[i - 1];
}
displaya(s, 0, n);
int now = 0, mx = 0;
for(int i = 1; i <= n; ++i) {
if(a[i] == '0') now--;
else if(a[i] == '1') now++;
else {
if(now + s[i] - 2 >= low) now--;
else now++;
}
chmax(mx, now);
display(now);
}
return mx - low;
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
#endif
cin >> (a + 1);
n = strlen(a + 1);
s[0] = 0;
for(int i = 1; i <= n; ++i) s[i] = s[i - 1] + 1 - 2 * int(a[i] == '0');
int mn = *min_element(s, s + n + 1);
int a1 = work(mn);
int a2 = work(mn - 1);
eprintf("a1 = %d, a2 = %d\n", a1, a2);
cout << min(a1, a2) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T x=0,f=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
namespace run{
const int N=1e6+9;
int n,sum[N],g[N],ans=N;char s[N],t[N];
inline void solve(int Z){
for(int i=1;i<=n;i++) t[i]=s[i];
for(int i=n;i>=1;i--) g[i]=(Z-sum[i])/2;
for(int i=n-1;i>=1;i--) g[i]=min(g[i],g[i+1]);
// for(int i=1;i<=n;i++) cout<<g[i]<<" ";cout<<endl;
int now=0;
for(int i=1;i<=n;i++)
if(t[i]=='?'){
if(now<g[i]) t[i]='1',now++;
else t[i]='0';
}
int tmp=0,mn=0,mx=0;
for(int i=1;i<=n;i++){
tmp+=(t[i]=='1')*2-1;
mn=min(tmp,mn),mx=max(tmp,mx);
}
// for(int i=1;i<=n;i++) cout<<t[i]<<" ";cout<<endl;
// cout<<mn<<" "<<mx<<endl;
ans=min(ans,mx-mn);
}
int main(){
scanf("%s",s+1),n=strlen(s+1);
int Z=0;
for(int i=1;i<=n;i++) sum[i]=sum[i-1]+((s[i]=='1')*2-1),Z=max(Z,sum[i]);
// cout<<Z<<endl;
solve(Z),solve(Z+1);
printf("%d\n",ans);
return 0;
}
}
int main(){
#ifdef my
freopen(".in","r",stdin);
freopen(".out","w",stdout);
#endif
return run::main();
} |
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define N 1000012
int n,Z,a[N],s[N];char sc[N];
inline int calc(int m)
{
int i,sum=0,mi=0;
for(i=1;i<=n;i++){if(sc[i]=='?'){if(max(sum+1,sum+1+s[i+1])<=m)++sum;else --sum;}else sum+=a[i];mi=min(mi,sum);}return mi;
}
int main(){
scanf("%s",sc+1);n=strlen(sc+1);Z=0;int i,sum=0;
for(i=1;i<=n;i++){a[i]=(sc[i]=='1')?1:(-1);sum+=a[i];Z=max(Z,sum);}
s[n+1]=0;for(i=n;i>=1;i--)s[i]=max(s[i+1]+a[i],a[i]);printf("%d",min(Z-calc(Z),Z+1-calc(Z+1)));return 0;
} |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#include <assert.h>
#include <bitset>
#define Endl endl
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define over(A) {cout<<A<<endl;exit(0);}
#define all(A) A.begin(),A.end()
#define ceil(a,b) ((a-1)/b+1)
#define quickcin ios_base::sync_with_stdio(false);
const int mod=1e9+7;
const int inf=1039074182;
const ll llinf=1LL*inf*inf;
using namespace std;
template <typename T1,typename T2> inline void chmin(T1 &x,T2 b) {if(b<x) x=b;}
template <typename T1,typename T2> inline void chmax(T1 &x,T2 b) {if(b>x) x=b;}
template <typename T1,typename T2> inline void chadd(T1 &x,T2 b) {x+=b;if(x>=mod) x-=mod;}
template <typename T1,typename T2> inline void chmul(T1 &x,T2 b) {x=1LL*x*b%mod;}
template <typename T1,typename T2> inline void chmod(T1 &x,T2 b) {x%=b,x+=b;if(x>=b) x-=b;}
string s;
int n;
int sum[1000005];
int maxch[1000005];
int main()
{
// freopen("input.txt","r",stdin);
cin>>s;
n=s.size();
string ts=s;
int mx=0;
for(int i=0;i<n;i++)
{
sum[i]=(i?sum[i-1]:0)+(s[i]=='1'?1:-1);
chmax(mx,sum[i]);
}
int res=inf;
for(int k=0;k<2;k++)
{
s=ts;
int mx=0;
for(int i=0;i<n;i++)
{
sum[i]=(i?sum[i-1]:0)+(s[i]=='1'?1:-1);
chmax(mx,sum[i]);
}
mx+=k;
for(int i=n-1;i>=0;i--)
{
maxch[i]=min((i==n-1?inf:maxch[i+1]),(mx-sum[i])/2);
}
int ss=0;
for(int i=0;i<n;i++)
{
if(s[i]!='?') continue;
if(ss<maxch[i])
{
ss++;
s[i]='1';
}
}
for(int i=0;i<n;i++)
{
if(s[i]=='?') s[i]='0';
}
int mn=0;
for(int i=0;i<n;i++)
{
sum[i]=(i?sum[i-1]:0)+(s[i]=='1'?1:-1);
chmin(mn,sum[i]);
}
chmin(res,mx-mn);
}
cout<<res<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
string s;
int n,mi,p[1000010];
int tr(int x){
int mi=0;
for (int i=0,j=0;i<n;i++){if (s[i]=='1') j++;else j--;p[i]=(x-j)/2;}
for (int i=n-2;i>=0;i--)p[i]=min(p[i+1],p[i]);
for (int i=0,j=0,k=0;i<n;i++){
if (s[i]=='1')j++;if (s[i]=='0')j--;
if (s[i]=='?'){if (k<p[i])k++,j++;else j--;}
mi=min(mi,j);
}
return x-mi;
}
int main(){
cin>>s;n=s.length();mi=0;
for (int i=0,j=0;i<n;i++){if (s[i]=='1')j++;else j--;mi=max(mi,j);}
cout<<min(tr(mi),tr(mi+1))<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
cs int N = 1e6 + 50;
cs int INF = 1e9 + 7;
char S[N]; int n, a[N];
int chk(int lm){
static int sf[N];sf[n+1]=-INF;
for(int i=n; i>=0; i--)
sf[i]=max(sf[i+1],a[i]);
static bool o[N]; int t=0;
for(int i=1;i<=n;i++){
if(S[i]=='?'&&sf[i]+t+2<=lm)t+=2,o[i]=true;
else o[i]=false;
} int mn=0;
for(int i=1,sm=0;i<=n;i++){
if(S[i]=='?')sm+=o[i]?1:-1;
else sm+=(S[i]=='0')?-1:1;
mn=min(mn,sm);
} return lm-mn;
}
int main(){
#ifdef FSYolanda
freopen("1.in","r",stdin);
#endif
scanf("%s",S+1);n=strlen(S+1);
for(int i=1; i<=n; i++)
a[i]=a[i-1]+((S[i]=='1')?1:-1);
int mx=-INF;
for(int i=0; i<=n; i++)
mx=max(mx,a[i]);
cout<<min(chk(mx),chk(mx+1));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define N 1200000
int n,ans;
char s[N];
bool check(int t){
int l=0,r=t,p=0;
for (int i=1;i<=n;++i){
if (s[i]=='0'){++l; ++r;}
if (s[i]=='1'){--l; --r;}
if (s[i]=='?'){--l; ++r;}
if (!p){
l=max(l,0);
r=min(r,t);
}
else{
if (l<0) l=1;
if (r>t) r=t-1;
}
if (l>r) return 0;
if (l==r) p=1;
}
return 1;
}
int main(){
scanf("%s",s+1); n=strlen(s+1);
int l=1,r=n;
while (l<=r){
int mid=(l+r)>>1;
if (check(mid)){ans=mid; r=mid-1;}
else l=mid+1;
}
printf("%d\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using ld = long double;
using D = double;
using uint = unsigned int;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
const int maxn = 1000006;
char s[maxn];
int n;
bool can(int mxb)
{
//cout << "can " << mxb << endl;
for (int par = 0; par < 2; par++)
{
int low = par;
int high = (mxb % 2 == par ? mxb : mxb - 1);
if (low > high) continue;
assert(low % 2 == high % 2);
bool ok = true;
for (int i = 0; i < n; i++)
{
if (s[i] == '0')
{
if (low == 0) low = 1;
else low--;
high--;
} else if (s[i] == '1')
{
if (high == mxb) high = mxb - 1;
else high++;
low++;
} else if (s[i] == '?')
{
if (low == 0) low = 1;
else low--;
if (high == mxb) high = mxb - 1;
else high++;
} else assert(false);
//cout << i << ' ' << low << ' ' << high << endl;
if (low > high)
{
ok = false;
break;
}
}
if (ok) return true;
}
return false;
}
int main()
{
scanf("%s", s);
n = strlen(s);
int l = 0;
int r = n;
while (r - l > 1)
{
int m = (l + r) / 2;
if (can(m)) r = m;
else l = m;
}
printf("%d\n", r);
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define maxn 1000010
int n,sum[maxn],msum[maxn];
char s[maxn];
int main()
{
scanf("%s",s+1);n=strlen(s+1);
for(int i=1;i<=n;i++)sum[i]=sum[i-1]+(s[i]=='1'?1:-1);
msum[n]=sum[n];for(int i=n-1;i>=1;i--)msum[i]=max(msum[i+1],sum[i]);
int mx=max(msum[1],0),mn,now,ans=n+1;
for(int j=1;j<=2;j++)
{
now=mn=0;
for(int i=1;i<=n;i++)
{
if(s[i]=='?'){if(msum[i]-sum[i-1]+now+2<=mx)now++; else now--;}
else if(s[i]=='1')now++; else now--;
// printf("%c : %d %d %d\n",s[i],now,msum[i],sum[i-1]);
mn=min(mn,now);
}
ans=min(ans,mx-mn);mx++;
}
printf("%d",ans);
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long Int;
int main() {
string S;
cin >> S;
Int N;
N = S.size();
vector<Int> v(N, 0), sum(N, 0), m(N, 0);
Int Z = 0;
rep(i,N) {
if (S[i] == '1') v[i] = 1;
else v[i] = -1;
}
sum[0] = v[0];
Z = max(Z, v[0]);
rep1(i,N-1) {
sum[i] = sum[i-1] + v[i];
Z = max(Z, sum[i]);
}
//cout << Z << endl;
m[N-1] = sum[N-1];
Int tmp = sum[N-1];
rep(i,N-1) {
if (tmp >= sum[N-2-i]) m[N-2-i] = tmp;
else {
tmp = sum[N-2-i];
m[N-2-i] = tmp;
}
}
Int tmp1 = 0, min1 = 0, max1 = 0, tmp2 = 0, min2 = 0, max2 = 0;
rep(i,N) {
if (S[i] == '?') {
if (tmp1 + 1 + m[i] - sum[i] <= Z) {
tmp1++;
}
else tmp1--;
}
else {
tmp1 += v[i];
}
min1 = min(min1, tmp1);
max1 = max(max1, tmp1);
}
rep(i,N) {
if (S[i] == '?') {
if (tmp2 + 1 + m[i] - sum[i] <= Z+1) {
tmp2++;
}
else tmp2--;
}
else {
tmp2 += v[i];
}
min2 = min(min2, tmp2);
max2 = max(max2, tmp2);
}
Int ans = 0;
ans = min(max1-min1, max2-min2);
cout << ans << endl;
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char s[1000001];
int a[1000000];
int calc(int n, int m) {
int x = 0, y = 0, i;
for (i = 0; i < n; i++) {
if (s[i] == '1' || (s[i] == '?' && x + 1 + a[i] <= m)) {
x++;
} else {
x--;
}
y = min(y, x);
}
return m - y;
}
int main() {
int n, m = 0, x = 0, y = 0, i;
scanf("%s", s);
n = strlen(s);
for (i = 0; i < n; i++) {
if (s[i] == '1') {
x++;
} else {
x--;
}
m = max(m, x);
}
x = 0;
for (i = n - 1; i >= 0; i--) {
a[i] = y - x;
if (s[i] == '1') {
x--;
} else {
x++;
}
y = max(y, x);
}
printf("%d\n", min(calc(n, m), calc(n, m + 1)));
return 0;
}
|
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_n;_i>=_a;--_i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(_a) ({REP(_i,1,n) cout<<_a[_i]<<',';hr;})
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+7, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}
ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}
inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}
//head
#ifdef __APPLE__
const int N = 1e2+50;
#else
const int N = 1e6+50;
#endif
char s[N];
int n;
int chk(int x) {
REP(k,0,1) {
int a=k, b=x;
if (a%2!=b%2) --b;
REP(i,1,n) {
if (s[i]=='0') --a,--b;
else if (s[i]=='1') ++a,++b;
else --a,++b;
if (a<0) a+=2;
if (b>x) b-=2;
if (b<a) break;
if (i==n) return 1;
}
}
return 0;
}
int main() {
scanf("%s", s+1);
n = strlen(s+1);
if (n==1) return puts("1"),0;
int l = 0, r = n, ans;
while (l<=r) {
if (chk(mid)) ans=mid,r=mid-1;
else l=mid+1;
}
printf("%d\n", ans);
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i = a; i <= b; ++i)
#define PER(i,a,b) for(int i = a; i >= b; --i)
#define MP make_pair
#define PB push_back
#define fi first
#define se second
typedef long long LL;
typedef long double LD;
const int maxn = 1e6;
int n, f[maxn+5], mx[maxn+5], mi[maxn+5];
char ss[maxn+5];
int run(int lim) {
int mmi = 0, mmx = 0, del = 0;
for(int i = 1; i <= n; ++i) {
if(ss[i]=='?' && mx[i]+del+2<=lim)
del += 2;
mmi = min(mmi, f[i]+del);
mmx = max(mmx, f[i]+del);
}
return mmx-mmi;
}
int main() {
scanf("%s", ss+1), n = strlen(ss+1);
f[0] = 0;
REP(i,1,n) {
if(ss[i] == '1') f[i] = 1;
else f[i] = -1;
f[i] += f[i-1];
}
mx[n] = mi[n] = f[n];
for(int i = n-1; i >= 0; --i) {
mx[i] = max(f[i], mx[i+1]);
mi[i] = min(f[i], mi[i+1]);
}
int ans = min(run(mx[0]), run(mx[0]+1));
printf("%d\n", ans);
return 0;
}
|
#include<string>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < (ll)n; i++)
#define rrep(i, n) for(ll i = (ll)(n-1); i >= 0; i--)
int main() {
string S;
cin>>S;
ll N=S.size();
//assume ? == 0
vector<ll> sums(N,-1);
ll x = 0;
rep(i,N){
char c = S[i];
//x is sum
if(c=='1'){
x+=1;
}else{
x-=1;
}
sums[i]=x;
}
vector<ll> maxSums(N,-1);
ll maxSum=sums[N-1];
rrep(i,N){
maxSum=max(maxSum,sums[i]);
maxSums[i]=maxSum;
}
ll limit1 = max(maxSum,(ll) 0);//max(maxSum,(ll)0);
ll limit2 = limit1+1;//max(maxSum+1,(ll) 0);
string S1(S);
string S2(S);
ll cnt=0;
rep(i,N){
if (S[i]!='?') continue;
ll cur = maxSums[i] + cnt*2;
if (limit1 >= cur + 2){
cnt += 1;
S1[i] = '1';
}else{
S1[i] = '0';
}
}
cnt=0;
rep(i,N){
if (S[i]!='?') continue;
ll cur = maxSums[i] + cnt*2;
if (limit2 >= cur + 2){
cnt += 1;
S2[i] = '1';
}else{
S2[i] = '0';
}
}
ll min1=0;
ll max1=0;
x=0;
rep(i,N){
char c = S1[i];
if(c=='1'){
x+=1;
}else{
x-=1;
}
min1 = min(min1,x);
max1 = max(max1,x);
}
ll min2=0;
ll max2=0;
x=0;
rep(i,N){
char c = S2[i];
if(c=='1'){
x+=1;
}else{
x-=1;
}
min2 = min(min2,x);
max2 = max(max2,x);
}
ll ans = min(max1-min1,max2-min2);
cout<<ans<<endl;
return 0;
} |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline int read()
{
int x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==1?x:-x;
}
char s[maxn];
int len,suf[maxn],pre[maxn],mn,ans;
int main()
{
scanf("%s",s+1); len=strlen(s+1); mn=0; ans=inf;
rep(i,1,len) pre[i]=pre[i-1]+(s[i]=='0'?-1:1);
suf[len]=pre[len]; per(i,len-1,1) suf[i]=min(suf[i+1],pre[i]); mn=min(mn,suf[1]);
rep(j,1,2)
{
int nw=0,p=0;
rep(i,1,len)
{
if(s[i]!='?') nw+=(s[i]=='0'?-1:1);
else
{
if(suf[i]-pre[i-1]+nw-2>=mn) nw--;
else nw++;
}
p=max(p,nw);
}
ans=min(ans,p-mn); mn--;
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define fi first
#define se second
const int N = 1000011;
const long long mod = 1e9 + 7;
using namespace std;
int n;
int mx[N];
string s;
int solve(int B)
{
int cur = 0, A = 0;
for(int i = 0; i < n; i++){
if(s[i] == '0'){
cur -= 1;
} else if(s[i] == '1'){
cur += 1;
} else{
if(cur + 1 + max(0, mx[i + 1]) > B){
cur -= 1;
} else{
cur += 1;
}
}
A = min(A, cur);
}
return B - A;
}
int main()
{
ios_base::sync_with_stdio(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin >> s;
n = s.size();
for(int i = n - 1; i >= 0; i--){
mx[i] = max(0, mx[i + 1]) + (s[i] == '1' ? 1 : -1);
}
int l = 0, r = n;
for(int i = 0, cur = 0; i < n; i++){
cur += (s[i] == '1' ? 1 : -1);
l = max(l, cur);
}
int res = solve(l);
for(int i = 1; i <= 40; i++){
if(i + l <= n){
res = min(res, solve(i + l));
}
}
while(l + 40 < r){
int m = (r - l) / 3;
int h1 = l + m, h2 = r - m;
if(solve(h1) < solve(h2)){
r = h2;
} else{
l = h1;
}
}
while(l <= r){
res = min(res, solve(l));
l += 1;
}
cout << res << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
const int maxn=(1e6)+10;
const int INF=(1e9);
int n,sum[maxn],mx[maxn];
char s[maxn];
int solve(int mid) {
int mn=0,now=0,mxx=0;
for (int i=1;i<=n;i++) {
if (s[i]=='?') {
if (mx[i]+2+now<=mid) {
now+=2;
}
}
mn=min(mn,sum[i]+now);
mxx=max(mxx,sum[i]+now);
}
if (mxx>mid) return INF;
return mid-mn;
}
int main() {
//freopen("1.txt","r",stdin);
scanf("%s",s+1);
n=strlen(s+1);
for (int i=1;i<=n;i++) {
sum[i]=sum[i-1];
if (s[i]=='1') sum[i]++;
else sum[i]--;
}
mx[n]=sum[n];
for (int i=n-1;i>=1;i--)
mx[i]=max(mx[i+1],sum[i]);
//for (int i=0;i<=n;i++) printf("%d ",solve(i)); printf("\n");
int l=0,r=n-1,res=n,mid,ans=2*n;
while (l<=r) {
mid=(l+r)/2;
if (solve(mid)<solve(mid+1)) r=mid-1,res=mid;
else l=mid+1;
}
for (int i=res-10;i<=res+10;i++)
if (0<=i&&i<=n) ans=min(ans,solve(i));
printf("%d\n",ans);
return 0;
}
/*
0. Enough array size? Enough array size? Enough array size? Interger overflow?
1. Think TWICE, Code ONCE!
Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
Time complexity? Memory usage? Precision error?
*/ |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin>>s;
ll n = s.size();
vector<ll> h;
h.push_back(0); //h stores cumulative sum assuming 0s and ?s are -1
for(auto c:s)
h.push_back(h.back() + (c=='1'?1:-1));
vector<ll> z = h;
for(ll i=n-1;i>=0;i--)
z[i] = max(z[i],z[i+1]);
ll mx = -1;
for(ll i=0;i<=n;i++)
mx = max(mx,h[i]);
ll ans = INT64_MAX;
for(ll random_variable=0;random_variable<2;random_variable++){
ll cur = 0,mn = 0;
for(ll i=0;i<n;i++){
if(s[i] == '?'){
if(cur + z[i+1] - h[i] +2 <=mx)
cur++;
else
cur--;
}
else if(s[i] == '0')
cur--;
else
cur++;
mn = min(mn,cur);
}
ans = min(ans,mx-mn);
mx++;
}
cout<<ans<<endl;
return 0;
} |
# include <bits/stdc++.h>
using namespace std;
namespace Base{
# define mr make_pair
typedef long long ll;
typedef double db;
const int inf = 0x3f3f3f3f, INF = 0x7fffffff;
const ll infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll;
template<typename T> void read(T &x){
x = 0; int fh = 1; double num = 1.0; char ch = getchar();
while (!isdigit(ch)){ if (ch == '-') fh = -1; ch = getchar(); }
while (isdigit(ch)){ x = x * 10 + ch - '0'; ch = getchar(); }
if (ch == '.'){
ch = getchar();
while (isdigit(ch)){num /= 10; x = x + num * (ch - '0'); ch = getchar();}
}
x = x * fh;
}
template<typename T> void chmax(T &x, T y){x = x < y ? y : x;}
template<typename T> void chmin(T &x, T y){x = x > y ? y : x;}
}
using namespace Base;
const int N = 1000100;
char s[N];
int n;
int bak[N];
int main(){
scanf("\n%s", s + 1);
n = strlen(s + 1);
int mx = 0, pre = 0, mn, lim, ans;
for (int i = 1; i <= n; i++){
if (s[i] == '1') pre++;
else pre--;
mx = max(pre, mx);
}
for (int i = n; i >= 1; i--){
if (s[i] == '1') bak[i] = 1 + bak[i + 1];
else bak[i] = -1 + bak[i + 1];
bak[i] = max(bak[i], 0);
}
lim = mx, pre = 0, mn = 0;
for (int i = 1; i <= n; i++){
if (s[i] == '1') pre++;
if (s[i] == '0') pre--;
if (s[i] == '?'){
if (pre + 1 + bak[i + 1] <= lim) pre++;
else pre--;
}
mn = min(mn, pre);
}
ans = lim - mn;
lim = mx + 1, pre = 0, mn = 0;
for (int i = 1; i <= n; i++){
if (s[i] == '1') pre++;
if (s[i] == '0') pre--;
if (s[i] == '?'){
if (pre + 1 + bak[i + 1] <= lim) pre++;
else pre--;
}
mn = min(mn, pre);
}
ans = min(ans, lim - mn);
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
char buf[1000010];
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
std::cin >> buf;
int a0 = 0, a1 = 1, b0 = 0, b1 = -1;
int c0 = a0-b0, c1 = a0-b1, c2 = a1-b0, c3 = a1-b1;
for(char *p = buf; *p; p++) {
if(*p=='0') { --a0; --a1; --b0; --b1; }
else if(*p=='1') { ++a0; ++a1; ++b0; ++b1; }
else { --a0; --a1; ++b0; ++b1; }
if(a0 < 0) a0 += 2;
if(a1 < 0) a1 += 2;
if(b0 > 0) b0 -= 2;
if(b1 > 0) b1 -= 2;
c0 = std::max(c0, a0-b0);
c1 = std::max(c1, a0-b1);
c2 = std::max(c2, a1-b0);
c3 = std::max(c3, a1-b1);
}
fin(std::min(std::min(c0, c1), std::min(c2, c3)));
return 0;
}
|
#include <iostream>
#include<set>
#include<vector>
#include<string>
using namespace std;
const int mod=1000000007;
int add(int a, int b)
{
int c=a+b;
if(c>=mod)c-=mod;
return c;
}
int dif(int a, int b)
{
int c=a-b;
if(c<0)c+=mod;
return c;
}
int mlt(int a, int b)
{
long long c=a*1LL*b;
return c%mod;
}
int bp(int a, int b)
{
if(b==0)return 1;
if(b%2==0)
{
int val=bp(a, b/2);
return mlt(val, val);
}
if(b%2==1)
{
int val=bp(a, b-1);
return mlt(val, a);
}
}
int inv(int a)
{
return bp(a, mod-2);
}
void outp(vector<vector<int>>&v)
{
for(int i=0; i<v.size(); i++)
{
for(int j=0; j<v[i].size(); j++)cout<<v[i][j]<<' ';
cout<<endl;
}
cout<<endl;
}
bool tst(string s, int k, int a, int b)
{
if(b<a)return false;
int cura=a, curb=b;
for(int j=0; j<s.length(); j++)
{
if(s[j]=='0')
{
if(curb==k)
curb--;
else curb++;
cura++;
if(cura>curb)return false;
if(cura<0)return false;
}
if(s[j]=='1')
{
curb--;
cura--;
if(cura<0)cura+=2;
if(cura>curb)return false;
}
if(s[j]=='?')
{
cura--;
if(cura<0)cura=1;
curb++;
if(curb>k)curb-=2;
if(cura>curb)return false;
}
}
return true;
}
bool check(string s, int k)
{
if(k%2==0)
{
if(tst(s, k, 0, k))return true;
if(tst(s, k, 1, k-1))return true;
return false;
}
else
{
if(tst(s, k, 0, k-1))return true;
if(tst(s, k, 1, k))return true;
return false;
}
}
int main()
{
string s;
cin>>s;
int n=s.length();
vector<int>l0(n+1), l1(n+1);
int maxval=0;
for(int i=1; i<=n; i++)
{
if(s[i-1]=='0')
{
l0[i]=l0[i-1]+1;
}
else{
l0[i]=max(l0[i-1]-1, 0);
}
if(s[i-1]=='1')
{
l1[i]=l1[i-1]+1;
}
else{
l1[i]=max(l1[i-1]-1, 0);
}
maxval=max(maxval, l0[i]);
maxval=max(maxval, l1[i]);
}
if(check(s, maxval))cout<<maxval<<endl;
else cout<<maxval+1<<endl;
} |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
read(x);read(a...);
}
template<class t> inline void write(t x){
if(x<0) putchar('-'),write(-x);
else{if(x>9) write(x/10);putchar('0'+x%10);}
}
const int N=1e6+5;
int sum[N],suf[N],n;
char s[N];
int calc(int mi){
int ma=0,tot=0;
for(int i=1;i<=n;i++){
if(s[i]=='?'&&suf[i]-tot-2>=mi) tot+=2;
ma=max(ma,sum[i]-tot);
}
return ma-mi;
}
signed main(){
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++) sum[i]=sum[i-1]+(s[i]!='0')-(s[i]=='0');
suf[n]=sum[n];
for(int i=n-1;~i;i--) suf[i]=min(suf[i+1],sum[i]);
write(min(calc(suf[0]-1),calc(suf[0])));
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1000005;
int n, a[N], f[N<<2], g[N<<2], h[N<<2];
char s[N];
set<int> c, d;
void build(int l, int r, int t){
if(l==r) return (void)(f[t]=g[t]=a[l]);
int mid=(l+r)>>1, k=t<<1;
build(l, mid, k), build(mid+1, r, k|1);
f[t]=max(f[k], f[k|1]), g[t]=min(g[k], g[k|1]), h[t]=0;
}
int find(int l, int r, int t, int x){
if(l==r) return l;
int mid=(l+r)>>1, k=t<<1;
if(h[t]) f[k]+=h[t], g[k]+=h[t], f[k|1]+=h[t], g[k|1]+=h[t], h[t]=0;
if(f[k]>x) return find(l, mid, k, x);
else return find(mid+1, r, k|1, x);
}
void change(int l, int r, int t, int L){
if(L<=l) return (void)(f[t]-=2, g[t]-=2, h[t]-=2);
int mid=(l+r)>>1, k=t<<1;
if(h[t]) f[k]+=h[t], g[k]+=h[t], f[k|1]+=h[t], g[k|1]+=h[t], h[t]=0;
if(L<=mid) change(l, mid, k, L);
change(mid+1, r, k|1, L);
f[t]=max(f[k], f[k|1]), g[t]=min(g[k], g[k|1]);
}
int main() {
scanf("%s", s+1), n=strlen(s+1);
for(int i=1; i<=n; ++i){
a[i]=a[i-1]+(s[i]=='0'?-1:1);
if(s[i]=='?') c.insert(i);
}
d=c;
int ans=n;
build(0, n, 1);
for(int i=n;; i-=2){
if(f[1]>i){
int x=find(0, n, 1, i);
auto it=c.upper_bound(x);
if(it==c.begin()) break;
change(0, n, 1, *--it);
c.erase(it);
}
ans=min(ans, f[1]-g[1]);
}
build(0, n, 1);
for(int i=n+1;; i-=2){
if(f[1]>i){
int x=find(0, n, 1, i);
auto it=d.upper_bound(x);
if(it==d.begin()) break;
change(0, n, 1, *--it);
d.erase(it);
}
ans=min(ans, f[1]-g[1]);
}
printf("%d\n", ans);
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
std::string s; std::cin >> s;
int da[4], db[4];
da[0] = db[0] = da[3] = -1;
da[1] = db[1] = db[3] = 1;
int a0 = 0, a1 = 1, b0 = 0, b1 = -1;
int c0 = a0-b0, c1 = a0-b1, c2 = a1-b0, c3 = a1-b1;
for(auto c: s) {
a0 += da[c&3]; if(a0 < 0) a0 += 2;
a1 += da[c&3]; if(a1 < 0) a1 += 2;
b0 += db[c&3]; if(b0 > 0) b0 -= 2;
b1 += db[c&3]; if(b1 > 0) b1 -= 2;
c0 = std::max(c0, a0-b0);
c1 = std::max(c1, a0-b1);
c2 = std::max(c2, a1-b0);
c3 = std::max(c3, a1-b1);
}
fin(std::min(std::min(c0, c1), std::min(c2, c3)));
return 0;
}
|
#include<cstdio>
#include<algorithm>
char buf[1000010];
int main() {
scanf("%s", buf);
int a0 = 0, a1 = 1, b0 = 0, b1 = -1;
int c0 = a0-b0, c1 = a0-b1, c2 = a1-b0, c3 = a1-b1;
for(char *p = buf; *p; p++) {
if(*p=='0') { --a0; --a1; --b0; --b1; }
else if(*p=='1') { ++a0; ++a1; ++b0; ++b1; }
else { --a0; --a1; ++b0; ++b1; }
if(a0 < 0) a0 += 2;
if(a1 < 0) a1 += 2;
if(b0 > 0) b0 -= 2;
if(b1 > 0) b1 -= 2;
if(c0 < a0-b0) c0 = a0-b0;
if(c1 < a0-b1) c1 = a0-b1;
if(c2 < a1-b0) c2 = a1-b0;
if(c3 < a1-b1) c3 = a1-b1;
}
if(c0 > c1) c0 = c1;
if(c2 > c3) c2 = c3;
if(c0 > c2) c0 = c2;
printf("%d\n", c0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int MAX = 1e6 + 10;
const int MOD = 1e9 + 7;
const int oo = 1e9;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
#define endl '\n'
string s; cin >> s;
int n = s.size();
int b = 1, e = n;
while(b < e){
int m = (b + e) / 2;
bool pos = true;
int rd = 0, ru = m;
int phase = 1;
for(int i = 0; i < n; i++){
if(s[i] == '0'){
rd--; ru--;
}
else if(s[i] == '1'){
rd++, ru++;
}
else{
rd--; ru++;
}
if(rd < 0)rd += phase;
if(ru > m) ru -= phase;
if(ru < rd){
pos = false; break;
}
if(ru == rd && phase == 1)phase = 2;
}
if(pos) e = m;
else b = m + 1;
}
cout << b << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int gi() {
int x=0,o=1;char ch=getchar();
while(!isdigit(ch)&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x*o;
}
int n,mid;
char s[N];
struct dat {
int l,r;
dat() {}
dat(int _l,int _r) {
l=_l;r=_r;
if(l<0) l+=2;
if(r>mid) r-=2;
}
bool empty() {
return l>r;
}
} I[2],new_I[2];
bool check() {
I[0]=dat(0,mid-(mid&1));
I[1]=dat(1,mid-(mid&1^1));
//cerr<<I[1].l<<' '<<I[1].r<<'\n';
for(int i=1;i<=n;i++) {
if(s[i]=='1') {
new_I[0]=dat(I[1].l+1,I[1].r+1);
new_I[1]=dat(I[0].l+1,I[0].r+1);
}
else if(s[i]=='0') {
new_I[0]=dat(I[1].l-1,I[1].r-1);
new_I[1]=dat(I[0].l-1,I[0].r-1);
}
else {
new_I[0]=dat(I[1].l-1,I[1].r+1);
new_I[1]=dat(I[0].l-1,I[0].r+1);
}
if(I[0].empty()) new_I[1]=dat(1,0);
if(I[1].empty()) new_I[0]=dat(1,0);
I[0]=new_I[0];I[1]=new_I[1];
//cerr<<I[0].l<<' '<<I[0].r<<' '<<I[1].l<<' '<<I[1].r<<'\n';
if(I[0].empty()&&I[1].empty()) return 0;
}
return 1;
}
int main() {
scanf("%s",s+1);n=strlen(s+1);
//mid=0;check();return 0;
int l=0,r=n;
while(l<r) {
mid=(l+r)>>1;
if(check()) r=mid;
else l=mid+1;
}
cout<<l;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
#define so(a) ((int)((a).size()))
template<typename T1,typename T2> inline T1 max(T1 a,T2 b){return a<b?b:a;}
template<typename T1,typename T2> inline T1 min(T1 a,T2 b){return a<b?a:b;}
const char lf = '\n';
namespace ae86
{
const int bufl = 1 << 15;
char buf[bufl],*s=buf,*t=buf;
inline int fetch()
{
if(s==t){t=(s=buf)+fread(buf,1,bufl,stdin);if(s==t)return EOF;}
return *s++;
}
inline int ty()
{
int a=0;int b=1,c=fetch();
while(!isdigit(c))b^=c=='-',c=fetch();
while(isdigit(c))a=a*10+c-48,c=fetch();
return b?a:-a;
}
template<typename T> inline int ts(T *s)
{
int a=0,c=fetch();
while(c<=32 && c!=EOF)c=fetch();
while(c>32 && c!=EOF)s[a++]=c,c=fetch();
s[a]=0;
return a;
}
}
using ae86::ty;
using ae86::ts;
const int _ = 1000007;
int n,val[_],sval[_]={0},smx[_]={0};
int make(int lim)
{
int now=0,mi=0;
for(int i=1;i<=n;i++)
{
if(val[i]==0)now+=(now+2+(smx[i]-sval[i-1])<=lim)?1:-1;
else now+=val[i];
mi=min(mi,now);
}
return lim-mi;
}
int main()
{
ios_base::sync_with_stdio(0),cout.tie(nullptr);
n=ts(val+1);
for(int i=1;i<=n;i++)
{
if(val[i]=='1')val[i]=1;
else if(val[i]=='0')val[i]=-1;
else val[i]=0;
sval[i]=sval[i-1]+(val[i]==1?1:-1);
}
smx[n]=sval[n];
for(int i=n-1;i>=1;i--)smx[i]=max(smx[i+1],sval[i]);
int mxval=0;
for(int i=1;i<=n;i++)mxval=max(mxval,sval[i]);
cout<<min(make(mxval),make(mxval+1))<<lf;
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[1000010];
int n,sufmx[1000010];
int work(int mx)
{
int add=0,mi=0,cur=0;
for(int i=1;i<=n;++i)
{
if(s[i]=='?'&&add+sufmx[i]+2<=mx)++cur,add+=2;
else cur+=s[i]=='1'?1:-1;
mi=min(mi,cur);
}
return mx-mi;
}
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
int cur=0;
for(int i=1;i<=n;++i)
{
cur+=s[i]=='1'?1:-1;
sufmx[i]=cur;
}
for(int i=n-1;i>=0;--i)sufmx[i]=max(sufmx[i+1],sufmx[i]);
printf("%d",min(work(sufmx[0]),work(sufmx[0]+1)));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------
string S;
int N;
int Rcur[1010101];
int Rma[1010101];
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>S;
N=S.size();
int cur=0,Z=0;
FORR(c,S) {
if(c=='1') cur++;
else cur--;
Z=max(cur,Z);
}
for(i=N-1;i>=0;i--) {
if(S[i]=='1') {
Rcur[i]=Rcur[i+1]-1;
}
else {
Rcur[i]=Rcur[i+1]+1;
}
Rma[i]=max(Rcur[i],Rma[i+1]);
}
int mi=0;
cur=0;
FOR(i,N) {
//cout<<i<<" "<<cur<<" "<<Rma[i+1]<<" "<<Z<<" "<<(cur+1+Rma[i+1]>Z)<<" "<<S[i]<<endl;
if(S[i]=='1') cur++;
else if(S[i]=='0') cur--;
else {
if(cur+1+(Rma[i+1]-Rcur[i+1])>Z) {
cur--;
}
else {
cur++;
}
}
mi=min(mi,cur);
}
int ret=Z-mi;
cur=mi=0;
FOR(i,N) {
//cout<<i<<" "<<cur<<" "<<Rma[i+1]<<" "<<Z<<" "<<(cur+1+Rma[i+1]>Z)<<" "<<S[i]<<endl;
if(S[i]=='1') cur++;
else if(S[i]=='0') cur--;
else {
if(cur+1+(Rma[i+1]-Rcur[i+1])>Z+1) {
cur--;
}
else {
cur++;
}
}
mi=min(mi,cur);
}
ret=min(ret,Z+1-mi);
cout<<ret<<endl;
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
char s[1111111];
int n,mx,pre[1111111],suf[1111111];
int f(int x)
{
int num=0,mn=0;
for (int i=1;i<=n;i++)
{
if (s[i-1]=='?')
{
if (suf[i]+(num+1)*2<=x) num++;
}
mn=min(mn,num*2+pre[i]);
}
return mn;
}
int main()
{
scanf("%s",s);
n=strlen(s);mx=0;
for (int i=1;i<=n;i++)
{
if (s[i-1]=='?' || s[i-1]=='0') pre[i]=pre[i-1]-1;
else pre[i]=pre[i-1]+1;
mx=max(mx,pre[i]);
}
suf[n+1]=-1e9;
for (int i=n;i>=1;i--) suf[i]=max(suf[i+1],pre[i]);
printf("%d\n",min(mx-f(mx),mx+1-f(mx+1)));
return 0;
} |
#include <bits/stdc++.h>
namespace IO
{
char gc()
{
#ifdef FREAD
static char buf[1<<21], *P1 = buf, *P2 = buf;
if(P1 == P2)
{
P1 = buf;
P2 = buf + fread(buf, 1, 1<<21, stdin);
if(P1 == P2) return EOF;
}
return *(P1++);
#else
return getchar();
#endif
}
template<typename Tp> bool get1(Tp &x)
{
bool neg = 0;
char c = gc();
while( c != EOF && (c < '0' || c > '9') && c != '-' ) c = gc();
if(c == '-') c = gc(), neg = 1;
if(c == EOF) return false;
x = 0;
for(; c>='0' && c<='9'; c = gc()) x = x*10 + c - '0';
if(neg) x = -x;
return true;
}
template<typename Tp> void printendl(Tp x)
{
if(x<0)putchar('-'),x=-x;
static short a[40], sz;
sz = 0;
while(x>0)a[sz++]=x%10,x/=10;
if(sz==0)putchar('0');
for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
puts("");
}
} // namespace IO
using IO::get1;
using IO::printendl;
#define get2(x,y) get1(x) && get1(y)
#define get3(x,y,z) get2(x,y) && get1(z)
#define get4(x,y,z,w) get3(x,y,z) && get1(w)
#define pb push_back
#define mp std::make_pair
#define ff first
#define ss second
typedef long long LL;
typedef unsigned long long uLL;
typedef std::pair<int,int> pii;
const int inf = 0x3f3f3f3f;
const LL Linf = 1ll<<61;
const int maxn = 1000111;
char s[maxn];
int n, suf[maxn];
int check(int x)
{
if(x < 0 || suf[1] > x) return inf;
int sum = 0, mn = 0;
for(int i=1; i<=n; i++)
{
if(s[i] == '0') sum++;
else if(s[i] == '1') sum--;
else if(sum + suf[i+1] >= x) sum--;
else sum++;
if(sum > x) return inf;
mn = std::min(mn, sum);
}
return x - mn;
}
int main()
{
scanf("%s", s+1);
n = strlen(s + 1);
int sum = 0, mx = 0;
for(int i=1; i<=n; i++)
{
if(s[i] == '0') sum++;
else sum--;
mx = std::max(mx, sum);
}
for(int i=n; i>=1; i--) suf[i] = std::max(0, suf[i+1] + (s[i] == '0') - (s[i] != '0'));
printf("%d\n", std::min(check(mx), check(mx+1)));
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cassert>
#define InfL 2000000000
#define InfLL 4000000000000000000LL
#define mod 1000000007
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<db> vd;
int main() {
string S;
cin >> S;
int N = S.length();
vi Ssum(N + 1, 0);
rep(i, N) {
Ssum[i + 1] = Ssum[i];
if (S[i] == '1')
Ssum[i + 1]++;
else
Ssum[i + 1]--;
}
vi Ssummax(N + 1);
Ssummax[N] = Ssum[N];
rrep(i, N)
Ssummax[i] = max(Ssummax[i + 1], Ssum[i]);
int Ssummax_all = Ssummax[0];
int ans = InfL;
for (int Ssummax_all_new = Ssummax_all; Ssummax_all_new <= Ssummax_all + 1; Ssummax_all_new++) {
int Ssummin_all_new = Ssum[0];
int plus1_count = 0;
rep(i, N) {
int Ssumtmp = Ssum[i + 1] + plus1_count * 2;
if (S[i] == '?') {
if (Ssummax[i + 1] + 2 + plus1_count * 2 <= Ssummax_all_new) {
// -1 -> +1
plus1_count++;
Ssumtmp += 2;
}
}
Ssummin_all_new = min(Ssummin_all_new, Ssumtmp);
}
int anstmp = Ssummax_all_new - Ssummin_all_new;
ans = min(ans, anstmp);
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_n;_i>=_a;--_i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(_a) ({REP(_i,1,n) cout<<_a[_i]<<',';hr;})
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+7, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}
ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}
inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}
//head
#ifdef __APPLE__
const int N = 1e2+50;
#else
const int N = 1e6+50;
#endif
char s[N];
int n;
int chk(int x) {
REP(k,0,1) {
int a=k, b=x;
if (a%2!=b%2) --b;
REP(i,1,n) {
if (s[i]=='0') --a,--b;
else if (s[i]=='1') ++a,++b;
else --a,++b;
if (a<0) a+=2;
if (b>x) b-=2;
if (b<a) break;
if (i==n) return 1;
}
}
return 0;
}
int main() {
scanf("%s", s+1);
n = strlen(s+1);
int l = 0, r = n;
while (r-l>1) {
if (chk(mid)) r=mid;
else l=mid;
}
printf("%d\n", r);
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ui long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define lb lower_bound
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,b,a) for(int i=(b);i>=(a);--i)
#define rep0(i,a,b) for(int i=(a);i<(b);++i)
#define fore(i,a) for(int i=0;i<a.size();++i)
#define gc() getchar()
#define ls x<<1,l,m
#define rs x<<1|1,m+1,r
inline ll rd()
{
ll x=0,w=1;char c=gc();while(!isdigit(c)&&c!='-')c=gc();
if(c=='-')c=gc(),w=-1;while(isdigit(c))x=x*10+c-48,c=gc();return x*w;
}
const int N=1000005;
int n,ans=N,p[N],a[N];char s[N];
void chk(int mn)
{
int c=0,mx=0;
rep(i,1,n)
{
if(s[i]=='0')c++;else if(s[i]=='1')c--;
else if(c-1+p[i+1]>=mn)c--;else c++;
mx=max(mx,c);if(c<mn){mx=1e9;break;}
}
ans=min(ans,mx-mn);
}
int main()
{
scanf("%s",s+1);n=strlen(s+1);
per(i,n,1)p[i]=min(0,p[i+1]+(s[i]=='1'?-1:1));
int c=0,mn=0;
rep(i,1,n)
{
if(s[i]=='0')c++;else if(s[i]=='1')c--;else c++;
mn=min(mn,c);
}
chk(mn);chk(mn-1);
printf("%d\n",ans);return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ll Mod = 1000000007LL;
const int N = 2e5 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
str s;
cin >> s;
int n = s.size();
int L = 0, R = n + 3;
int mid;
int lz, rz, lf, rf;
while(L + 1 < R){
mid = (L + R) >> 1;
lz = 0, rz = mid - (mid & 1);
lf = 1, rf = mid - (1 - (mid & 1));
bool flz = true, flf = true;
for(auto &c : s){
if(c == '0'){
lz --; rz--;
lf --; rf--;
}
if(c == '1'){
lz ++;
rz ++;
lf ++; rf++;
}
if(c == '?'){
lz --;
rz ++;
lf --;
rf ++;
}
swap(lz, lf); swap(rz, rf); swap(flz, flf);
lz = max(lz, 0); lf = max(lf, 1);
rz = min(rz, mid - (mid & 1));
rf = min(rf, mid - (1 - (mid & 1)));
if(lz > rz) flz = false;
if(lf > rf) flf = false;
}
if(flz || flf) R = mid;
else L = mid;
}
cout << R << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
char s[N];
int n,a[N],b[N];
int solve(int mx)
{
int add=0;
for(int i=1;i<=n;i++)
if(s[i]!='?') b[i]=s[i]=='1'?1:-1;
else
{
if(a[i]+add+2<=mx)
b[i]=1,add+=2;
else b[i]=-1;
}
for(int i=1;i<=n;i++) b[i]+=b[i-1];
int mn=0;mx=0;
for(int i=1;i<=n;i++)
mn=min(mn,b[i]),mx=max(mx,b[i]);
return mx-mn;
}
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++) a[i]=a[i-1]+(s[i]=='1'?1:-1);
for(int i=n-1;i>=1;i--) a[i]=max(a[i],a[i+1]);
int ans=min(solve(a[1]),solve(a[1]+1));
ans=min(ans,solve(a[1]+2));
ans=min(ans,solve(a[1]+3));
ans=min(ans,solve(a[1]+4));
printf("%d\n",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 1<<20, mod = 1e9 + 7;
string s;
int n, ans = 1<<30;
int p[maxn], sm[maxn], tt[maxn];
void solvep(string s) {//stuff with +
p[0] = 0;
int gm = 0;
//cout << s << '\n';
for(int i = 1; i <= n; i++) {
p[i] = p[i-1] + (s[i] == '1' ? -1 : 1);
gm = min(gm, p[i]);
// cout << p[i] << " ";
}
// cout << '\n';
sm[n] = p[n];
for(int i = n-1; i >= 0;i--) sm[i] = min(p[i], sm[i+1]);
//for(int i = 0; i <= n; i++) cout << sm[i] << " ";
//for(int i = 0; i <= n; i++) cout << p[i] << ' '; cout << '\n';
int r = 0;
for(int i = 0; i <= n; i++) {
sm[i] += r;
p[i] += r;
//cout << i << " " << sm[i] << " " << sm[i]-2 << " " << gm << '\n';
if(s[i] == '?' && sm[i] - 2 >= gm) {
r-=2;
//cout <<"at " << i << '\n';
sm[i] -= 2;
p[i] -= 2;
s[i] = '1';
}
tt[i] = r;
if(s[i] == '?') s[i] = '0';
//cout << p[i] << "\n";
}
//for(int i = 0; i <= n; i++) cout << p[i] << ' '; cout << '\n';
//cout << s << '\n';
int x = 0, y = 0; r = 0;
for(auto i : s) {
if(i == '1') r--;
else if(i != '.') r++;
x = min(x, r);
y = max(y, r);
}
ans = min(ans, y-x);
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> s;
n = s.size();
s = "." + s;
for(int i = 0; i < 2; i++) {
memset(p, 0, sizeof p);
memset(sm, 0, sizeof sm);
solvep(s);
memset(p, 0, sizeof p);
memset(sm, 0, sizeof sm);
for(auto &i : s) if(i != '?' && i != '.') i ^='0'^'1';
solvep(s);
reverse(s.begin(), s.end());
s.pop_back();
s = "." + s;
}
cout << ans;
}
|
#include <iostream>
#include <limits>
using namespace std;
int main() {
string s;
cin >> s;
int maxPrefix = 0, prefix[s.size() + 1];
prefix[0] = 0;
for (int i = 1; i <= s.size(); ++i) {
if (s[i - 1] == '1') {
prefix[i] = prefix[i - 1] + 1;
} else {
prefix[i] = prefix[i - 1] - 1;
}
maxPrefix = max(maxPrefix, prefix[i]);
}
auto solve = [&](int maxPrefix) {
int capacity[s.size() + 1];
for (int i = s.size(), j = numeric_limits<int>::max(); i > 0; --i) {
j = min(j, maxPrefix - prefix[i]);
capacity[i] = j / 2;
}
int sum = 0, result = 0, tempMinPrefix = 0, count = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1') {
++sum;
} else if (s[i] == '0') {
--sum;
} else if (capacity[i + 1] > count) {
++sum;
++count;
} else {
--sum;
}
result = min(result, sum);
}
return result;
};
cout << min(maxPrefix - solve(maxPrefix), maxPrefix + 1 - solve(maxPrefix + 1));
return 0;
} |
#include <bits/stdc++.h>
const int MAX_N = int(1e6) + 10;
int n, ans, sum[MAX_N], suf[MAX_N], b[MAX_N];
char s[MAX_N];
void solve(int low) {
for (int i = 0; i <= n; ++i) b[i] = sum[i];
int del = 0;
for (int i = 1; i <= n; ++i) {
if (s[i] == '?' && suf[i] - del - 2 >= low) del += 2;
b[i] -= del;
}
int m = 0;
for (int i = 1; i <= n; ++i) m = std::max(m, b[i]);
ans = std::min(ans, m - low);
}
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; ++i)
sum[i] = sum[i - 1] + (s[i] == '0' ? -1 : 1);
suf[n + 1] = ans = n + 1;
for (int i = n; i >= 0; --i)
suf[i] = std::min(suf[i + 1], sum[i]);
solve(suf[0]);
solve(suf[0] - 1);
printf("%d\n", ans);
} |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int inf=2147483547;
int n;
#define Maxn 1000010
char S[Maxn];
int sum[Maxn],at[Maxn],cnt=0;
int le[Maxn],ri[Maxn];
inline int D(int x){
if(x>0)return x;
return -x;
}
inline bool Judge(int mid){
le[0]=0;ri[0]=mid;
for(int i=1;i<=cnt;++i){
le[i]=-inf;ri[i]=inf;
}
for(int i=0;i<=n;++i){
le[at[i]]=max(le[at[i]],-sum[i]);
ri[at[i]]=min(ri[at[i]],mid-sum[i]);
}
if(le[0]>ri[0])return false;
int l,r,ty;
if(le[0]==ri[0]){
l=r=le[0];
ty=(D(le[0])%2);
}else{
l=le[0];r=ri[0];
ty=2;
}
for(int i=1;i<=cnt;++i){
if(ty==2){
l--;r++;
l=max(l,le[i]);r=min(r,ri[i]);
if(l>r)return false;
if(l==r){
ty=(D(l)%2);
continue;
}
continue;
}
l--;r++;
l=max(l,le[i]);r=min(r,ri[i]);
if(l>r)return false;
int g=(D(l)%2);
ty^=1;
if(l+(g^ty)>r)return false;
}
return true;
}
int main(){
scanf("%s",S+1);n=strlen(S+1);
cnt=0;
for(int i=1;i<=n;++i){
sum[i]+=sum[i-1];
if(S[i]=='1')
sum[i]++;
if(S[i]=='0')
sum[i]--;
if(S[i]=='?')cnt++;
at[i]=cnt;
}
int l=0,r=n;
while(l<r){
int mid=(l+r)>>1;
if(Judge(mid))r=mid;
else l=mid+1;
}
printf("%d\n",l);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
#define fir first
#define sec second
#define rep(i,a,b) for (int i = (a) ; i <= (b) ; ++ i)
#define rrp(i,a,b) for (int i = (a) ; i >= (b) ; -- i)
#define gc() getchar()
template <typename tp>
inline void read(tp& x) {
x = 0; char tmp; bool key = 0;
for (tmp = gc() ; !isdigit(tmp) ; tmp = gc())
key = (tmp == '-');
for ( ; isdigit(tmp) ; tmp = gc())
x = (x << 3) + (x << 1) + (tmp ^ '0');
if (key) x = -x;
}
template <typename tp>
inline void ckmn(tp& x,tp y) {
x = x < y ? x : y;
}
template <typename tp>
inline void ckmx(tp& x,tp y) {
x = x < y ? y : x;
}
const int N = 1000010;
char str[N];
int n, val[N], mxp, mx[N];
int doit(int lim) {
int cur = 0, mn = n;
rep (i, 0, mxp) mn = min(mn, val[i]);
rep (i, mxp + 1, n) {
if (str[i] == '?') {
if (mx[i] + 2 * (cur + 1) <= lim) {
++ cur;
}
}
mn = min(mn, val[i] + 2 * cur);
}
return lim - mn;
}
int main() {
scanf("%s", str + 1);
n = strlen(str + 1);
rep (i, 1, n) {
val[i] = val[i-1];
if (str[i] == '0' || str[i] == '?') -- val[i];
else ++ val[i];
}
mxp = 0;
rep (i, 1, n) if (val[i] > val[mxp]) mxp = i;
rrp (i, n, 1) {
mx[i] = val[i];
if (i < n) mx[i] = max(mx[i], mx[i+1]);
}
int ans = min(doit(val[mxp]), doit(val[mxp] + 1));
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
int const N = 1000000;
int n;
char s[N + 1];
bool ok(int m){
int l[2] = { 0, 1 }, r[2] = { m, m };
--r[m & 1 ^ 1];
f(i, 0, n)f(j, 0, 2){
if (s[i] == '?')--l[j], ++r[j];
else if (s[i] == '0')--l[j], --r[j];
else ++l[j], ++r[j];
if (l[j] < 0)l[j] += 2;
if (r[j] > m)r[j] -= 2;
if (l[j] > m || r[j] < 0)r[j] = 1e9;
}
return r[0] <= m || r[1] <= m;
}
int main(){
scanf("%s", s);
n = strlen(s);
int l = 1, r = n;
while (r > l){
int m = l + r >> 1;
if (ok(m))r = m;
else l = m + 1;
}
printf("%d\n", l);
} |
#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<" "
#define el <<endl
#define fgx cerr<<" ---------------------------------------------- "<<endl
#define LL long long
#define uint unsigned int
#define ULL unsigned long long
#define LDB long double
#define DB double
#define pii pair<int,int>
#define pli pair<LL,int>
#define mp make_pair
#define pb push_back
using namespace std;
inline LL read(){
LL nm=0; bool fh=true; char cw=getchar();
for(;!isdigit(cw);cw=getchar()) fh^=(cw=='-');
for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
return fh?nm:-nm;
}
#define mod 1000000007
namespace CALC{
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int mns(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
inline int mul(LL x,LL y){return x*y%mod;}
inline void upd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void dec(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int qpow(int x,int sq){int res=1;for(;sq;sq>>=1,x=mul(x,x))if(sq&1)res=mul(res,x);return res;}
}using namespace CALC;
#define M 3200000
int n,m,pre[M],mx,suf[M],t[M],ans;
char ch[M];
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
scanf("%s",ch+1),n=strlen(ch+1),suf[n+1]=n+n+1,mx=0;
for(int i=1;i<=n;i++) mx=max(mx,pre[i]=pre[i-1]+((ch[i]=='1')?1:-1));
for(int i=n;i>0;i--) suf[i]=min(suf[i+1],mx-pre[i]);
int dn=0;
for(int i=1,now=0,pr=0;i<=n;i++){
if(ch[i]!='?') t[i]=((ch[i]-'0')<<1)-1;
else if(now+2<=suf[i]) now+=2,t[i]=1;
else t[i]=-1;
pr+=t[i],dn=min(dn,pr);
} ans=mx-dn;
mx++,dn=0;
for(int i=n;i>0;i--) suf[i]=min(suf[i+1],mx-pre[i]);
for(int i=1,now=0,pr=0;i<=n;i++){
if(ch[i]!='?') t[i]=((ch[i]-'0')<<1)-1;
else if(now+2<=suf[i]) now+=2,t[i]=1;
else t[i]=-1;
pr+=t[i],dn=min(dn,pr);
} ans=min(ans,mx-dn);
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof (x))
#define For(i,a,b) for (int i=(a);i<=(b);i++)
#define Fod(i,b,a) for (int i=(b);i>=(a);i--)
#define fi first
#define se second
#define kill _z_kill
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define outval(x) cerr<<#x" = "<<x<<endl
#define outv(x) cerr<<#x" = "<<x<<" "
#define outtag(x) cerr<<"--------------"#x"---------------"<<endl
#define outarr(a,L,R) cerr<<#a"["<<L<<".."<<R<<"] = ";\
For(_x,L,R) cerr<<a[_x]<<" ";cerr<<endl;
#define User_Time ((double)clock()/CLOCKS_PER_SEC)
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned uint;
typedef long double LD;
typedef vector <int> vi;
typedef pair <int,int> pii;
LL read(){
LL x=0,f=0;
char ch=getchar();
while (!isdigit(ch))
f=ch=='-',ch=getchar();
while (isdigit(ch))
x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
return f?-x:x;
}
const int mod=1e9+7;
int Pow(int x,int y){
int ans=1;
for (;y;y>>=1,x=(LL)x*x%mod)
if (y&1)
ans=(LL)ans*x%mod;
return ans;
}
void Add(int &x,int y){
if ((x+=y)>=mod)
x-=mod;
}
void Del(int &x,int y){
if ((x-=y)<0)
x+=mod;
}
int Add(int x){
return x>=mod?x-mod:x;
}
int Del(int x){
return x<0?x+mod:x;
}
void ckmax(int &x,int y){
if (x<y)
x=y;
}
void ckmin(int &x,int y){
if (x>y)
x=y;
}
const int N=1000005*4;
int n;
char s[N];
int pre[N],suf[N];
int gao(int dan4){
int mi=0,val=0;
For(i,1,n){
if (s[i]=='0')
val--;
else if (s[i]=='1')
val++;
else {
if (val+1+suf[i]-pre[i]<=dan4)
val++;
else
val--;
}
mi=min(mi,val);
}
return dan4-mi;
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
For(i,1,n)
pre[i]=pre[i-1]+(s[i]=='1'?1:-1);
suf[n]=pre[n];
Fod(i,n-1,0)
suf[i]=max(suf[i+1],pre[i]);
// outarr(pre,0,n);
// outarr(suf,0,n);
cout<<min(gao(suf[0]),gao(suf[0]+1))<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
char ch[N]; int n, cnt, c[N], tmp, res = 1e9;
inline void check (int mx) {
int mn = 0, t = 0;
for (int i = 1; i <= n; ++i) {
if (ch[i] == '0') ++t;
else if (ch[i] == '1') --t;
else (t + 1 + c[i + 1] <= mx) ? ++t : --t;
mn = min (mn, t);
} res = min (res, mx - mn);
}
signed main() {
scanf ("%s", ch + 1); n = strlen (ch + 1);
for (int i = n; i >= 1; --i)
c[i] = max (0, c[i + 1] + (ch[i] == '0' ? 1 : -1));
for (int i = 1; i <= n; ++i) {
(ch[i] == '0') ? ++cnt : --cnt;
tmp = max (tmp, cnt);
} check (tmp), check (tmp + 1);
return printf ("%d\n", res), 0;
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} iosetup;
int main() {
string s; cin >> s;
int n = s.length(), lb = 0, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) >> 1;
bool ok = false;
for (int parity : {0, 1}) {
int l = parity, r = mid - (mid % 2 != parity);
for (char c : s) {
if (l > r) break;
if (c == '0') {
--l; --r;
if (l < 0) l += 2;
} else if (c == '1') {
++l; ++r;
if (r > mid) r -= 2;
} else if (c == '?') {
--l; ++r;
if (l < 0) l += 2;
if (r > mid) r -= 2;
}
}
ok |= l <= r;
}
(ok ? ub : lb) = mid;
}
cout << ub << '\n';
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
char p[1010000];
int n;
bool Pos(int K){
int i;
int b[2]={0,1},e[2]={K,K-1}, CK[2]={0,0};
if(K&1)swap(e[0],e[1]);
// printf("%d\n",K);
for(i=0;p[i];i++){
int b0=b[0],b1=b[1],e0=e[0],e1=e[1];
if(p[i]=='1'){
b[0]=b1+1;
b[1]=b0+1;
e[0]=e1+1;
e[1]=e0+1;
if(e[0]>K)e[0]-=2;
if(e[1]>K)e[1]-=2;
}
if(p[i]=='0'){
b[0]=b1-1;
b[1]=b0-1;
e[0]=e1-1;
e[1]=e0-1;
if(b[0]<0)b[0]+=2;
if(b[1]<0)b[1]+=2;
}
if(p[i]=='?'){
b[0]=b1-1;
b[1]=b0-1;
e[0]=e1+1;
e[1]=e0+1;
if(b[0]<0)b[0]+=2;
if(b[1]<0)b[1]+=2;
if(e[0]>K)e[0]-=2;
if(e[1]>K)e[1]-=2;
}
if(b[0]>e[0])CK[0]=1;
if(b[1]>e[1])CK[1]=1;
if(CK[0]&&CK[1])return false;
swap(CK[0],CK[1]);
}
return true;
}
int main(){
scanf("%s",p);
int i;
for(i=0;p[i];i++);
n=i;
int b=1,e=n,r=n;
while(b<=e){
int mid=(b+e)>>1;
if(Pos(mid)){
r=mid;
e=mid-1;
}
else b=mid+1;
}
printf("%d\n",r);
}
|
#include<cstdio>
#include<algorithm>
char buf[1000010];
int main() {
scanf("%s", buf);
int a0 = 0, a1 = 1, b0 = 0, b1 = -1;
int c0 = a0-b0, c1 = a0-b1, c2 = a1-b0, c3 = a1-b1;
for(char *p = buf; *p; p++) {
if(*p=='0') { --a0; --a1; --b0; --b1; }
else if(*p=='1') { ++a0; ++a1; ++b0; ++b1; }
else { --a0; --a1; ++b0; ++b1; }
if(a0 < 0) a0 += 2;
if(a1 < 0) a1 += 2;
if(b0 > 0) b0 -= 2;
if(b1 > 0) b1 -= 2;
c0 = std::max(c0, a0-b0);
c1 = std::max(c1, a0-b1);
c2 = std::max(c2, a1-b0);
c3 = std::max(c3, a1-b1);
}
printf("%d\n", std::min(std::min(c0, c1), std::min(c2, c3)));
return 0;
} |
#include<bits/stdc++.h>
#define y1 dmytxdy
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
int readint(){
int x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n;
int a[1000005];
char s[1000005];
int getans(int x){
int tag=0,ret=0,now=0;
for(int i=1;i<=n;i++){
if(s[i]=='?'){
if(tag+a[i]+2<=x) tag+=2,now++;
else now--;
}
else now+=s[i]=='1'?1:-1;
chkmin(ret,now);
}
return ret;
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++) a[i]=a[i-1]+(s[i]=='1'?1:-1);
for(int i=n-1;i>=0;i--) chkmax(a[i],a[i+1]);
printf("%d\n",min(a[0]-getans(a[0]),a[0]+1-getans(a[0]+1)));
return 0;
} |
#pragma GCC optimize ("O3")
// #pragma GCC target ("avx")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
putchar('\n');
}
int N;
char S[1000011];
int H[1000011];
int ans;
void solve(int height) {
int cur = 0;
int mi = 0;
int ma = 0;
REP (i, N) {
if (S[i] == '0') cur--;
else if (S[i] == '1') cur++;
else {
if (cur + 1 <= height && cur + 1 + H[i+1] <= height) {
cur++;
} else {
cur--;
}
}
amin(mi, cur);
amax(ma, cur);
}
amin(ans, ma - mi);
}
void MAIN() {
scanf("%s", S);
N = strlen(S);
ans = 1<<29;
solve(0);
REP (a, 2) {
REP (b, 2) {
int cur = 0;
int ma = 0;
for (int i=N; i--;) {
if (S[i] == '1') cur--;
else cur++;
amax(ma, cur);
H[i] = ma - cur;
}
int height = max(0, *max_element(H, H+N));
for (int d=-10; d<=10; d++) {
if (0 <= height + d) solve(height + d);
}
reverse(S, S+N);
}
REP (i, N) if (S[i] != '?') S[i] ^= 1;
}
printf("%d\n", ans);
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin>>s;
ll n = s.size();
vector<ll> cum_sum;
cum_sum.push_back(0); //cum_sum stores cumulative sum assuming 0s and ?s are -1
for(auto c:s)
cum_sum.push_back(cum_sum.back() + (c=='1'?1:-1));
vector<ll> max_sum_to_right = cum_sum;
for(ll i=n-1;i>=0;i--)
max_sum_to_right[i] = max(max_sum_to_right[i],max_sum_to_right[i+1]);
ll mx = -1;
for(ll i=0;i<=n;i++)
mx = max(mx,cum_sum[i]);
ll ans = INT64_MAX;
for(ll random_variable=0;random_variable<2;random_variable++){
ll cur = 0,mn = 0;
for(ll i=0;i<n;i++){
if(s[i] == '?'){
if(cur + max_sum_to_right[i+1] - cum_sum[i] +2 <=mx)
cur++;
else
cur--;
}
else if(s[i] == '0')
cur--;
else
cur++;
mn = min(mn,cur);
}
ans = min(ans,mx-mn);
mx++;
}
cout<<ans<<endl;
return 0;
} |
/*
* Since g++10 is released, some characters is not valid inside #if 0 :(
* So, why not using clang++? :D
* Date:
echo -n ' ' && date +%Y.%m.%d # Just Run this (Type !!sh in Vim).
* Solution:
To be updated after "Accept".
* Digression:
* CopyRight:
▁▃▄▄▄▃▃▃▃▄▶
▗▇▀▔ ▔▔▔▔
▄▛ ▃▅━━■▄▂
▟▊ ▐▘ ▀▙
▟▜▌ ▐▖ ▋ ▐▍
▟▘ ▜ ▝▀▇▆●▘ ▐▌
▗▟▘ ▜▃ ▁▅▛
▔▀▼▅▄▃▃██▅▄▄▄▅■▀▔
▔▔▔▔▔▔
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
const int maxn = 1000005;
char s[maxn];
int pre[maxn];
int smax[maxn];
int f (int n, int lim) {
int add = 0, p = 0, res = 0;
for (int i = 1; i <= n; i ++) {
p += (s[i] == '1' ? 1 : -1);
if (s[i] == '?' and add + smax[i] + 2 <= lim)
add += 2, p += 2;
res = std::min(res, p);
}
return res;
}
int main () {
scanf("%s", s + 1);
int n = int(strlen(s + 1));
int max = 0;
for (int i = 1; i <= n; i ++) {
pre[i] = pre[i - 1] + (s[i] == '1' ? 1 : -1);
max = std::max(max, pre[i]);
}
smax[n] = pre[n];
for (int i = n; i; i --)
smax[i - 1] = std::max(smax[i], pre[i - 1]);
printf("%d\n", std::min(max - f(n, max), max + 1 - f(n, max + 1)));
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = s.size();
while (left < right) {
int mid = (left + right) >> 1;
bool flag = false;
for (int base = 0; !flag && base < 2; base++) {
int low = base;
int high = mid;
if ((high ^ low) & 1) {
high--;
}
bool ok = high >= low;
for (int i = 0; ok && i < s.size(); i++) {
if (s[i] == '1' || low < 1) {
low++;
}
else {
low--;
}
if (s[i] == '0' || high > mid - 1) {
high--;
}
else {
high++;
}
ok = high >= low;
}
flag = ok;
}
if (flag) {
right = mid;
}
else {
left = mid + 1;
}
}
cout << left << endl;
} |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, z = 0, ans = 100000000, fz = -1000000;
string s;
vector<int> sum, maxi;
cin >> s;
n = s.size();
sum.resize(s.size() + 10);
maxi.resize(sum.size());
sum[0] = 0;
for (int i = 0; i < s.size(); i++) {
sum[i + 1] = sum[i];
if (s[i] == '1') {
sum[i + 1]++;
} else {
sum[i + 1]--;
}
z = max(z, sum[i + 1]);
}
maxi[n] = z;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '1') {
maxi[i] = maxi[i + 1] - 1;
} else {
maxi[i] = min(z, maxi[i + 1] + 1);
}
}
int cnt = 0;
int mini = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1' || s[i] == '?' && maxi[i + 1] >= cnt + 1) {
cnt++;
} else {
cnt--;
}
mini = min(mini, cnt);
}
ans = z - mini;
z++;
maxi[n] = z;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '1') {
maxi[i] = maxi[i + 1] - 1;
} else {
maxi[i] = min(z, maxi[i + 1] + 1);
}
}
cnt = 0;
mini = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1' || s[i] == '?' && maxi[i + 1] >= cnt + 1) {
cnt++;
} else {
cnt--;
}
mini = min(mini, cnt);
}
ans = min(ans, z - mini);
cout << ans << endl;
} |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main()
{
string s; cin>>s;
int n=s.size();
int ans=1e9;
for(int p=0; p<2; p++){
for(int q=0; q<2; q++){
int l=0, r=0, sl=-1e9, sr=1e9;
int d=0, L=-p, R=q;
for(int i=0; i<n; i++){
if(s[i]=='0'){
l--; r--;
sl--; sr--;
if(~(i+p)&1){
sl=max(sl, 1);
}
}else if(s[i]=='1'){
l++; r++;
sl++; sr++;
if(~(i+q)&1){
sr=min(sr, -1);
}
}else{
l--; r++;
sl--; sr++;
if(~(i+p)&1){
sl=max(sl, 1);
}
if(~(i+q)&1){
sr=min(sr, -1);
}
}
d=max(d, sl-sr);
L=min(L, r-sl);
R=max(R, l-sr);
}
ans=min(ans, max(d, R-L));
}
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f;
}
char s[MAXN];
int n, a[MAXN], sMin[MAXN], sMax[MAXN]; bool b[MAXN];
void init() {
for (int i = 1; i <= n; i++) {
if (s[i] == '0') a[i] = a[i - 1] - 1;
else a[i] = a[i - 1] + 1;
if (s[i] == '?') b[i] = true;
}
sMin[n + 1] = n + 5;
for (int i = n; i >= 0; i--)
sMin[i] = min(sMin[i + 1], a[i]);
}
int work(int limit) {
int mns = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == '?' && sMin[i] - mns - 2 >= limit) {
b[i] = false;
mns += 2;
}
a[i] -= mns;
}
sMin[n + 1] = n + 5;
sMax[n + 1] = -n - 5;
for (int i = n; i >= 0; i--) {
sMin[i] = min(sMin[i + 1], a[i]);
sMax[i] = max(sMax[i + 1], a[i]);
}
int ans = sMax[0] - sMin[0];
int Max = 0, Min = 0, pls = 0; mns = 0;
for (int i = 1; i <= n; i++) {
if (b[i]) {
mns += 2;
int tmp = max(Max, sMax[i] - mns) - min(Min, sMin[i] - mns);
if (tmp < ans) ans = tmp;
}
a[i] -= mns;
chkmax(Max, a[i]);
chkmin(Min, a[i]);
}
return ans;
}
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
int ans = n + 5, tmp = 0;
init(); chkmin(ans, work(sMin[0]));
init(); chkmin(ans, work(sMin[0] - 1));
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
char s[2000010];
int sum[2000010],N,mx[2000010];
int calc(int x){
int p = 0;
for (int i=1; i<=N; i++){
if (s[i] == '1') sum[i] = sum[i-1] + 1;
else if (s[i] == '0') sum[i] = sum[i-1] - 1;
else {
if (mx[i] + 2*(p+1) <= x){
sum[i] = sum[i-1] + 1, p++;
}
else sum[i] = sum[i-1] - 1;
}
}
int mn = N;
for (int i=0; i<=N; i++) mn = min(mn,sum[i]);
return mn;
}
int main(){
scanf("%s",s+1);
N = strlen(s+1);
for (int i=1; i<=N; i++){
if (s[i] == '1'){
sum[i] = sum[i-1]+1;
} else sum[i] = sum[i-1]-1;
}
mx[N] = sum[N];
for (int i=N-1; i>=0; i--) mx[i] = max(mx[i+1],sum[i]);
int m = mx[0];
printf("%d\n",min( m-calc(m), m+1-calc(m+1) ));
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.