Hometask

Hometask

 codeforces 155C

Sergey attends lessons of the N-ish language. Each lesson he receives a hometask. This time the task is to translate some sentence to the N-ish language. Sentences of the N-ish language can be represented as strings consisting of lowercase Latin letters without spaces or punctuation marks.

Sergey totally forgot about the task until half an hour before the next lesson and hastily scribbled something down. But then he recollected that in the last lesson he learned the grammar of N-ish. The spelling rules state that N-ish contains some "forbidden" pairs of letters: such letters can never occur in a sentence next to each other. Also, the order of the letters doesn't matter (for example, if the pair of letters "ab" is forbidden, then any occurrences of substrings "ab" and "ba" are also forbidden). Also, each pair has different letters and each letter occurs in no more than one forbidden pair.

Now Sergey wants to correct his sentence so that it doesn't contain any "forbidden" pairs of letters that stand next to each other. However, he is running out of time, so he decided to simply cross out some letters from the sentence. What smallest number of letters will he have to cross out? When a letter is crossed out, it is "removed" so that the letters to its left and right (if they existed), become neighboring. For example, if we cross out the first letter from the string "aba", we get the string "ba", and if we cross out the second letter, we get "aa".

Input

The first line contains a non-empty string s, consisting of lowercase Latin letters — that's the initial sentence in N-ish, written by Sergey. The length of string sdoesn't exceed 10⁵.

The next line contains integer k (0 ≤ k ≤ 13) — the number of forbidden pairs of letters.

Next k lines contain descriptions of forbidden pairs of letters. Each line contains exactly two different lowercase Latin letters without separators that represent the forbidden pairs. It is guaranteed that each letter is included in no more than one pair.

Output

Print the single number — the smallest number of letters that need to be removed to get a string without any forbidden pairs of neighboring letters. Please note that the answer always exists as it is always possible to remove all letters.

Examples

Input

ababa
1
ab

Output

2

Input

codeforces
2
do
cs

Output

1

Note

In the first sample you should remove two letters b.

In the second sample you should remove the second or the third letter. The second restriction doesn't influence the solution.

题目大意：

给出一个字符串，然后给出K个约束 ，每个约束包含两个字母，表示这两个字母不能在字符串中相邻存在，现在我们需要删除一些字符，使得字符串是合法的。

输出最少删除的字符个数。

 题解1：dp[i]表示到位置i能保留下来的字符串的最长长度，在s[i]和s[j]不冲突的情况下，dp[i]=max(dp[i],dp[j]+1);但是这样下去会超时，又因为输入只包含字符，所以设tmp[s[i]]表示以s[i]结尾的dp最大值，则dp[i]=max(dp[i],tmp[s[i]]+1)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
int dp[maxn];
int vis[30][30];
int tmp[30];
char s[maxn];
char op[5];
int len;
int k;
int main()
{
    while(~scanf("%s",s+1))
    {
        len=strlen(s+1);
        scanf("%d",&k);
        memset(tmp,0,sizeof(tmp));
        memset(dp,0,sizeof(dp));
        memset(vis,0,sizeof(vis));
        while(k--)
        {
            scanf("%s",op);
            vis[op[0]-'a'][op[1]-'a']=1;
            vis[op[1]-'a'][op[0]-'a']=1;
        }
        dp[1]=1;
        tmp[s[1]-'a']=1;
        int ans=1; 
        for(int i=2;i<=len;i++)
        {
            for(int j=0;j<26;j++)
            {
                if(!vis[s[i]-'a'][j])
                {
                    dp[i]=max(dp[i],tmp[j]+1);
                }
            }
            tmp[s[i]-'a']=max(tmp[s[i]-'a'],dp[i]);
            ans=max(ans,dp[i]);
        }    
        //for(int i=1;i<=len;i++)
        //    printf("%d ",dp[i]);
        printf("%d
",len-ans );
    }
}

题解2：思维

既然k个两字符串中没有重复的串，那么你删除一些必要的字符后肯定不会造成新的不符合要求的串，所以只要统计下串中连续的不合法的字符的个数，取最小值就可以了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 100005
char ch[maxn];
char s[2];
int n,k;
int main()
{
    scanf("%s",ch);
    int len=strlen(ch);
    scanf("%d",&k);    
        int i,ans=0;
    while(k--)
    {
        getchar();
        scanf("%s",s);
        for(i=0;i<len;i++)
        {
            int l=0,r=0;
            while(ch[i]==s[0]||ch[i]==s[1])
            {
                if(ch[i]==s[0]) l++;
                if(ch[i]==s[1]) r++;
                i++;
            }
            ans+=min(l,r);
        }
    }
    printf("%d
",ans);
    return 0;
}