Submission #3053652


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>

#define EXIT puts("-1"),exit(0)

using namespace std;

deque<int> dq;
int n,ans;
char str1[1000001],str2[1000001];

int main(){
	scanf("%d%s%s",&n,str1+1,str2+1);
	dq.push_back(n+1);
	for(int i=n,j=n+1,d=0;i;--i){
		int t=j;
		j=min(i,j);
		while(j&&str1[j]!=str2[i])--j;
		if(j<1)EXIT;
		if(t==j){while(!dq.empty()&&dq.back()+d>=i)dq.pop_back();dq.push_back(i-d);}else{
			--d;
			if(i!=j)ans=max(ans,(int)dq.size()),dq.push_front(j-d);
		}
	}
	printf("%d",ans);
}

Submission Info

Submission Time
Task E - Snuke Line
User luogu_bot5
Language C++14 (GCC 5.4.1)
Score 0
Code Size 563 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
WA × 2
WA × 39
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt
Case Name Status Exec Time Memory
00_example_01.txt WA 1 ms 256 KB
00_example_02.txt WA 1 ms 256 KB
01.txt WA 1 ms 256 KB
02.txt WA 1 ms 256 KB
03.txt WA 1 ms 256 KB
04.txt WA 1 ms 256 KB
05.txt WA 1 ms 256 KB
06.txt WA 1 ms 256 KB
07.txt WA 1 ms 256 KB
08.txt WA 1 ms 256 KB
09.txt WA 1 ms 256 KB
10.txt WA 1 ms 256 KB
11.txt WA 2 ms 256 KB
12.txt WA 2 ms 256 KB
13.txt WA 2 ms 256 KB
14.txt WA 2 ms 256 KB
15.txt WA 2 ms 256 KB
16.txt WA 2 ms 256 KB
17.txt WA 2 ms 256 KB
18.txt WA 2 ms 256 KB
19.txt WA 2 ms 256 KB
20.txt WA 2 ms 256 KB
21.txt WA 2 ms 256 KB
22.txt WA 2 ms 256 KB
23.txt WA 2 ms 256 KB
24.txt WA 2 ms 256 KB
25.txt WA 2 ms 256 KB
26.txt WA 2 ms 256 KB
27.txt WA 2 ms 256 KB
28.txt WA 2 ms 256 KB
29.txt WA 2 ms 256 KB
30.txt WA 2 ms 256 KB
31.txt WA 2 ms 256 KB
32.txt WA 2 ms 256 KB
33.txt WA 2 ms 256 KB
34.txt WA 2 ms 256 KB
35.txt WA 2 ms 256 KB
36.txt WA 1 ms 256 KB
37.txt WA 1 ms 256 KB