【BubbleCup X】G:Bathroom terminal

一个hash的题

对？出现位置直接暴力枚举，然后hash判断下，扔进map里

cf的评测机跑的针tm块

#include<bits/stdc++.h>
const int N=;
const int bas=;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int n,m,cnt,len,ans;
char s[N],ss[N];
map<ull,int>mps[N];
map<pair<int,ull>,int>mps2;
int hs[N],a[N];
inline int read(){
    int f=,x=;char ch;
    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');
    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');
    return f*x;
}
inline void check(){
    for(int i=;i<=cnt;i++)if(a[i]==-)s[hs[i]]='?';else s[hs[i]]='a'+a[i];
    ull h=;int tmp=;
    for(int i=;i<=len;i++)if(s[i]!='?')++tmp,h=h*bas+s[i]-'a';
    if(!mps2.count(make_pair(tmp,h))){ans+=mps[tmp][h];mps2[make_pair(tmp,h)]=;}
}
inline void dfs(int now){
    if(now==cnt+){check();return;}
    for(int i=-;i<=;i++)a[now]=i,dfs(now+);
}
int main(){
    n=read();m=read();
    for(int i=;i<=n;i++){
        scanf("%s",s+);len=strlen(s+);
        ull h=;for(int j=;j<=len;j++)h=h*bas+s[j]-'a';
        mps[len][h]++;
    }
    while(m--){
        scanf("%s",s+);len=strlen(s+);cnt=;
        for(int j=;j<=len;j++)if(s[j]=='?')hs[++cnt]=j;ans=;
        mps2.clear();dfs();
        printf("%d\n",ans);
    }
}