cfRound425B. Petya and Exam

B. Petya and Exam
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

It's hard times now. Today Petya needs to score 100 points on Informatics exam. The tasks seem easy to Petya, but he thinks he lacks time to finish them all, so he asks you to help with one..

There is a glob pattern in the statements (a string consisting of lowercase English letters, characters "?" and "*"). It is known that character "*" occurs no more than once in the pattern.

Also, n query strings are given, it is required to determine for each of them if the pattern matches it or not.

Everything seemed easy to Petya, but then he discovered that the special pattern characters differ from their usual meaning.

A pattern matches a string if it is possible to replace each character "?" with onegood lowercase English letter, and the character "*" (if there is one) with any, including empty, string ofbad lowercase English letters, so that the resulting string is the same as the given string.

The good letters are given to Petya. All the others are bad.

Input

The first line contains a string with length from 1 to26 consisting of distinct lowercase English letters. These letters are good letters, all the others are bad.

The second line contains the pattern — a string s of lowercase English letters, characters "?" and "*" (1 ≤ |s| ≤ 105). It is guaranteed that character "*" occurs ins no more than once.

The third line contains integer n (1 ≤ n ≤ 105) — the number of query strings.

n lines follow, each of them contains single non-empty string consisting of lowercase English letters — a query string.

It is guaranteed that the total length of all query strings is not greater than105.

Output

Print n lines: in the i-th of them print "YES" if the pattern matches thei-th query string, and "NO" otherwise.

You can choose the case (lower or upper) for each letter arbitrary.

Examples
Input
ab
a?a
2
aaa
aab
Output
YES
NO
Input
abc
a?a?a*
4
abacaba
abaca
apapa
aaaaax
Output
NO
YES
NO
YES
Note

In the first example we can replace "?" with good letters "a" and "b", so we can see that the answer for the first query is "YES", and the answer for the second query is "NO", because we can't match the third letter.

Explanation of the second example.

  • The first query: "NO", because character "*" can be replaced with a string of bad letters only, but the only way to match the query string is to replace it with the string "ba", in which both letters are good.
  • The second query: "YES", because characters "?" can be replaced with corresponding good letters, and character "*" can be replaced with empty string, and the strings will coincide.
  • The third query: "NO", because characters "?" can't be replaced with bad letters.
  • The fourth query: "YES", because characters "?" can be replaced with good letters "a", and character "*" can be replaced with a string of bad letters "x".
#include<bits/stdc++.h>
#define  maxn 100010 
using namespace std;
char g[30],s[maxn],q[maxn];
int M,L,N,good[30];
int main(){
	scanf("%s",g);
	for(int i=0;g[i];i++)
	       good[g[i]-'a']=1;
	scanf("%s %d",s,&N);
	M=strlen(s);
	int star=-1;
	for(int i=0;i<M;i++)
	      if(s[i]=='*') star=i;
	for(int i=0;i<N;i++){
	
	      scanf("%s",q);
	      L=strlen(q);
	      if(star==-1){
	      	if(L!=M){
	      		printf("NO\n");
	      		continue;
			  }
			  bool ok=true;
			  for(int i=0;i<M;i++){
			  	if(s[i]=='?'){
			  		if(!good[q[i]-'a']) ok=false;
				  }
				  else{
				  	    if(s[i]!=q[i])  ok=false;
				  }
			  }
			  if(ok)  printf("YES\n");
			  else  printf("NO\n");
		}
		else{
			if(L<M-1){
				printf("NO\n");
				continue;
			}
			bool ok=true;
			for(int i=0;i<star;i++){
				if(s[i]=='?'){
					if(!good[q[i]-'a'])ok=false;}
					else{
						if(s[i]!=q[i]) ok=false;
					}
			}
			int j=L-1;
			for(int i=M-1;i>star;i--,j--){
				if(s[i]=='?'){
					if(!good[q[j]-'a'])  ok=false;
				}else{
					if(s[i]!=q[j])  ok=false;
				}
			}
			for(int i=star;i<=j;i++)
			     if(good[q[i]-'a'])  ok=false;
			     if(ok)printf("YES\n");
			     else  printf("NO\n");
		}
	}
	return 0;
}
		  
		  
		  
		  


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
解法:贪心算法 如果两个字符串不相等,那么它们必定至少有一位不一样。考虑对于这一位,我们应该对字符串 a 进行哪种操作,才能使得它更接近于字符串 b。 首先,我们可以通过交换字符串 a 中的两个数字,使得这一位变为我们想要的数字。如果我们把这一位变成了 b 中的数字,那么显然这一位就不需要再进行修改了。因此,我们只需要考虑把这一位变成 a 中的数字 4 或 7。 如果我们把这一位变成 a 中的数字,则需要执行一次操作;如果我们把这一位变成 a 中的数字,则需要执行一次操作。那么,我们应该采取哪种操作呢? 我们可以贪心地想,如果我们把这一位变成 a 中的数字,那么这一位和 b 中的数字就越相似,那么接下来的操作就越容易执行。因此,我们应该选择将这一位变成 a 中的数字,从而尽可能地增加和 b 相同的数字的数量。 实现时,我们可以从左到右扫描字符串 a 和 b,统计它们不同的位置的数量。对于每个不同的位置,我们都可以选择将这一位变成 4 或 7,然后更新 a 中数字 4 和 7 的数量。最终,我们就可以得到将字符串 a 转换为字符串 b 所需的最少操作数。 时间复杂度 字符串 a 和 b 的长度为 n,我们需要扫描一遍字符串并统计数字 4 和 7 的数量,因此时间复杂度为 O(n)。 空间复杂度 我们只需要存储数字 4 和 7 的数量,因此空间复杂度为 O(1)。 Python 代码
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值