Codeforces Round #166 (Div. 2) D. Good Substrings 罕见的哈希冲突

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

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

这题真是长见识了，也可以说是出数据的人太神了。平常用的哈希方法都过，在这题竟然起冲突了，神奇。

我用了unsigned long long自动取模的哈希，可是就是过不了，尼玛。然后照着别人的题解哈希才过，改成多种子的哈希，并且还要模1000000007才过，不模都不过。这题真是无语了。出数据的人也太神了吧。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<cmath>
#include<bitset>
#define mem(a,b) memset(a,b,sizeof(a))
#define INF 1000000007
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int a[1510];
ll seed[3]={13131,10007,11137};
string s,ss;
int main()
{
    int i,j,k;
    cin>>s>>ss>>k;
    a[0]=(ss[s[0]-'a']=='0');
    for(i=1;i<s.size();i++)
        a[i]=a[i-1]+(ss[s[i]-'a']=='0');
    set<ll>se;
    for(i=0;i<s.size();i++)
    {
        ll hash=s[i]-'a'+1;
        for(j=i;j<s.size();j++)
        {
            if(j==i&&(ss[s[i]-'a']=='0')<=k)
                se.insert(s[j]-'a');
            else
            {
                if(a[j]-a[i]+(ss[s[i]-'a']=='0')>k)
                    break;
                hash+=(hash*seed[s[j]%3]+s[j]-'a')%INF;
                se.insert(hash);
            }
        }
    }
    cout<<se.size()<<endl;
    return 0;
}