Codeforces Round #454 C. Shockers

题目链接:http://codeforces.com/contest/907/problem/C

C. Shockers

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Valentin participates in a show called "Shockers". The rules are quite easy: jury selects one letter which Valentin doesn't know. He should make a small speech, but every time he pronounces a word that contains the selected letter, he receives an electric shock. He can make guesses which letter is selected, but for each incorrect guess he receives an electric shock too. The show ends when Valentin guesses the selected letter correctly.

Valentin can't keep in mind everything, so he could guess the selected letter much later than it can be uniquely determined and get excessive electric shocks. Excessive electric shocks are those which Valentin got after the moment the selected letter can be uniquely determined. You should find out the number of excessive electric shocks.

Input

The first line contains a single integer n (1 ≤ n ≤ 10⁵) — the number of actions Valentin did.

The next n lines contain descriptions of his actions, each line contains description of one action. Each action can be of one of three types:

1. Valentin pronounced some word and didn't get an electric shock. This action is described by the string ". w" (without quotes), in which "." is a dot (ASCII-code 46), and w is the word that Valentin said.
2. Valentin pronounced some word and got an electric shock. This action is described by the string "! w" (without quotes), in which "!" is an exclamation mark (ASCII-code 33), and w is the word that Valentin said.
3. Valentin made a guess about the selected letter. This action is described by the string "? s" (without quotes), in which "?" is a question mark (ASCII-code 63), and s is the guess — a lowercase English letter.

All words consist only of lowercase English letters. The total length of all words does not exceed 10⁵.

It is guaranteed that last action is a guess about the selected letter. Also, it is guaranteed that Valentin didn't make correct guesses about the selected letter before the last action. Moreover, it's guaranteed that if Valentin got an electric shock after pronouncing some word, then it contains the selected letter; and also if Valentin didn't get an electric shock after pronouncing some word, then it does not contain the selected letter.

Output

Output a single integer — the number of electric shocks that Valentin could have avoided if he had told the selected letter just after it became uniquely determined.

Examples

Input

Copy

5
! abc
. ad
. b
! cd
? c

Output

Copy

1

Input

Copy

8
! hello
! codeforces
? c
. o
? d
? h
. l
? e

Output

Copy

2

Input

Copy

7
! ababahalamaha
? a
? b
? a
? b
? a
? h

Output

Copy

0

Note

In the first test case after the first action it becomes clear that the selected letter is one of the following: a, b, c. After the second action we can note that the selected letter is not a. Valentin tells word "b" and doesn't get a shock. After that it is clear that the selected letter is c, but Valentin pronounces the word cd and gets an excessive electric shock.

In the second test case after the first two electric shocks we understand that the selected letter is e or o. Valentin tries some words consisting of these letters and after the second word it's clear that the selected letter is e, but Valentin makes 3 more actions before he makes a correct hypothesis.

In the third example the selected letter can be uniquely determined only when Valentin guesses it, so he didn't get excessive electric shocks.

题目大意:

一个猜敏感字母的游戏，！表示读出的单词包含敏感字母所以会被电击一下，？表示猜测字母如果正确就不会被电击，否则会被电击, . 表示读出的单词不包含敏感字母。问你在执行过程中，在哪一步之后就可确定敏感字母，此时的被电击数与总的电击数的差值是多少。就是说可以最多避免几个额外的电击

思路：

一个水的模拟题，（然而谁让我手速慢呢）刚开始26个字母全标记成敏感字母，然后?和.之后就将对应的字母标记成不敏感。！则将没出现之后的单词中的字母标记成不敏感。每一轮之后检察是否有唯一的字母敏感，这样就找到了敏感字母。然后出去最后一步的？之外，所有的!和？操作都是没有必要的操作，输出没有必要的操作数

#include<string.h>
#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<map>
#include<vector>
#define ll long long
using namespace std;
bool sen1[26];
bool sen2[26];
char m[1000005];
int main()
{
    memset(sen1,true,sizeof(sen1));
    int t;
    cin>>t;
    int sign=0;
    int flag1=0;
    int ans=0;
    for(int i=1;i<=t;i++)
    {
        getchar();
        int c=getchar();
        scanf("%s",m);
        int num=strlen(m);
        if(c=='!')
        {
               // cout<<111111111<<endl;
                memset(sen2,false,sizeof(sen2));
                for(int i=0;i<num;i++)
                {
                     int nn=m[i]-'a';
                     sen2[nn]=true;
                }
                for(int i=0;i<26;i++)
                {
                    if(!sen2[i])
                    {
                        sen1[i]=false;
                    }
                }
            if(flag1)
            ++sign;
        }
        else
        if(c=='.')
        {
             for(int i=0;i<num;i++)
            {
                int nn=m[i]-'a';
                sen1[nn]=false;
            }
        }
        else
        if(c=='?')
        {
            if(i!=t)
            {
                for(int j=0;j<num;j++)
               {
                  int nn=m[j]-'a';
                  sen1[nn]=false;
                }
                 if(flag1)
                ++sign;
            }
        }
        int cntt=0;
        if(!flag1)
        {

            for(int i=0;i<26;i++)
           {
            if(sen1[i]==true)
            {
                cntt++;
            }
           }
            if(cntt==1)
           {
            flag1=1;
           }
        }
    }

     cout<<sign<<endl;
    return 0;
}