Submission #3773508

---

Source Code Expand

#include<iostream>
#include<cstring>
using namespace std;
inline void ini(string& a,string& b)
{
	string t1="",t2="";int la=a.size(),lb=b.size();
	for(int i=0;i<la;++i)t1+=a[i];
	for(int i=0;i<lb;++i)t2+=b[i];
	for(int i=0;i<la;++i)a[la-i-1]=t1[i];
	for(int i=0;i<lb;++i)b[lb-i-1]=t2[i];
	return;
}

int Lenn;
inline void change(string& a,int t)
{
	a[t]=a[t]=='1'?'0':'1';
	return;
}
inline int One(string a)
{
	int res=0,len=a.size();
	for(int i=0;i<len;++i)
		if(a[i]=='1')
			res++;
	return res;
}
int X[1000002]={0};
inline void add(string& x)
{
	int l=x.size();
	for(int i=0;i<l;++i)X[i]=x[i]-48;
	X[0]+=1;
	for(int i=0;i<l;++i)
		if(X[i]>1)
		{
			X[i+1]+=X[i]/2,X[i]%=2;
			if(i==l-1)++l;
		}
	for(int i=0;i<l;++i)x[i]=X[i]^48;
	return;
}
inline bool comp(string a,string b,int lb)
{
	int la=a.size();
	if(la>lb)return true;
	if(la<lb)return false;
	for(int i=la-1;i>=0;--i)
		if(a[i]>b[i])return true;
		else if(a[i]<b[i])return false;
	//return true;
	return true;
}
inline void suwakow(string& s)
{
	int t=0,l=s.size();
	int num[1000002]={0};
	for(int i=0;i<l;++i)num[i]=s[i]-48;
	for(int i=0;i<l;++i)
	{
		num[i]+=t;t=0;
		if(num[i]>1) t=num[i]/2;
		num[i]%=2;
		if(t&&i==l-1)++l;
	}
	for(int i=0;i<l;++i)s[i]=num[i]^48;
	return;
}int H[1000002]={0};
string h;
inline int Add(string a,string b)
{
	int la=a.size(),lb=b.size();
	int l=max(la,lb);
	string h;
	int t=0;
	for(int i=0;i<l;++i)
	{
		H[i]=t;t=0;
		if(i<la)H[i]+=a[i]-48;
		if(i<lb)H[i]+=b[i]-48;
		t=H[i]/2,H[i]%=2;
		if(t&&i==l-1)++l;
		//cout<<"a:"<<a[i]<<endl<<"b:"<<b[i]<<endl;
		//cout<<endl;
		//cout<<"h:"<<H[i]<<endl<<endl;
	}
	
	//cout<<endl;system("cls");
	for(int i=0;i<l;++i) 
	{
		//cout<<"H:"<<H[i]<<"   ";
		h[i]=H[i]+48;
		//cout<<"h:"<<h[i]<<endl;
	}
	return l;
}
inline int findX(string a,string b)
{
	string X,x=a;
	int maxx=One(x);
	//cout<<"x:"<<x<<endl;
	//cout<<"maxx:"<<maxx<<endl;
	//cout<<endl;system("cls");
	 ///
	int l=Add(a,b);
	while(!comp(x,h,l))
	{
		add(x);
		//cout<<"x:"<<x<<endl;
		//system("cls");
		
		int t=One(x);
		if(t>maxx)
			maxx=t,X=x;
		if(maxx>=Lenn)return Lenn;//
		//cout<<x<<endl<<endl;
	}
	//return X;
	return maxx;
}
inline int two2ten(string a)
{
	int res=0;
	int l=a.size();
	for(int i=0;i<l;++i)
		if(a[i]^48)
			res+=1<<i;
	return res;
}

int findnew(string a,string b)
{
	int l=Add(a,b);
	bool f=0;
	int sum=0;
	for(int i=l-1;i>=0;--i)
		if(h[i]=='1')
		{
			f=1;
			sum++;
		}
		else 
		if(h[i]=='0'&&f&&i-1>=0&&h[i-1]=='1')
		{
			sum+=i-1;
			return sum;
		}
	return sum;
}
int main()
{
	ios::sync_with_stdio(false);
	int n,t;string a,b;
	cin>>n>>a>>b;ini(a,b);//getchar();
	Lenn=max(a.size(),b.size());
	//cout<<a<<endl<<b<<endl<<endl;
	//return 0;
	while(n--)
	{
		string ch;cin>>ch;
		//cout<<ch<<endl;
		
		//system("cls");
		if(ch=="Q")
			{
				//int x=findX(a,b);
				//cout<<a<<endl<<b<<endl;
				cout<<findX(a,b)<<endl;
				//cout<<findnew(a,b)<<endl;
				//cout<<two2ten(x)<<endl<<endl;
			}
		else
		if(ch=="A")
		{
			cin>>t;
			change(a,t);
		}else
		{
			cin>>t;
			change(b,t);
		}
	}
}

Submission Info

Judge Result