codeforces 166 Count Good Substrings 字符串hash

D. Good Substrings

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

You've got string s, consisting of small English letters. Some of the English letters are good, the rest are bad.

A substring s[l...r] (1 ≤ l ≤ r ≤ |s|) of string s  =  s1s2...s|s| (where |s| is the length of string s) is string  slsl + 1...sr.

The substring s[l...r] is good, if among the letters  sl, sl + 1, ..., sr there are at most k bad ones (look at the sample's explanation to understand it more clear).

Your task is to find the number of distinct good substrings of the given string s. Two substrings s[x...y] and s[p...q] are considered distinct if their content is different, i.e. s[x...y] ≠ s[p...q].

Input

The first line of the input is the non-empty string s, consisting of small English letters, the string's length is at most 1500 characters.

The second line of the input is the string of characters "0" and "1", the length is exactly 26 characters. If the i-th character of this string equals "1", then the i-th English letter is good, otherwise it's bad. That is, the first character of this string corresponds to letter "a", the second one corresponds to letter "b" and so on.

The third line of the input consists a single integer k (0 ≤ k ≤ |s|) — the maximum acceptable number of bad characters in a good substring.

Output

Print a single integer — the number of distinct good substrings of string s.

Sample test(s)

input

ababab
01000000000000000000000000
1

output

5

input

acbacbacaa
00000000000000000000000000
2

output

8

别人的代码，这个hash方法为BKDRHash

#include <iostream>
#include <cstdio>
#include <set>
#include <cstring>

using namespace std;

char str[1505], flag[27];  //flag用于记录字母是否good one
int Dad_Count[1505], k;
const long long seed[3] = {13131, 10007, 11137};  //用于生成哈希值,设置三个值降低冲突率
const int MOD = 1000000007;

int main()
{
    while(scanf("%s %s %d", str, flag, &k) != EOF)
    {
        int len = strlen(str);
        Dad_Count[0] = (flag[str[0]-'a'] == '0');
        for(int i = 1; i < len; i++)  //统计[str_0, str_i]中坏字母的个数
            Dad_Count[i] = Dad_Count[i-1] + ('0' == flag[str[i]-'a']);
        set<long long> Substr;
        for(int i = 0; i < len; i++)
        {
            long long HashVal = str[i] - 'a' + 1;
            for(int j = i; j < len; j++)
            {
                if(j == i)
                {
                    if(('0' == flag[str[i]-'a']) <= k)
                    {
                        int key = (str[i] - 'a');
                        Substr.insert(key);
                    }
                }
                else
                {
                    //注意判断边界：flag[str[i]-'a'] == '0'
                    int cnt = Dad_Count[j] - Dad_Count[i] + (flag[str[i]-'a'] == '0');
                    if(cnt > k) break;
                    HashVal += ((HashVal * seed[str[j]%3] + (str[j] - 'a')) % MOD);  //%MOD是防止溢出
                    Substr.insert(HashVal);
                }
            }
        }
        printf("%d\n", Substr.size());
    }
    return 0;
}

改进后采用FNVHash

#include <iostream>
#include <cstdio>
#include <set>
#include <cstring>

using namespace std;

char str[1505], flag[27];  //flag用于记录字母是否good one
int Dad_Count[1505], k;
int main()
{
    // freopen("C:\\Users\\Sky\\Desktop\\1.in","r",stdin);
    while(scanf("%s %s %d", str, flag, &k) != EOF)
    {
        int len = strlen(str);
        Dad_Count[0] = (flag[str[0]-'a'] == '0');
        for(int i = 1; i < len; i++)  //统计[str_0, str_i]中坏字母的个数
            Dad_Count[i] = Dad_Count[i-1] + ('0' == flag[str[i]-'a']);
        set<long long> Substr;
        for(int i = 0; i < len; i++)
        {
            long long HashVal =31;
            for(int j = i; j < len; j++)
            {       //注意判断边界：flag[str[i]-'a'] == '0'
                    int cnt = Dad_Count[j] - Dad_Count[i] + (flag[str[i]-'a'] == '0');
                    if(cnt > k) break;
                    HashVal*=31;
                    HashVal^=str[j];
                    Substr.insert(HashVal);
            }
        }
        printf("%d\n", Substr.size());
    }
    return 0;
}