• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号
登陆 注册

CodeforcesRound#454C.Shockers【模拟/hash】

原作者: [db:作者] 来自: [db:来源] 收藏 邀请
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 ≤ 105) — 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 105.

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
5
! abc
. ad
. b
! cd
? c
output
1
input
8
! hello
! codeforces
? c
. o
? d
? h
. l
? e
output
2
input
7
! ababahalamaha
? a
? b
? a
? b
? a
? h
output
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 isc, 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.

【题意】：

给出一个n
然后刑警给出n个询问，格式为犯人的发言操作+发言字符串
!  操作：发言包含敏感字符，受到电击
.  操作：发言不包含敏感字符，没受电击
? 操作：发言猜测敏感字符是什么，电击与否看情况？

多余的电击是犯人在敏感词可以唯一确定之后得到的电击。

1.每次他发表一个包含所选字母的单词时，他都会受到电击+1  (!)
2.他可以猜哪个字母是敏感词，但对于每个不正确的猜测他也会受到电击+1 (? && 猜错)
最后确定多余电击次数。

【Code】：

#include<bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
int n;

char op[10];
char s[N];
bool safe[N],temp[N];//a为安全词集合，b为待定敏感词集合
int main()
{
    int ans = 0;
    bool konw = false; //判断敏感词确定否
    scanf("%d",&n);
    while(n--){
        scanf("%s%s",op,s);

        if(op[0] == '.'){   //不包含敏感词，排除
            for(int i=0;s[i];i++)
                safe[s[i]]= true; //不包含敏感词，那么这段话每个字符都是是安全词
        }

        if(op[0] == '!'){  //待定敏感词，要看是否在确定后知道，是则电击
            memset(temp,false,sizeof(temp)); //先置位为非敏感词，即安全词
            for(int i=0; s[i]; i++)
                temp[s[i]] = true; //！发言出现的字符都标记为敏感待定词
            for(int i='a'; i<='z'; i++)
                if( !temp[i] ) safe[i] = true; //非敏感词，在safe数组标记为安全词
            if(konw) ans++;//知道了后则多余被电次数++
        }

        if(op[0] == '?'){ //猜测，若在确定后猜为安全词则电击
            if(konw && safe[s[0]]) ans++;
            else safe[s[0]] = true; //否则为安全词
        }
        int cnt = 0;
        for(int i='a'; i<='z'; i++)
            if(!safe[i])
                cnt++;       //最后确定的敏感词
        if(cnt == 1) konw = true;
    }
    printf("%d\n", ans);
}
模拟

 

鲜花
握手
雷人
路过
鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
More+
上一篇：
C——没有bool的C语言？发布时间：2022-07-18
下一篇：
Javascript长整型转C#DateTime发布时间：2022-07-18
热门推荐
More+
热门话题
More+
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服（服务时间 9:00～18:00）

在线QQ客服
地址：深圳市南山区西丽大学城创智工业园
电邮：jeky_zhao#qq.com
移动电话：139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap