HDU 4821 String 字符串hash

冲突最小的哈希方法之一 BKDRHash

马克下来作为模版

求任意一段的字符串的哈希值也很方便 用前缀和的思想处理 并不需要每次都求一次

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <string>
#include <stack>

#define _max(a,b) ((a)>(b)?(a):(b))
#define _min(a,b) ((a)>(b)?(b):(a))

const int maxi = 1 << 30;
const int mini = 1 << 31;
const int inf = 0x3f3f3f3f;
const int maxn = 2000000;

using namespace std;
char s[100010];
unsigned long long pow31[100010], val[100010];
map<unsigned long long, int> muii;
unsigned long long get(int x, int y) {
    if(!x) return val[y];
    return val[y] - val[x-1] * pow31[y-x+1];
}
int main() {
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif
    int m, l;
    pow31[0] = 1;
    for(int i = 1; i < 100010; i++) pow31[i] = pow31[i-1] * 31;
    while(~scanf("%d%d", &m, &l)) {
        scanf("%s", s);
        int len = strlen(s), ans = 0;
        val[0] = s[0] - 'a';
        for(int i = 1; i < len; i++) {
            val[i] = val[i-1] * 31 + s[i] - 'a';  //一般是素数 131什么的都可以
        }
        for(int i = 0; i < l; i++) {
            muii.clear();
            int last = i - 1;
            for(int j = i; j + l - 1 < len; j += l) {
                unsigned long long t = get(j, j + l - 1);
                if(muii.find(t) != muii.end()) last = max(last, muii[t]);
                muii[t] = j;
                if(j+l-last > m*l) ans++;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}

题目:

String

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1148    Accepted Submission(s): 330

Problem Description

Given a string S and two integers L and M, we consider a substring of S as “recoverable” if and only if
  (i) It is of length M*L;
  (ii) It can be constructed by concatenating M “diversified” substrings of S, where each of these substrings has length L; two strings are considered as “diversified” if they don’t have the same character for every position.

Two substrings of S are considered as “different” if they are cut from different part of S. For example, string "aa" has 3 different substrings "aa", "a" and "a".

Your task is to calculate the number of different “recoverable” substrings of S.

 

Input

The input contains multiple test cases, proceeding to the End of File.

The first line of each test case has two space-separated integers M and L.

The second ine of each test case has a string S, which consists of only lowercase letters.

The length of S is not larger than 10^5, and 1 ≤ M * L ≤ the length of S.

 

Output

For each test case, output the answer in a single line.

 

Sample Input

  
  

   
   3 3
abcabcbcaabc
  
  

 

Sample Output

  
  

   
   2