Codeforces Round #454 C - Shockers

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 20 + 7, maxd = 1e5 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

char vis[maxn] = {0};
char s[maxn] = {0};
char w[maxd];

int n, f = 0;
int cnt = 0, cnt1 = 0;
char c, ans;

int main() {
    
    scanf("%d", &n); getchar();
    int i;
    for(i = 0; i < n; ++i) {
        memset(s, 0, sizeof s);
        scanf("%c %s", &c, w); getchar();

        int len = strlen(w);
        for(int j = 0; j < len; ++j) {
            s[w[j]-'a'] = 1;
        }

        if(c == '!') {
            if(f == 0) {
                for(int j = 0; j < 26; ++j) {
                    if(vis[j] == 0) vis[j] = s[j];
                }
                f = 1;
            }
            else {
                for(int j = 0; j < 26; ++j) {
                    if(vis[j] > 0 && !s[j]) vis[j] = -1;
                }
            }
        }
        else if(c == '.') {
            for(int j = 0; j < len; ++j) {
                vis[w[j]-'a'] = -1;
            }
        }
        else if(c == '?') {
            vis[w[0]-'a'] = -1;
        }
        
        int tt = 0, ttt = 0;
        for(int j = 0; j < 26; ++j) {
            if(vis[j] > 0) { tt++; ans = (char)('a' + j); }
            if(vis[j] < 0) { ttt++; }
        }
        if(tt == 1) break;
        if(ttt == 25) {
            for(int j = 0; j < 26; ++j) {
                if(vis[j] >= 0) ans = (char)('a' + j);

            }
            break;
        }
    }
    ++i;
    for( ; i < n; ++i) {
        scanf("%c %s", &c, w); getchar();
        if(c == '!') cnt++;
        if(c == '?' && w[0] != ans) cnt++;
    }

    cout << (cnt - cnt1) << endl;


    return 0;
}