codeforces #271D Good Substrings（hash）

题目链接

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

题意：现在给出一个字符串，现在找出有多少不同的子串满足子串的存在的特殊字符小于k个（特殊字符就是第二个字符串里对应位置数字为0的字符）。

题解：首先要预处理特殊字符的个数，后面直接判断，要是后面每个子串都遍历，那样肯定会超时。然后直接算每个子串的hash值，因为数据比较小，O(n^2)的复杂度能够过，可以用set直接去重，也可以用unordered_map标记，速度很快。

unordered_map标记：

#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<cmath>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
const int maxn=2e3+10;
const int mod=1e9+7;
const int inf=1e8;
#define me(a,b) memset(a,b,sizeof(a))
#define lowbit(x) x&(-x)
#define mid l+(r-l)/2
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI 3.14159265358979323846
int dir[4][2]= {0,-1,-1,0,0,1,1,0};
int dx[]= {-2,-2,-1,-1,1,1,2,2};
int dy[]= {-1,1,-2,2,-2,2,-1,1};
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int seed=131,k;
char str[maxn],a[30];
int main()
{
    scanf("%s%s%d",str+1,a,&k);
    int len=strlen(str+1);
    int num[maxn];me(num,0);
    for(int i=1; i<=len; i++)///预处理特殊字符的个数。
    {
        num[i]=num[i-1];
        if(a[str[i]-'a']=='0')
            num[i]++;
    }
    unordered_map<ll,int>vis;
    int ans=0;
    for(int i=1; i<=len; i++)
    {
        ll temp=0;
        for(int j=i; j<=len; j++)
            if(num[j]-num[i-1]<=k)
            {
                temp=temp*seed+str[j];
                if(vis.find(temp)==vis.end())///要是子串的hash值没有被标记，说明这一个新的子串。
                    ans++,vis[temp]=1;
            }
    }
    printf("%d\n",ans);
    return 0;
}

 set直接去重：

#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<cmath>
#include<stack>
#include<string>
const int maxn=2e3+10;
const int mod=1e9+7;
const int inf=1e8;
#define me(a,b) memset(a,b,sizeof(a))
#define lowbit(x) x&(-x)
#define mid l+(r-l)/2
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI 3.14159265358979323846
int dir[4][2]= {0,-1,-1,0,0,1,1,0};
int dx[]= {-2,-2,-1,-1,1,1,2,2};
int dy[]= {-1,1,-2,2,-2,2,-1,1};
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll has[maxn],cnt[maxn];
int seed=131,k;
char str[maxn],a[30];
int main()
{
    scanf("%s%s%d",str+1,a,&k);
    int len=strlen(str+1);
    has[0]=0,cnt[0]=1;
    int num[maxn];
    me(num,0);
    for(int i=1; i<=len; i++)
    {
        num[i]=num[i-1];
        if(a[str[i]-'a']=='0')
            num[i]++;
    }
    set<ll>q;
    for(int i=1; i<=len; i++)
    {
        ll temp=0;
        for(int j=i; j<=len; j++)
            if(num[j]-num[i-1]<=k)
            {
                temp=temp*seed+str[j];
                q.insert(temp);
            }
    }
    printf("%d\n",q.size());
    return 0;
}