bzoj1819

水题，上trie，然后穷举每一位的时候判定一下三种编辑

var son:array[0..10010*20,1..26] of longint;
    v:array[0..10010*20] of longint;
    d:array[0..10010] of boolean;
    s:string;
    t,i,l,n,m:longint;

procedure add(w:longint);
  var p,i,y:longint;
  begin
    p:=1;
    for i:=1 to length(s) do
    begin
      y:=ord(s[i])-96;
      if son[p,y]=0 then
      begin
        inc(t);
        son[p,y]:=t;
      end;
      p:=son[p,y];
    end;
    v[p]:=w;
  end;

function find(p,x:longint):longint;
  var i,y:longint;
  begin
    if p=0 then exit(0);
    for i:=x to l do
    begin
      y:=ord(s[i])-96;
      if son[p,y]=0 then exit(0)
      else p:=son[p,y];
    end;
    if (v[p]>0) and not d[v[p]] then
    begin
      d[v[p]]:=true;
      exit(1)
    end
    else exit(0);
  end;

function ask:longint;
  var p,i,y,j:longint;
  begin
    p:=1;
    ask:=0;
    for i:=1 to l do
    begin
      for j:=1 to 26 do
        ask:=ask+find(son[p,j],i)+find(p,i+1)+find(son[p,j],i+1);
                // 在i前一位插入      删除      修改
      y:=ord(s[i])-96;
      p:=son[p,y];
      if p=0 then exit;
    end;
    for i:=1 to 26 do
      ask:=ask+find(son[p,i],l+1); //在最后一位插入
  end;

begin
  readln(n,m);
  t:=1;
  for i:=1 to n do
  begin
    readln(s);
    add(i);
  end;
  for i:=1 to m do
  begin
    fillchar(d,sizeof(d),false);
    readln(s);
    l:=length(s);
    if find(1,1)>0 then writeln(-1)
    else writeln(ask);
  end;
end.