BNUOJ 34990 Justice String HASH

【题目链接】

http://www.bnuoj.com/v3/problem_show.php?pid=34990

【题目大意】

有两个串A,B，问是否存在A的一个子串S，S和B的长度相等，最多有2个字符不同。如果有多个，输出其实下标最小S的下标，没有输出-1。

【思路】

简单题。最多有两个不同，那么S和B的比较最多分为三部分。用后缀数组很简单就能解决。但是发现，TLE。。。这题后缀数组过不了的，要用hash去二分比较，得到最长前缀。

//#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<cmath>
#include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<ctime>
#include<map>
#include<set>
using namespace std;
#define MP(x,y) make_pair((x),(y))
#define PB(x) push_back(x)
typedef long long LL;
typedef unsigned long long ULL;
/* ****************** */
const int INF = 100011122;
const double INFF = 1e100;
const double eps = 1e-8;
const LL mod = 20140518;
const int NN = 100010;
const int MM = 5000010;
/* ****************** */

ULL ha[NN], hb[NN];
ULL p131[NN];
char s1[NN], s2[NN];

int fun(ULL *r,char *p,int len)
{
    int i;
    for(i = 0; i < len; i ++)
    {
        r[i] = p[i]*p131[i];
        if(i)
            r[i] += r[i-1];
    }
    return len;
}

int find(int st1,int st2,int lb)
{
    int l = 0;
    int r = lb - st2 + 1;
    int mid;
    ULL val1, val2;
    while(l + 1 < r)
    {
        mid = (l + r) >> 1;

        if(mid == 0)
        {
            l = mid;
            continue;
        }

        if(st1 != 0)
            val1 = ha[st1+mid-1] - ha[st1-1];
        else
            val1 = ha[st1+mid-1];
        if(st2 != 0)
            val2 = hb[st2+mid-1] - hb[st2-1];
        else
            val2 = hb[st2+mid-1];

        if(val1*p131[st2] == val2*p131[st1])
            l = mid;
        else
            r = mid;
    }
    return l;
}

bool ok(int st,int lb)
{
    int i, k = 2, len;
    int u1 = st;
    int u2 = 0;
    for(i = 0; i <= k; i ++)
    {
        len = find(u1, u2, lb);
        if(i < k)
        {
            u1 += len+1;
            u2 += len+1;
        }
        else
        {
            u1 += len;
            u2 += len;
        }
        if(u2 >= lb)
            return true;
    }
    return false;
}

int solve(int la,int lb)
{
    int i;
    for(i = 0; i + lb - 1 < la; i ++)
    {
        if(ok(i,lb))
            return i;
    }
    return -1;
}

int main()
{
    int cas, ee = 0;
    int i, la, lb, ans;

    p131[0] = 1;
    for(i = 1; i < NN; i ++)
    {
        p131[i] = p131[i-1]*131;
    }

    scanf("%d", &cas);
    while(cas--)
    {
        scanf("%s", s1);
        scanf("%s", s2);

        la = fun(ha, s1, strlen(s1));
        lb = fun(hb, s2, strlen(s2));

        ans = solve(la, lb);

        printf("Case #%d: %d\n", ++ee, ans);
    }
    return  0;
}