2013ICPC 长春I HDU 4821 String 字符串哈希

题意:给一字符串求长度为m*l的满足条件子串个数，条件要求:子串拆成连续的m个l长的子串互不相同

题意有坑，一开始以为是两个子串之间每个位置都要不一样，但是样例过不了，看了半天题才反应过来“two strings are considered as “diversified” if they don’t have the same character for every position.” 这句话的真正含义

题解: 先预处理每个起点为i的长为l的子串的哈希值，否则会T。处理起点为0,l,2*l,3*l....,(m-1)*l的子串做判断然后依次删掉头部加上后一个子串，然后处理起点1,l+1,2*l+1,....m*l+1然后模仿之前做法。这样就可以避免每次换起点消耗太多时间

#include <iostream>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <sstream>
#include <queue>
#include <map>
#include <functional>
#include <bitset>
#include <ctime>

using namespace std;
#define pb push_back
#define mk make_pair
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define mk make_pair
#define fi first
#define se second
#define ALL(A) A.begin(), A.end()
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repr(i, n) for(int (i)=(int)(n);(i)>=0;(i)--)
#define repab(i,a,b) for(int (i)=(int)(a);(i)<=(int)(b);(i)++)
#define reprab(i,a,b) for(int (i)=(int)(a);(i)>=(int)(b);(i)--)
#define sc(x) scanf("%d", &x)
#define pr(x) printf("x:%d\n", x)
#define fastio ios::sync_with_stdio(0), cin.tie(0)
#define frein freopen("in.txt", "r", stdin)
#define freout freopen("out.txt", "w", stdout)
#define freout1 freopen("out1.txt", "w", stdout)
#define lb puts("")
#define lson ((rt<<1)+1)
#define rson ((rt<<1)+2)
#define mid ((l+r)/2)
#define lmid (l+(r-l)/3)
#define rmid (r-(r-l)/3)
#define debug cout<<"???"<<endl

const double PI = 3.1415926535897932384626433;
const ll mod = 2147493647;
const int INF = 0x3f3f3f3f;
const double eps = 1e-12;
template<class T> T gcd(T a, T b){if(!b)return a;return gcd(b,a%b);}
const int maxn = 1e5+100;
const ull base = 19260817;

int m,l;
map<ull, int> mp;
char s[maxn];
ull hs[maxn];
ull Hash(char* s)
{
    ull res = 0;
    for(int i = 0; i < l; i++){
        res *= base;
        res += s[i];
    }
    return res;
}

int solve()
{
    int res = 0, len = strlen(s), cnt = 0;
    for(int i = 0; m*l+i < len && i < l; i++){
        mp.clear();
        cnt = 0;
        for(int j = 0; j < m; j++){
            ull tmp = hs[j*l+i];
            if(mp[tmp] == 1) cnt++;
            mp[tmp]++;
        }
        if(cnt == 0) res++;
        for(int j = m; j*l+l+i <= len; j++){
            ull tmpl = hs[(j-m)*l+i],
                tmpr = hs[j*l+i];
            if(mp[tmpl] == 2) cnt--;
            mp[tmpl]--;
            if(mp[tmpr] == 1) cnt++;
            mp[tmpr]++;
            if(cnt == 0) res++;
        }
    }
    return res;
}

int main()
{
    //frein;
    //freout;
	while(scanf("%d%d", &m, &l) != EOF){
        scanf("%s", s);
        ull base_l = 1;
        for(int i = 1; i < l; i++) base_l *= base;
        hs[0] = Hash(s);
        int len = strlen(s);
        for(int i = 1; i+l <= len; i++){
            //printf("-%d, +%d\n",i-1,i+l-1);
            hs[i] = hs[i-1] - s[i-1]*base_l;
            hs[i] *= base;
            hs[i] += s[i+l-1];
            //printf("hs[%d]:%llu\n",i,hs[i]);
        }
        for(int i = 0; i+l <= len; i++){
           // printf("hs[%d]:%llu\n",i,hs[i]);
        }
        printf("%d\n", solve());
	}
	return 0;
}