Submission #1613445


Source Code Expand

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>

using namespace std;
const int MX=2011,inf=0x3f3f3f3f;
char a[MX],b[MX];

int n;
int main(){
	scanf("%s%s",a,b);
	n=strlen(a);
	int sa=0,sb=0,ans=inf;
	for(int i=0;i<n;i++)a[i]-='0',b[i]-='0';
	for(int i=0;i<n;i++)sa+=a[i],sb+=b[i];
	if(!sb&&sa)return puts("-1"),0;
	for(int i=0;i<n;i++){
		static int L[MX],R[MX];
		int tans=0;
		
		for(int j=0;j<n;j++)L[j]=(b[j]?j:L[(j+n-1)%n]);
		for(int j=0;j<n;j++)L[j]=(b[j]?j:L[(j+n-1)%n]);
		
		for(int j=n-1;j>=0;j--)R[j]=(b[j]?j:R[(j+1)%n]);
		for(int j=n-1;j>=0;j--)R[j]=(b[j]?j:R[(j+1)%n]);
		
		for(int j=0;j<n;j++)tans+=(b[j]^a[j]);
		
		static int lr[MX];
		memset(lr,0,sizeof(int)*n);
		
		for(int j=0;j<n;j++)if(!b[j]&&a[j]){
			int dl=(j+n-L[j])%n,dr=(R[j]-j+n)%n;
			if(dl<=i)continue;
			dl-=i;
			lr[dl]=max(lr[dl],dr);
		}
		
		int X,Y=0,td=inf;
		for(X=n-1;X>=0;X--){
			td=min(td,X+Y);
			Y=max(Y,lr[X]);
		}
		
		tans+=td*2+i;
		
		ans=min(ans,tans);
		
		char t=b[0];for(int i=0;i<n-1;i++)b[i]=b[i+1];b[n-1]=t;
	}
	for(int i=0,j=n-1;i<j;i++,j--)swap(a[i],a[j]),swap(b[i],b[j]);
	for(int i=0;i<n;i++){
		static int L[MX],R[MX];
		int tans=0;
		
		for(int j=0;j<n;j++)L[j]=(b[j]?j:L[(j+n-1)%n]);
		for(int j=0;j<n;j++)L[j]=(b[j]?j:L[(j+n-1)%n]);
		
		for(int j=n-1;j>=0;j--)R[j]=(b[j]?j:R[(j+1)%n]);
		for(int j=n-1;j>=0;j--)R[j]=(b[j]?j:R[(j+1)%n]);
		
		for(int j=0;j<n;j++)tans+=(b[j]^a[j]);
		
		static int lr[MX];
		memset(lr,0,sizeof(int)*n);
		
		for(int j=0;j<n;j++)if(!b[j]&&a[j]){
			int dl=(j+n-L[j])%n,dr=(R[j]-j+n)%n;
			if(dl<=i)continue;
			dl-=i;
			lr[dl]=max(lr[dl],dr);
		}
		
		int X,Y=0,td=inf;
		for(X=n-1;X>=0;X--){
			td=min(td,X+Y);
			Y=max(Y,lr[X]);
		}
		
		tans+=td*2+i;
		
		ans=min(ans,tans);
		
		char t=b[0];for(int i=0;i<n-1;i++)b[i]=b[i+1];b[n-1]=t;
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task D - Shift and Flip
User CommonAnts
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1943 Byte
Status AC
Exec Time 202 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12: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

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 4
AC × 54
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
sample_04.txt AC 1 ms 128 KB
subtask_1_01.txt AC 1 ms 128 KB
subtask_1_02.txt AC 1 ms 128 KB
subtask_1_03.txt AC 1 ms 128 KB
subtask_1_04.txt AC 140 ms 256 KB
subtask_1_05.txt AC 48 ms 256 KB
subtask_1_06.txt AC 1 ms 128 KB
subtask_1_07.txt AC 48 ms 256 KB
subtask_1_08.txt AC 3 ms 256 KB
subtask_1_09.txt AC 1 ms 128 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 202 ms 256 KB
subtask_1_12.txt AC 145 ms 256 KB
subtask_1_13.txt AC 198 ms 256 KB
subtask_1_14.txt AC 171 ms 256 KB
subtask_1_15.txt AC 174 ms 256 KB
subtask_1_16.txt AC 177 ms 256 KB
subtask_1_17.txt AC 176 ms 256 KB
subtask_1_18.txt AC 179 ms 256 KB
subtask_1_19.txt AC 182 ms 256 KB
subtask_1_20.txt AC 179 ms 256 KB
subtask_1_21.txt AC 158 ms 256 KB
subtask_1_22.txt AC 158 ms 256 KB
subtask_1_23.txt AC 175 ms 256 KB
subtask_1_24.txt AC 175 ms 256 KB
subtask_1_25.txt AC 175 ms 256 KB
subtask_1_26.txt AC 1 ms 256 KB
subtask_1_27.txt AC 2 ms 256 KB
subtask_1_28.txt AC 10 ms 256 KB
subtask_1_29.txt AC 39 ms 256 KB
subtask_1_30.txt AC 150 ms 256 KB
subtask_1_31.txt AC 1 ms 128 KB
subtask_1_32.txt AC 1 ms 256 KB
subtask_1_33.txt AC 2 ms 256 KB
subtask_1_34.txt AC 10 ms 256 KB
subtask_1_35.txt AC 39 ms 256 KB
subtask_1_36.txt AC 155 ms 256 KB
subtask_1_37.txt AC 1 ms 256 KB
subtask_1_38.txt AC 2 ms 256 KB
subtask_1_39.txt AC 10 ms 256 KB
subtask_1_40.txt AC 40 ms 256 KB
subtask_1_41.txt AC 158 ms 256 KB
subtask_1_42.txt AC 158 ms 256 KB
subtask_1_43.txt AC 153 ms 256 KB
subtask_1_44.txt AC 160 ms 256 KB
subtask_1_45.txt AC 156 ms 256 KB
subtask_1_46.txt AC 158 ms 256 KB