61.187.179.132:8080\/JudgeOnline\/showproblem
<\/a>\u989d\u3002\u8fd9\u9898\u76ee\u544a\u8bc9\u6211\u4e00\u4ef6\u4e8b\u60c5\u5c31\u662funsigned long long\u57fa\u672c\u662f\u4e0d\u4f1a\u51b2\u7a81\u7684\uff0c\u6240\u4ee5\u53ef\u4ee5\u653e\u5fc3\u7684\u7528Hash\u3002\u3002\u76f4\u63a5\u66b4\u529bHash\u4e86\uff0creplace\u7684\u6a21\u62df\u662f\u679a\u4e3e\u6bcf\u4e00\u4e2a\u4f4d\u7f6e\uff0c\u7136\u540e\u679a\u4e3e\u6539\u53d8\u6210\u4ec0\u4e48\uff0c\u76f8\u5e94\u7684\u5728\u539f\u4e32\u7684Hash\u503c+\u4e0a\u6539\u53d8\u91cf\u3002\u6548\u7387\u662f(26*Len)\uff0c
delete\u548cInsert\u9996\u5148\u8981\u7b97\u51fa\u4ece\u4e00\u4e2a\u4f4d\u7f6e\u5230\u6570\u5b57\u9996\u548c\u6570\u5b57\u5c3e\u7684Hash\u503c\uff0c\u7136\u540eDelete\u679a\u4e3e\u4f4d\u7f6e\u5220\u9664\u5c31\u53ef\u4ee5\u4e86\uff0cInsert\u8fd8\u8981\u679a\u4e3e\u63d2\u5165\u90a3\u4e2a\u6570\u3002
\u603b\u5171\u5c31\u662f(26*Len*m+Len*n)\u3002\u3002\u3002\u901f\u5ea6\u867d\u7136\u6162\uff0c\u8fd8\u662fA\u6389\u4e86(*^__^*)
\u56e7\u3002\u3002\u4e3a\u4ec0\u4e48\u522b\u4eba\u7684\u7a0b\u5e8f\u90fd\u662f20000KB+\u7684\u6211\u8fd9\u4e2a\u53ea\u6709500![](\"http:\/\/wjmzbmr.com\/wp-content\/uploads\/pic\/other_site\/img_baidu_j_0013.gif\")
\u800c\u4e14\u8fd8\u8fd9\u4e48\u6162\uff0c\u60b2\u5267\u3002\u3002<\/p>\n#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<set>
#define rep(i,n) for(int i=0;i<n;i++)
#define For(i,l,r) for(int i=l;i<=r;i++)
#define pb push_back
using namespace std;
const int inf=~0U>>1;
const int seed=131,maxl=20+10;
typedef unsigned long long ull;
struct Hash
{
static const int size=17771;
struct node
{
ull key;
int num;
node*next;
node(ull _key,int _num,node*_n):key(_key),num(_num),next(_n){}
}*H[size];
Hash(){memset(H,0,sizeof(H));}
int find(ull code)
{
int h=code%size;
for(node*i=H[h];i;i=i->next)if(i->key==code)return i->num;
return -1;
}
void insert(ull code,int num)
{
\/\/cout<<"I"<<code<<endl;
int h=code%size;
H[h]=new node(code,num,H[h]);
}
}hash;
ull Code(char*s)
{
ull ret=0;
while(*s) ret*=seed,ret+=*(s++);
return ret;
}
int n,m;
void solve()
{
static ull Power[maxl];
char s[maxl];
Power[0]=1;
For(i,1,maxl-1)Power[i]=Power[i-1]*seed;
scanf("%d %d",&n,&m);
rep(i,n) scanf("%sn",s),hash.insert(Code(s),i);
ull Left[maxl],Right[maxl];
while(m–)
{
scanf("%sn",s);ull t=Code(s),x,ret=0,l=strlen(s),tmp;
set<int> S;
if(hash.find(t)!=-1){printf("-1n");continue;}
\/\/Replace a letter
for(int i=0;i<l;i++)
{
for(char c=’a’;c<=’z’;c++)if(c!=s[i])
if((tmp=hash.find(t+Power[l-i-1]*(c-s[i])))!=-1)
S.insert(tmp);
}
\/\/Cal the Left Hash value and the Right Hash value
Left[0]=0;
for(int i=1;i<=l;i++)
Left[i]=Left[i-1]*seed+s[i-1];
Right[l+1]=0;
for(int i=l;i>=1;i–)
Right[i]=Right[i+1]+Power[l-i]*s[i-1];
\/\/Delete a letter
for(int i=1;i<=l;i++)
{
ull x=Left[i-1]*Power[l-i]+Right[i+1];
if((tmp=hash.find(x))!=-1)S.insert(tmp);\/\/cout<<"D"<<endl;
}
\/\/Insert a letter
for(int i=0;i<=l;i++)
{
ull x=Left[i]*Power[l-i+1]+Right[i+1];
for(char c=’a’;c<=’z’;c++)if((tmp=hash.find(x+Power[l-i]*c))!=-1)S.insert(tmp);\/\/cout<<"I"<<endl;
}
printf("%dn",S.size());
}
}
int main()
{
\/\/freopen("in","r",stdin);
solve();
}<\/p>\n","protected":false},"excerpt":{"rendered":"
[JSOI]Word Query\u7535\u5b50\u5b57\u5178 Time Limit:10000MS Memory Limit:65536KTotal Submit:27 Accepted:11 Case Time Limit:1000MS Description \u4eba\u4eec\u5728\u82f1\u6587\u5b57\u5178\u4e2d\u67e5\u627e\u67d0\u4e2a\u5355\u8bcd\u7684\u65f6\u5019\u53ef\u80fd\u4e0d\u77e5\u9053\u8be5\u5355\u8bcd\u7684\u5b8c\u6574\u62fc\u6cd5\uff0c\u800c\u53ea\u77e5\u9053\u8be5\u5355\u8bcd\u7684\u4e00\u4e2a\u9519\u8bef\u7684\u8fd1\u4f3c\u62fc\u6cd5\uff0c\u8fd9\u65f6\u4eba\u4eec\u53ef\u80fd\u9677\u5165\u56f0\u5883\uff0c\u4e3a\u4e86\u67e5\u627e\u4e00\u4e2a\u5355\u8bcd\u800c\u6d6a\u8d39\u5927 \u91cf\u7684\u65f6\u95f4\u3002\u5e26\u6709\u6a21\u7cca\u67e5\u8be2\u529f\u80fd\u7684\u7535\u5b50\u5b57\u5178\u80fd\u591f\u4ece\u4e00\u5b9a\u7a0b\u5ea6\u4e0a\u89e3\u51b3\u8fd9\u4e00\u95ee\u9898\uff1a\u7528\u6237\u53ea\u8981\u8f93\u5165\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u7535\u5b50\u5b57\u5178\u5c31\u8fd4\u56de\u4e0e\u8be5\u5355\u8bcd\u7f16\u8f91\u8ddd\u79bb\u6700\u5c0f\u7684\u51e0\u4e2a\u5355\u8bcd\u4f9b\u7528\u6237\u9009 \u62e9\u3002 \u5b57\u7b26\u4e32a\u4e0e\u5b57\u7b26\u4e32b\u7684\u7f16\u8f91\u8ddd\u79bb\u662f\u6307\uff1a\u5141\u8bb8\u5bf9a\u6216b\u4e32\u8fdb\u884c\u4e0b\u5217\u201c\u7f16\u8f91\u201d\u64cd\u4f5c\uff0c\u5c06a\u53d8\u4e3ab\u6216b\u53d8\u4e3aa\uff0c\u6700\u5c11\u201c\u7f16\u8f91\u201d\u6b21\u6570\u5373\u4e3a\u8ddd\u79bb\u3002 \u5220\u9664\u4e32\u4e2d\u67d0\u4e2a\u4f4d\u7f6e\u7684\u5b57\u6bcd\uff1b \u6dfb\u52a0\u4e00\u4e2a\u5b57\u6bcd\u5230\u4e32\u4e2d\u67d0\u4e2a\u4f4d\u7f6e\uff1b \u66ff\u6362\u4e32\u4e2d\u67d0\u4e00\u4f4d\u7f6e\u7684\u4e00\u4e2a\u5b57\u6bcd\u4e3a\u53e6\u4e00\u4e2a\u5b57\u6bcd\uff1b JSOI\u56e2\u961f\u6b63\u5728\u5f00\u53d1\u4e00\u6b3e\u7535\u5b50\u5b57\u5178\uff0c\u4f60\u9700\u8981\u5e2e\u52a9\u56e2\u961f\u5b9e\u73b0\u4e00\u4e2a\u7528\u4e8e\u6a21\u7cca\u67e5\u8be2\u529f\u80fd\u7684\u8ba1\u6570\u90e8\u4ef6\uff1a\u5bf9\u4e8e\u4e00\u4e2a\u5f85\u67e5\u8be2\u5b57\u7b26\u4e32\uff0c\u5982\u679c\u5b83\u662f\u5355\u8bcd\uff0c\u5219\u8fd4\u56de-1\uff1b\u5982\u679c \u5b83\u4e0d\u662f\u5355\u8bcd\uff0c\u5219\u8fd4\u56de\u5b57\u5178\u4e2d\u6709\u591a\u5c11\u4e2a\u5355\u8bcd\u4e0e\u5b83\u7684\u7f16\u8f91\u8ddd\u79bb\u4e3a1\u3002 Input \u7b2c\u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6b63\u6574\u6570N (N < = 10,000)\u548cM (M < = 10,000)\u3002 \u63a5\u4e0b\u6765\u7684N\u884c\uff0c\u6bcf\u884c\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u7b2ci + 1\u884c\u4e3a\u5355\u8bcdWi\u3002\u5355\u8bcd\u957f\u5ea6\u57281\u81f320\u4e4b\u95f4\u3002\u518d\u63a5\u4e0b\u6765M\u884c\uff0c\u6bcf\u884c\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u7b2ci + N + 1\u8868\u793a\u4e00\u4e2a\u5f85\u67e5\u5b57\u7b26\u4e32Qi\u3002\u5f85\u67e5\u5b57\u7b26\u4e32\u957f\u5ea6\u57281\u81f320\u4e4b\u95f4\u3002Wi\u548cQi\u5747\u7531\u5c0f\u5199\u5b57\u6bcd\u6784\u6210\uff0c\u6587\u4ef6\u4e2d\u4e0d\u5305\u542b\u591a\u4f59\u7a7a\u683c\u3002\u6240\u6709\u5355\u8bcd\u4e92\u4e0d\u76f8\u540c\uff0c\u4f46\u662f\u67e5\u8be2\u5b57\u7b26\u4e32\u53ef\u80fd\u6709 \u91cd\u590d\u3002 \u63d0\u793a\uff1a\u670950%\u7684\u6570\u636e\u8303\u56f4\uff1aN < = 1,000\uff0cM < = 1,000\u3002 Output \u8f93\u51fa\u5e94\u5305\u62ecM\u884c\uff0c\u7b2ci\u884c\u4e3a\u4e00\u4e2a\u6574\u6570Xi\u3002Xi = -1\u8868\u793aQi\u4e3a\u5b57\u5178\u4e2d\u7684\u5355\u8bcd\uff1b\u5426\u5219Xi\u8868\u793a\u4e0eQi\u7f16\u8f91\u8ddd\u79bb\u4e3a1\u7684\u5355\u8bcd\u7684\u4e2a\u6570\u3002 Sample Input […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/190"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=190"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/190\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=190"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=190"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=190"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}