pku1625 AC自动机，动态规划

我是dp菜。。而且这是第一次写AC自动机，以前AC自动机只是停留在理论阶段，虽然写过几次trie，但是这样完整的AC自动机还是第一次写。其实AC自动机就是一个树形kmp，fail指针都那么像（其实kmp里头我叫p数组，并且我现在还不会扩展kmp，只会朴素kmp和后缀数组，所以我是字符串菜，很多东西都不会呢）。

题目大意：

  给你n个字母，用这些字母组成长度为m的字符串，并且这些字符串中不能包含以下k个字符串。求总共有多少种方法。

简略题解：

  构建一棵AC自动机，然后dp，f[i,ctree[j].son[k]]=sum{f[i-1,j]}，然后由于结果很大要用压位高精。额，还有这题最sb的是要读字符而不是字符串，要不然就shax地RE掉，多亏了cai0715神牛，偲哥威武。。

附代码：

program pku_1625; type atp=array[0..23] of longint; var ctree:array[0..1501] of record f:boolean; fail:longint; son:array[0..51] of longint; end; f:array[0..51,0..1501,0..23] of longint; s:array[0..11] of longint; a:array[0..51] of char; zt:array[0..1501] of longint; ans:array[0..23] of longint; n,m,sum,len,tot:longint; {--------------------------------} function get(t:char):longint; var i:longint; begin for i:=1 to n do if a[i]=t then exit(i); end; {--------------------------------} procedure insert; var i,p:longint; begin p:=1; for i:=1 to len do begin if ctree[p].son[s[i]]=0 then begin inc(tot); ctree[p].son[s[i]]:=tot; end; p:=ctree[p].son[s[i]]; end; ctree[p].f:=true; end; {--------------------------------} procedure getfail; var l,r,now,p,t,i:longint; begin l:=0;r:=1; zt[1]:=1; while l<r do begin inc(l); now:=zt[l]; for i:=1 to n do begin p:=ctree[now].son[i]; if p<>0 then begin t:=ctree[now].fail; while (t<>0) and (ctree[t].son[i]=0) do t:=ctree[t].fail; if t=0 then ctree[p].fail:=1 else ctree[p].fail:=ctree[t].son[i]; ctree[p].f:=ctree[p].f or ctree[ctree[p].fail].f; inc(r); zt[r]:=p; end else begin t:=ctree[now].fail; while (t<>0) and (ctree[t].son[i]=0) do t:=ctree[t].fail; if t=0 then ctree[now].son[i]:=1 else ctree[now].son[i]:=ctree[t].son[i]; end; end; end; end; {--------------------------------} procedure grow(var c:atp; a,b:atp); var i,j,len:longint; begin if a[0]>b[0] then len:=a[0] else len:=b[0]; j:=0; for i:=1 to len do begin c[i]:=a[i]+b[i]+j; j:=c[i] div 10000; c[i]:=c[i] mod 10000; end; if j>0 then begin inc(len); c[len]:=j; end; c[0]:=len; end; {--------------------------------} procedure init; var i:longint; t:char; begin fillchar(ctree,sizeof(ctree),0); tot:=1; readln(n,m,sum); for i:=1 to n do read(a[i]); readln; for i:=1 to sum do begin len:=0; while not eoln do begin inc(len); read(t); s[len]:=get(t); end; readln; insert; end; end; {--------------------------------} procedure main; var i,j,k:longint; begin fillchar(f,sizeof(f),0); fillchar(ans,sizeof(ans),0); f[0,1,0]:=1;f[0,1,1]:=1; for i:=1 to m do for j:=1 to tot do if f[i-1,j,0]>0 then for k:=1 to n do if not ctree[ctree[j].son[k]].f then grow(f[i,ctree[j].son[k]],f[i,ctree[j].son[k]],f[i-1,j]); for i:=1 to tot do if f[m,i,0]>0 then grow(ans,ans,f[m,i]); write(ans[ans[0]]); for i:=ans[0]-1 downto 1 do begin if ans[i]<1000 then write(0); if ans[i]<100 then write(0); if ans[i]<10 then write(0); write(ans[i]); end; writeln; end; {--------------------------------} begin init; getfail; main; end.