AC自动机及trie图 pascal

const maxn=;
type data=record
        sum,failed:longint;
        son:array ['a'..'z'] of longint;
     end;

var tree:array [..maxn] of data;
    que:array[..maxn] of longint;
    boo:array[..maxn] of boolean;
    s:array[..] of char;
    test,n,len,tot,ans:longint;

procedure PK(x:longint);
begin
    fillchar(tree[x].son,sizeof(tree[x].son),);
    tree[x].sum:=;
    tree[x].failed:=-;
end;

procedure init;

procedure insert;
var p,i:longint;
begin
    p:=;
    for i:= to len do
    begin
        if tree[p].son[s[i]]= then
        begin
            inc(tot);
            PK(tot);
            tree[p].son[s[i]]:=tot;
            p:=tot;
        end else p:=tree[p].son[s[i]];
    end;
    inc(tree[p].sum);
end;

var i:longint;
begin
    fillchar(boo,sizeof(boo),false);
    tot:=;
    PK();
    readln(n);
    for i:= to n do
    begin
        len:=;
        while not eoln do
        begin
            inc(len);
            read(s[len]);
            if not(s[len] in ['a'..'z']) then begin dec(len); break; end;
        end;
        readln;
        insert;
    end;
end;

procedure main;

procedure bfs;
var h,t,now,p,f:longint;
    ch:char;
begin
    h:=;t:=;
    que[]:=;
    while h<=t do
    begin
        now:=que[h];
        for ch:='a' to 'z' do
        begin
            p:=tree[now].son[ch];
            if p<> then
            begin
                f:=tree[now].failed;
                while (f<>-) and (tree[f].son[ch]=) do f:=tree[f].failed;
                if f=- then tree[p].failed:=
                else tree[p].failed:=tree[f].son[ch];
                inc(t);
                que[t]:=p;
            end;
        end;
        inc(h);
    end;
end;

procedure AC_Automaton;
var i,now,p,f:longint;
begin
    i:=;
    now:=;
    while i<=len do
    begin
        p:=tree[now].son[s[i]];
        if p<> then
        begin
            f:=p;
            while (not boo[f]) and (f<>) do
            begin
                boo[f]:=true;
                inc(ans,tree[f].sum);
                f:=tree[f].failed;
            end;
            now:=p;
            inc(i);
        end else
        begin
            f:=now;
            while (f<>-) and (tree[f].son[s[i]]=) do f:=tree[f].failed;
            now:=f;
            if now=- then
            begin
                now:=;
                inc(i);
            end;
        end;
    end;
end;

begin
    bfs;
    len:=;
    while not eoln do
    begin
        inc(len);
        read(s[len]);
        if not(s[len] in ['a'..'z']) then begin dec(len); break; end;
    end;
    readln;
    ans:=;
    AC_Automaton;
    writeln(ans);
end;

begin
    readln(test);
    while test> do
    begin
        init();
        main();
        dec(test);
    end;
end.