Submission #1228929


Source Code Expand

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define rep2(i,k,n) for(int i=k;i>=n;i--)
#define pb push_back
using namespace std;
const int N=1e6+7;
vector<int> tu[26];
char S[N],T[N];
int n,R[N],ans;
int main(){
	scanf("%d%s%s",&n,S+1,T+1);
	rep(i,0,25)tu[i].pb(0);
	rep(i,1,n)R[i]=i,tu[S[i]-'a'].pb(i);
	int now=n;
	rep2(i,n,1){
		now=min(now,i);
		int op=T[i]-'a',pos=*(--upper_bound(tu[op].begin(),tu[op].end(),now));
		if(!pos){puts("-1");return 0;}
		R[pos]=max(R[pos],i);
		now=pos;
	}
	int res;now=0;
	rep(i,1,n)if(R[i]!=i){
		if(i>now)res=0;
		res++,ans=max(ans,res),now=R[i];
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task F - Shik and Copying String
User jiazihankk
Language C++14 (GCC 5.4.1)
Score 0
Code Size 669 Byte
Status WA
Exec Time 69 ms
Memory 11336 KB

Compile Error

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

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 2 ms 2304 KB
001.txt AC 2 ms 2304 KB
002.txt AC 2 ms 2304 KB
003.txt AC 2 ms 2304 KB
004.txt AC 2 ms 2304 KB
005.txt AC 2 ms 2304 KB
006.txt AC 2 ms 2304 KB
007.txt AC 2 ms 2304 KB
008.txt AC 2 ms 2304 KB
009.txt AC 2 ms 2304 KB
010.txt WA 2 ms 2304 KB
011.txt WA 2 ms 2304 KB
012.txt WA 2 ms 2304 KB
013.txt WA 2 ms 2304 KB
014.txt WA 2 ms 2304 KB
015.txt WA 2 ms 2304 KB
016.txt WA 2 ms 2304 KB
017.txt WA 2 ms 2304 KB
018.txt WA 2 ms 2304 KB
019.txt WA 2 ms 2304 KB
020.txt WA 2 ms 2304 KB
021.txt WA 2 ms 2304 KB
022.txt WA 2 ms 2304 KB
023.txt WA 2 ms 2304 KB
024.txt WA 2 ms 2304 KB
025.txt AC 63 ms 11076 KB
026.txt AC 69 ms 10948 KB
027.txt AC 49 ms 11088 KB
028.txt WA 68 ms 10928 KB
029.txt WA 69 ms 10644 KB
030.txt WA 64 ms 11024 KB
031.txt WA 63 ms 11020 KB
032.txt WA 61 ms 10956 KB
033.txt WA 61 ms 10948 KB
034.txt WA 57 ms 10984 KB
035.txt WA 56 ms 11076 KB
036.txt WA 52 ms 11080 KB
037.txt WA 50 ms 11016 KB
038.txt WA 48 ms 10920 KB
039.txt WA 46 ms 10948 KB
040.txt AC 61 ms 10916 KB
041.txt AC 65 ms 11204 KB
042.txt AC 67 ms 10956 KB
043.txt AC 68 ms 11080 KB
044.txt AC 69 ms 11144 KB
045.txt AC 69 ms 10952 KB
046.txt AC 68 ms 11080 KB
047.txt AC 69 ms 11164 KB
048.txt AC 69 ms 11084 KB
049.txt AC 69 ms 11080 KB
050.txt AC 41 ms 10808 KB
051.txt AC 41 ms 10808 KB
052.txt AC 27 ms 11128 KB
053.txt AC 54 ms 11048 KB
054.txt AC 54 ms 10956 KB
055.txt AC 55 ms 11336 KB
056.txt AC 55 ms 10900 KB
057.txt AC 56 ms 11336 KB
058.txt AC 55 ms 10904 KB
example0.txt AC 2 ms 2304 KB
example1.txt AC 2 ms 2304 KB
example2.txt AC 2 ms 2304 KB
example3.txt AC 2 ms 2304 KB