Submission #2008311


Source Code Expand

#include <bits/stdc++.h>

using std::min;

const int N=2010;

int n;
bool can[N<<1];
char A[N<<1],B[N];

void Init() {
	scanf("%s%s",A,B);
	n=strlen(A);
}

void Solve() {
	int ans=n*n+1,fir=-1;
	for (int i=0;i<n;++i) if (B[i]=='1') { fir=i; break; }
	for (int i=0;i<n;++i) A[i+n]=A[i];
	for (int p=0;p<=n;++p) {
		int cnt=0,pre=fir+n;
		for (int j=n-1;j>=0;--j) {
			if (B[j]=='1') can[(j+p)%n]=1,pre=j;
			if (A[j+p]!=B[j] && cnt!=-1) {
				if (can[(j+p)%n]) cnt++;
				else cnt+=(pre-(j+p)%n)<<1|1;
			}
		}
		ans=min(ans,cnt+p);
	}
	for (int i=0;i<n*2;++i) can[i]=0;
	for (int p=n;p>=0;--p) {
		int cnt=0,pre=fir+n;
		for (int j=n-1;j>=0;--j) {
			if (B[j]=='1') can[(j+p)%n]=1,pre=j;
			if (A[j+p]!=B[j] && cnt!=-1) {
				if (can[(j+p)%n]) cnt++;
				else cnt+=(pre-(j+p)%n)<<1|1;
			}
		}
		ans=min(ans,cnt+n-p);
	}
	if (ans==n*n+1) printf("-1\n");
	else printf("%d\n",ans);
}

int main() {
	Init();
	Solve();
	return 0;
}

Submission Info

Submission Time
Task E - Shuffle and Swap
User Mcallor
Language C++14 (GCC 5.4.1)
Score 0
Code Size 977 Byte
Status RE
Exec Time 103 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘void Init()’:
./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 Partial All
Score / Max Score 0 / 0 0 / 1200 0 / 500
Status
AC × 1
WA × 3
AC × 2
WA × 44
AC × 3
WA × 47
RE × 38
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Partial 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
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_2_01.txt, subtask_2_02.txt, subtask_2_03.txt, subtask_2_04.txt, subtask_2_05.txt, subtask_2_06.txt, subtask_2_07.txt, subtask_2_08.txt, subtask_2_09.txt, subtask_2_10.txt, subtask_2_11.txt, subtask_2_12.txt, subtask_2_13.txt, subtask_2_14.txt, subtask_2_15.txt, subtask_2_16.txt, subtask_2_17.txt, subtask_2_18.txt, subtask_2_19.txt, subtask_2_20.txt, subtask_2_21.txt, subtask_2_22.txt, subtask_2_23.txt, subtask_2_24.txt, subtask_2_25.txt, subtask_2_26.txt, subtask_2_27.txt, subtask_2_28.txt, subtask_2_29.txt, subtask_2_30.txt, subtask_2_31.txt, subtask_2_32.txt, subtask_2_33.txt, subtask_2_34.txt, subtask_2_35.txt, subtask_2_36.txt, subtask_2_37.txt, subtask_2_38.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt WA 1 ms 256 KB
sample_04.txt WA 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt WA 1 ms 256 KB
subtask_1_03.txt WA 2 ms 256 KB
subtask_1_04.txt WA 2 ms 256 KB
subtask_1_05.txt WA 1 ms 256 KB
subtask_1_06.txt WA 1 ms 256 KB
subtask_1_07.txt WA 1 ms 256 KB
subtask_1_08.txt WA 1 ms 256 KB
subtask_1_09.txt WA 1 ms 256 KB
subtask_1_10.txt WA 2 ms 256 KB
subtask_1_11.txt WA 2 ms 256 KB
subtask_1_12.txt WA 3 ms 256 KB
subtask_1_13.txt WA 4 ms 256 KB
subtask_1_14.txt WA 3 ms 256 KB
subtask_1_15.txt WA 3 ms 256 KB
subtask_1_16.txt WA 3 ms 256 KB
subtask_1_17.txt WA 4 ms 256 KB
subtask_1_18.txt WA 4 ms 256 KB
subtask_1_19.txt WA 5 ms 256 KB
subtask_1_20.txt WA 5 ms 256 KB
subtask_1_21.txt WA 5 ms 256 KB
subtask_1_22.txt WA 6 ms 256 KB
subtask_1_23.txt WA 6 ms 256 KB
subtask_1_24.txt WA 7 ms 256 KB
subtask_1_25.txt WA 7 ms 256 KB
subtask_1_26.txt WA 7 ms 256 KB
subtask_1_27.txt WA 5 ms 256 KB
subtask_1_28.txt WA 5 ms 256 KB
subtask_1_29.txt WA 6 ms 256 KB
subtask_1_30.txt WA 5 ms 256 KB
subtask_1_31.txt WA 5 ms 256 KB
subtask_1_32.txt WA 5 ms 256 KB
subtask_1_33.txt WA 7 ms 256 KB
subtask_1_34.txt WA 7 ms 256 KB
subtask_1_35.txt WA 5 ms 256 KB
subtask_1_36.txt WA 5 ms 256 KB
subtask_1_37.txt WA 5 ms 256 KB
subtask_1_38.txt WA 5 ms 256 KB
subtask_1_39.txt WA 6 ms 256 KB
subtask_1_40.txt WA 6 ms 256 KB
subtask_1_41.txt WA 6 ms 256 KB
subtask_1_42.txt WA 6 ms 256 KB
subtask_2_01.txt RE 98 ms 256 KB
subtask_2_02.txt RE 100 ms 256 KB
subtask_2_03.txt RE 99 ms 256 KB
subtask_2_04.txt RE 100 ms 256 KB
subtask_2_05.txt RE 99 ms 256 KB
subtask_2_06.txt RE 99 ms 256 KB
subtask_2_07.txt RE 98 ms 256 KB
subtask_2_08.txt RE 98 ms 256 KB
subtask_2_09.txt RE 99 ms 256 KB
subtask_2_10.txt RE 102 ms 256 KB
subtask_2_11.txt RE 100 ms 256 KB
subtask_2_12.txt RE 101 ms 256 KB
subtask_2_13.txt RE 100 ms 256 KB
subtask_2_14.txt RE 99 ms 256 KB
subtask_2_15.txt RE 99 ms 256 KB
subtask_2_16.txt RE 100 ms 256 KB
subtask_2_17.txt RE 99 ms 256 KB
subtask_2_18.txt RE 98 ms 256 KB
subtask_2_19.txt RE 99 ms 256 KB
subtask_2_20.txt RE 100 ms 256 KB
subtask_2_21.txt RE 100 ms 256 KB
subtask_2_22.txt RE 99 ms 256 KB
subtask_2_23.txt RE 100 ms 256 KB
subtask_2_24.txt RE 100 ms 256 KB
subtask_2_25.txt RE 99 ms 256 KB
subtask_2_26.txt RE 100 ms 256 KB
subtask_2_27.txt RE 100 ms 256 KB
subtask_2_28.txt RE 100 ms 256 KB
subtask_2_29.txt RE 99 ms 256 KB
subtask_2_30.txt RE 98 ms 256 KB
subtask_2_31.txt RE 100 ms 256 KB
subtask_2_32.txt RE 98 ms 256 KB
subtask_2_33.txt RE 98 ms 256 KB
subtask_2_34.txt RE 100 ms 256 KB
subtask_2_35.txt RE 103 ms 256 KB
subtask_2_36.txt RE 100 ms 256 KB
subtask_2_37.txt RE 99 ms 256 KB
subtask_2_38.txt RE 100 ms 256 KB