Submission #3369267

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define MAXN 2010
#define INF 1000000000
int n,ans=INF;
char a[MAXN],b[MAXN];
int st[MAXN],L[MAXN],R[MAXN];
bool cmpL(int x,int y)
{
	return L[x]<L[y];
}
bool cmpR(int x,int y)
{
	return R[x]<R[y];
}
int main()
{
	scanf("%s%s",a,b);
	n=strlen(a);
	bool f1=0,f2=0;
	for(int i=0;i<n;i++)
	{
		if(a[i]=='1') f1=1;
		if(b[i]=='1') f2=1;
	}
	if(!f2)
	{
		if(!f1) printf("0\n");
		else printf("-1\n");
		return 0;
	}	
	for(int i=0;i<n;i++)
	{
		for(int j=i;b[j]=='0';j=(j-1+n)%n)
			L[i]++;
		for(int j=i;b[j]=='0';j=(j+1)%n)
			R[i]++;
	}
	for(int i=0;i<n;i++)
	{
		int tmp=0,mx=0,r=0;
		for(int j=0,k=i;j<n;k=(k+1)%n,j++)
		{
			if(b[j]==a[k]) continue;
			tmp++;
			if(L[k]>i) st[++r]=k;
		}
		sort(st+1,st+1+r,cmpL);
		for(int j=r;j;j--)
		{
			ans=min(ans,mx*2+i+tmp+(L[st[j]]-i)*2);
			mx=max(mx,R[st[j]]);
		}
		ans=min(ans,mx*2+i+tmp);
		tmp=0,mx=0,r=0;
		for(int j=0,k=(n-i)%n;j<n;k=(k+1)%n,j++)
		{
			if(b[j]==a[k]) continue;
			tmp++;
			if(R[k]>i) st[++r]=k;
		}
		sort(st+1,st+1+r,cmpR);
		for(int j=r;j;j--)
		{
			ans=min(ans,mx*2+i+tmp+(R[st[j]]-i)*2);
			mx=max(mx,L[st[j]]);
		}
		ans=min(ans,mx*2+i+tmp);
	}
	printf("%d\n",ans);
}

Submission Info

Compile Error

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

Judge Result