Codeforces Round #425 B

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#define ll long long
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a) memset(a,0,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define lrt (root*2)
#define rrt (root*2+1)
#define len (r-l+1)
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

char s1[N],s2[N],s[N];
int n;
map<char,int> M;
int main(){
    cin>>s1+1>>s2+1;
    int l1=strlen(s1+1), l2=strlen(s2+1);
    for(int i=1; i<=l1; ++i){
        M[s1[i]]=1;
    }
    cin>>n;
    while(n--){
        cin>>s+1;
        int ls=strlen(s+1),i=1,j=0,flag=0; //cout<<ls<<endl;
        for(i=1; i<=l2; ++i){
            if(s2[i]==‘*‘){
                for(j=0; j<=ls-l2; ++j){ //cout<<s[j+i]<<"UUUU\n";
                    if(M[s[j+i]]){
                        flag=1;
                        break;
                    }
                }
                --j;
            }
            else{
                if((s2[i]==‘?‘ && !M[s[i+j]]) || (s2[i]!=‘?‘ && s2[i]!=s[i+j])){
                    flag=1;
                }
            }
            if(flag){
                cout<<"NO\n";
                break;
            }
        }
        if(!flag && (--i+j)!=ls) cout<<"NO\n";
        else if(!flag) cout<<"YES\n";
    }
    return 0;
}