Submission #1228762


Source Code Expand

#include <cstdio>

int n;
char s[1000100],t[1000100];
int w[26][1000100];

int main(void)
{
	int i;
	int	x,y;
	char z;
	int result = 0;
	
	scanf("%d %s %s",&n,s,t);
	
	for(i = 0;i < n;++i)
		s[i] -= 'a',t[i] -= 'a',w[s[i]][++w[s[i]][0]] = i;

	x = n;
	y = 0;
	for(i = n - 1;i >= 0;--i)
	{
		if((i < x && s[i] == t[i]) || (i >= x && t[i] == z))
			continue;
			
		int *h = w[t[i]],e = i < x ? i : x;
		while(h[0] && h[h[0]] >= e)
			--h[0];
		if(!h[0])
			return puts("-1"),0;
		y = (i < x ? 0 : y) + 1; 
		z = t[i];
		x = h[h[0]];
		result = result > y ? result : y;
	}
	
	printf("%d\n",result);
	
	return 0;
}

Submission Info

Submission Time
Task F - Shik and Copying String
User goodqt
Language C++14 (GCC 5.4.1)
Score 0
Code Size 649 Byte
Status WA
Exec Time 32 ms
Memory 60800 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 4
AC × 36
WA × 27
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 1 ms 4224 KB
001.txt AC 1 ms 4224 KB
002.txt AC 1 ms 4224 KB
003.txt AC 1 ms 4224 KB
004.txt AC 2 ms 6272 KB
005.txt AC 3 ms 14464 KB
006.txt AC 3 ms 14464 KB
007.txt AC 3 ms 14464 KB
008.txt AC 3 ms 14464 KB
009.txt AC 3 ms 14464 KB
010.txt WA 11 ms 53376 KB
011.txt WA 11 ms 53376 KB
012.txt WA 11 ms 53376 KB
013.txt WA 11 ms 53376 KB
014.txt WA 11 ms 53376 KB
015.txt WA 11 ms 53376 KB
016.txt WA 11 ms 53376 KB
017.txt WA 11 ms 53376 KB
018.txt WA 11 ms 53376 KB
019.txt WA 11 ms 53376 KB
020.txt WA 11 ms 53376 KB
021.txt WA 11 ms 53376 KB
022.txt WA 11 ms 53376 KB
023.txt WA 11 ms 53376 KB
024.txt WA 11 ms 53376 KB
025.txt AC 23 ms 58752 KB
026.txt AC 27 ms 58752 KB
027.txt AC 25 ms 58752 KB
028.txt WA 32 ms 58752 KB
029.txt WA 32 ms 58752 KB
030.txt WA 26 ms 58752 KB
031.txt WA 26 ms 58752 KB
032.txt WA 27 ms 58752 KB
033.txt WA 27 ms 58752 KB
034.txt WA 27 ms 58752 KB
035.txt WA 27 ms 58752 KB
036.txt WA 27 ms 58752 KB
037.txt WA 27 ms 58752 KB
038.txt WA 26 ms 58752 KB
039.txt WA 26 ms 58752 KB
040.txt AC 31 ms 58752 KB
041.txt AC 30 ms 58752 KB
042.txt AC 28 ms 58752 KB
043.txt AC 27 ms 58752 KB
044.txt AC 27 ms 58752 KB
045.txt AC 27 ms 58752 KB
046.txt AC 27 ms 58752 KB
047.txt AC 27 ms 58752 KB
048.txt AC 27 ms 58752 KB
049.txt AC 27 ms 58752 KB
050.txt AC 27 ms 58752 KB
051.txt AC 27 ms 58752 KB
052.txt AC 25 ms 60800 KB
053.txt AC 29 ms 58752 KB
054.txt AC 28 ms 58752 KB
055.txt AC 28 ms 58752 KB
056.txt AC 28 ms 58752 KB
057.txt AC 28 ms 58752 KB
058.txt AC 28 ms 58752 KB
example0.txt AC 2 ms 10368 KB
example1.txt AC 2 ms 10368 KB
example2.txt AC 1 ms 4224 KB
example3.txt AC 2 ms 10368 KB