Submission #1697766


Source Code Expand

#include<bits/stdc++.h>
#define N 1000009
using namespace std;

int n,q[N]; char s1[N],s2[N];
int main(){
	scanf("%d%s%s",&n,s1+1,s2+1);
	if (!strcmp(s1+1,s2+1)){
		puts("0"); return 0;
	}
	int i,j,head=1,tail=0,ans=0;
	for (i=j=n; i; i--) if (s2[i]!=s2[i-1]){
		j=min(i,j);
		for (; j && s1[j]!=s2[i]; j--);
		if (!j){
			puts("-1"); return 0;
		}
		while (head<=tail && i<q[tail]-(tail-head)) tail--;
		q[++tail]=j;
		ans=max(ans,tail-head+1);
	}
	printf("%d\n",ans+1);
	return 0;
}

Submission Info

Submission Time
Task F - Shik and Copying String
User lych_cys
Language C++14 (GCC 5.4.1)
Score 0
Code Size 509 Byte
Status WA
Exec Time 17 ms
Memory 6144 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%s%s",&n,s1+1,s2+1);
                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 4
AC × 18
WA × 45
Set Name Test Cases
Sample example0.txt, example1.txt, example2.txt, example3.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, 050.txt, 051.txt, 052.txt, 053.txt, 054.txt, 055.txt, 056.txt, 057.txt, 058.txt, example0.txt, example1.txt, example2.txt, example3.txt
Case Name Status Exec Time Memory
000.txt AC 2 ms 256 KB
001.txt AC 1 ms 256 KB
002.txt AC 1 ms 256 KB
003.txt AC 1 ms 256 KB
004.txt WA 1 ms 256 KB
005.txt AC 1 ms 256 KB
006.txt AC 1 ms 256 KB
007.txt AC 1 ms 256 KB
008.txt WA 1 ms 256 KB
009.txt AC 1 ms 256 KB
010.txt WA 1 ms 256 KB
011.txt WA 1 ms 256 KB
012.txt WA 1 ms 256 KB
013.txt AC 1 ms 256 KB
014.txt WA 1 ms 256 KB
015.txt WA 1 ms 256 KB
016.txt WA 1 ms 256 KB
017.txt AC 1 ms 256 KB
018.txt WA 1 ms 256 KB
019.txt WA 1 ms 256 KB
020.txt WA 1 ms 256 KB
021.txt WA 1 ms 256 KB
022.txt WA 1 ms 256 KB
023.txt WA 1 ms 256 KB
024.txt WA 1 ms 256 KB
025.txt AC 7 ms 2176 KB
026.txt WA 12 ms 6144 KB
027.txt WA 10 ms 4352 KB
028.txt WA 17 ms 4608 KB
029.txt WA 17 ms 4608 KB
030.txt WA 10 ms 2176 KB
031.txt WA 10 ms 2176 KB
032.txt WA 11 ms 4352 KB
033.txt WA 11 ms 4352 KB
034.txt WA 11 ms 4352 KB
035.txt WA 11 ms 4352 KB
036.txt WA 11 ms 4352 KB
037.txt WA 11 ms 4352 KB
038.txt WA 11 ms 4352 KB
039.txt WA 11 ms 4352 KB
040.txt WA 15 ms 4352 KB
041.txt WA 15 ms 4992 KB
042.txt WA 13 ms 5888 KB
043.txt WA 13 ms 6016 KB
044.txt WA 12 ms 6144 KB
045.txt WA 12 ms 6144 KB
046.txt WA 12 ms 6144 KB
047.txt WA 12 ms 6144 KB
048.txt WA 13 ms 6144 KB
049.txt WA 12 ms 6144 KB
050.txt AC 12 ms 6144 KB
051.txt AC 12 ms 6144 KB
052.txt AC 10 ms 4352 KB
053.txt WA 15 ms 4352 KB
054.txt WA 14 ms 4352 KB
055.txt WA 13 ms 4352 KB
056.txt WA 13 ms 4352 KB
057.txt WA 13 ms 4352 KB
058.txt WA 13 ms 4352 KB
example0.txt AC 1 ms 256 KB
example1.txt AC 1 ms 256 KB
example2.txt AC 1 ms 256 KB
example3.txt AC 1 ms 256 KB