Codeforces798B Mike and strings

链接

　　http://codeforces.com/problemset/problem/798/B

题解

　　哈希搞一搞

代码

//哈希
#include <cstdio>
#include <algorithm>
#include <cstring>
#define maxn 123
#define mod 4894651ll
#define base 10007ll
#define ll long long
using namespace std;
int N, M;
ll hash[maxn][maxn];
char s[maxn][maxn];
int main()
{
    int i, j, k, ans=0x7fffffff, cnt;
    scanf("%d%d",&N,&M);
    for(i=1;i<=N;i++)scanf("%s",s[i]+1);
    M=strlen(s[1]+1);
    for(i=1;i<=N;i++)for(j=1;j<=M;j++)s[i][M+j]=s[i][j];
    for(i=1;i<=N;i++)for(j=1;j<=M;j++)
        for(k=0;k<M;k++)hash[i][j]=(hash[i][j]*base+s[i][j+k])%mod;
    for(i=1;i<=M;i++)
    {
        cnt=0;
        for(j=2;j<=N;j++)
        {
            for(k=1;k<=M;k++)if(hash[j][k]==hash[1][i]){cnt+=k-1;break;}
            if(k>M)break;
        }
        if(j>N)ans=min(ans,cnt+i-1);
    }
    if(ans==0x7fffffff)printf("-1");
    else printf("%d",ans);
    return 0;
}