【NOIP2016A组模拟7.13】字符串匹配 题解+代码

Description

Input

一个整数n和两个字符串

Output

答案

Sample Input

2
usaco
cowusacousa

Sample Output

3

Data Constraint

$n<=10^{12} |s|,|t|<10^5$

Solution

又是字符串匹配！KMP裸题
稍加一点改变而已
设上面的字符串为s，下面为t，因为t可能比s短，那就先复制足够多使|t|>|s|
算出当前的匹配数a1
再复制一个t上去，再算匹配数a2
(a2-a1)就是每复制一次会多多少
那就直接乘（N-一开始复制出的数量）

Code

var
    i,j:longint;
    ans,n,m,yn,nu,jy,ans1:int64;
    s,t,yt:ansistring;
    next:array[1..101000] of longint;
procedure makenext(s:ansistring);
begin
    j:=0;
    for i:=2 to m do
    begin
        while (j>0)and(s[i]<>s[j+1])do j:=next[j];
        if (s[i]=s[j+1]) then inc(j);
        next[i]:=j;
    end;
end;
procedure kmp(s,t:ansistring);
var
    i,j:longint;
begin
    j:=0;
    for i:=1 to n do
    begin
        while(j>0)and(t[i]<>s[j+1]) do j:=next[j];
        if (t[i]=s[j+1]) then inc(j);
        if (j=m) then begin inc(ans);j:=next[j];end;
    end;
end;
begin
    readln(nu);readln(s);readln(t);
    m:=length(s);
    n:=length(t);yt:=t;yn:=n;
    if (nu>=2)then begin n:=n+n;t:=t+t;jy:=2;end;
    while (n<=2*m)and(jy<nu) do
    begin
        n:=n+yn;t:=t+yt;jy:=jy+1;
    end;
    makenext(s);
    ans:=0;kmp(s,t);
    n:=n+yn;t:=t+yt;;
    ans1:=ans;ans:=0;kmp(s,t);
    ans1:=ans1+(ans-ans1)*(nu-jy);
    writeln(ans1);
end.