CodeForces - 271D：Good Substrings（字符串hash）

Discription
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.

Examples
Input

ababab
01000000000000000000000000
1

Output

5

Input

acbacbacaa
00000000000000000000000000
2

Output

8

Note
In the first example there are following good substrings: “a”, “ab”, “b”, “ba”, “bab”.

In the second example there are following good substrings: “a”, “aa”, “ac”, “b”, “ba”, “c”, “ca”, “cb”.

题意
给定一个字符串s
给定一个26位的二进制数，每一位对应相应的字母，1的位置表示当前位置代表的字母是好的，0代表是不好的。
输入一个k，表示容错率（即子串中不好的字符数不超过k个）
求满足条件的子串个数。

思路
将所有的子串hash一下，放到一个数组里去重，然后求解个数就可以了。
代码不是我的，是CodeForces上大佬的，超级简短。

AC代码

#include<bits/stdc++.h>
using namespace std;
long long a[3000000],k,c;
char s[1520],v[30];
int main()
{
    cin>>s>>v>>k;
    for(int i=0; s[i]; i++)
        for(long long j=i,kk=k,h=0; s[j]&&(v[s[j]-'a']>'0'||kk--); j++)
            ///s[j]表示小于字符串长度，v[s[j]-'a']>'0'当前字符是好的，kk--表示不好的字符小于等于k个
            a[c++]=h=(h*131)+s[j];///给每个字符穿赋予不同的hash值
    sort(a,a+c);///字符串排序
    cout<<unique(a,a+c)-a;///给字符串去重，-a的将迭代器转化为数值。
    return 0；
}