Submission #1794966

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=2020,oo=1000000000;
int i,j,k,n,m,ch,fga,fgb,num,ans,res;
int l[N],r[N],ma[N];
char A[N],B[N];
int main() {
	ans=oo;
	scanf("%s",A);
	scanf("%s",B);
	n=strlen(A);
	fga=fgb=-1;
	for (i=0;i<n;i++) if (A[i]=='1') { fga=i;break;}
	for (i=0;i<n;i++) if (B[i]=='1') { fgb=i;break;}
	if (fgb==-1) {
		if (fga==-1) puts("0");
		else puts("-1");
		return 0;
	}
	for (i=fgb;i<fgb+n;i++) {
		if (B[i%n]=='1') num=0;
		else num++;
		l[i%n]=num;
	}
	for (i=fgb+n;i>fgb;i--) {
		if (B[i%n]=='1') num=0;
		else num++;
		r[i%n]=num;
	}
	for (i=0;i<n;i++) {
		res=i;
		memset(ma,0,sizeof ma);
		for (j=0;j<n;j++) if (A[(j+i)%n]!=B[j]) {
			res++;
			int a=max(0,l[(j+i)%n]-i);
			ma[a]=max(ma[a],r[(j+i)%n]);
		}
		for (j=n-1;j>=0;j--) ma[j]=max(ma[j],ma[j+1]);
		for (j=0;j<n;j++) ans=min(ans,res+2*(j+ma[j+1]));
	}
	for (i=0;i<n;i++) {
		res=i;
		memset(ma,0,sizeof ma);
		for (j=0;j<n;j++) if (A[j]!=B[(i+j)%n]) {
			res++;
			int a=max(0,r[j%n]-i);
			ma[a]=max(ma[a],l[j%n]);
		}
		for (j=n-1;j>=0;j--) ma[j]=max(ma[j],ma[j+1]);
		for (j=0;j<n;j++) ans=min(ans,res+2*(j+ma[j+1]));
	}
	printf("%d\n",ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",A);
               ^
./Main.cpp:12:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",B);
               ^

Judge Result