zoukankan      html  css  js  c++  java
  • CodeForces 832B 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 one good lowercase English letter, and the character "*" (if there is one) with any, including empty, string of bad 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 to 26 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 in s 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 than 105.

    Output

    Print n lines: in the i-th of them print "YES" if the pattern matches the i-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
    
    
    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <math.h>
    #include <stdio.h>
    #include <string>
    
    using namespace std;
    typedef long long int LL;
    const int maxn=1e5;
    char a[maxn+5];
    char b[maxn+5];
    int c[30];
    char s[30];
    int n;
    int main()
    {
        memset(c,0,sizeof(c));
        scanf("%s",s);
        for(int i=0;s[i];i++)
        {
            c[s[i]-'a']=1;
        }
        scanf("%s",a);
        scanf("%d
    ",&n);
        int len=strlen(a);
        for(int i=0;i<n;i++)
        {
            scanf("%s",b);
            int len2=strlen(b);
            int res=len2-len;
            if(res<-1)
            {
                printf("NO
    ");
                continue;
            }
            int j=0,k=0;
            bool ans=true;
            while(j<len||k<len2)
            {
                if(a[j]!='?'&&a[j]!='*')
                {
                    if(a[j]!=b[k])
                    {
                        ans=false;
                        break;
                    }
                    else
                    {
                        j++,k++;
                        continue;
                    }
                }
                else if(a[j]=='?')
                {
                    if(c[b[k]-'a']==1)
                    {
                        j++,k++;
                        continue;
                    }
                    else
                    {
                        ans=false;
                        break;
                    }
                }
                else
                {
                    if(res==-1)
                    {
                        j++;
                        continue;
                    }
                    else
                    {
                        for(int p=k;p<=k+res;p++)
                        {
                            if(c[b[p]-'a']==1)
                            {
                                ans=false;
                            }
    
                        }
                        if(ans==false) break;
                        else
                        {
                            j++;
                            k+=(res+1);
                            continue;
                        }
                    }
                }
    
            }
            if(ans==true)
                printf("YES
    ");
            else
                printf("NO
    ");
    
        }
    
        return 0;
    
    
    
    }


    
    
  • 相关阅读:
    通信错误:(-1)[描述:无法解析路由器DDNS地址,请检查DDNS状态.] 解析办法
    小数量宽带用户的福音,Panabit 云计费easyradius 接口隆重发布,PA宽带计费系统
    送给那些经常问我如何设置360测速结果为电信的朋友,360测速模块原理简单分析
    Universal-Image-Loader(UIL)使用方法&流程图&源码分析 ----- 未完
    Android开发框架
    Android线程池的使用(未完)
    Android LruCache究竟是什么
    Java finally语句到底是在return之前还是之后执行?
    Android自定义图片加载框架
    Android 自定义View实现单击和双击事件
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228522.html
Copyright © 2011-2022 走看看