Codeforces Round #425 (Div. 2) B. Petya and Exam
来源:互联网 发布:baocms7.8完整源码 编辑:程序博客网 时间:2024/06/06 00:22
题目链接:Petya and Exam
题目大意:首先有两个字符串,一个字符串代表好字符串,这里面的每个字符都是好的(只包含小写字母),然后有一个原串,这个原串中可能包含有?和* 。?可以替换任意一个好字符,*可以替换空或者一个全由坏字符组成的串,接下来有t组数据,每组一个字符串,问这个字符串能不能通过上面的规则实现原串到模式串的替换
题目思路:直接模拟就好,如果没有* 直接暴力替换,有的话从前往后替换,从后往前替换,中间剩下的交给 号处理,判断是不是全为坏字符就好了,代码写麻烦了一点
#include <cstring>#include <cstdio>#include <cstdlib>#include <queue>#include <algorithm>#include <iostream>#include <cmath>using namespace std;typedef long long ll;int main(){ int t,a[35],ff = 0; string good,str,s; cin>>good>>str; memset(a,0,sizeof(a)); for(int i = 0;i < good.size();i++) a[good[i]-'a'] = 1; int l1 = str.size(); for(int i = 0;i < l1;i++) if(str[i] == '*') ff = 1; cin>>t; for(int Case = 0;Case < t;Case++){ int flag = 0; cin>>s; int l2 = s.size(); if(l1 > l2){ flag = 0; if(ff == 0) {puts("NO");continue;} if(l1-1 != l2) {puts("NO");continue;} string sss = ""; for(int i = 0;i < l1;i++) if(str[i] != '*') sss+=str[i]; string stt = sss; for(int i = 0;i < l1-1;i++){ if(stt[i] == '?'){ if(a[s[i]-'a'] == 1) continue; else {flag = 1;puts("NO");break;} } else{ if(stt[i] != s[i]) {flag = 1;puts("NO");break;} } } if(flag == 0) puts("YES"); } else if(l1 == l2){ flag = 0; for(int i = 0;i < l1;i++){ if(str[i] == '?'){ if(a[s[i]-'a'] != 1) {flag = 1;puts("NO");break;} } else if(str[i] == '*'){ if(a[s[i]-'a'] == 1) {flag = 1;puts("NO");break;} } else{ if(str[i] != s[i]) {flag = 1;puts("NO");break;} } } if(flag == 0) puts("YES"); } else{ flag = 0; int c[500005] = {0}; if(ff == 0) {flag = 1;puts("NO");continue;} for(int i = 0;str[i]!='*';i++){ if(str[i] == '?'){ if(a[s[i]-'a'] != 1) {flag = 1;puts("NO");break;} else c[i] = 1; } else{ if(str[i] != s[i]) {flag = 1;puts("NO");break;} else c[i] = 1; } } if(flag == 1) continue; for(int i = l1-1,j = l2-1;str[i] != '*';i--,j--){ if(str[i] == '?'){ if(a[s[j]-'a'] != 1) {flag = 1;puts("NO");break;} else c[j] = 1; } else{ if(str[i] != s[j]) {flag = 1;puts("NO");break;} else c[j] = 1; } } if(flag == 1) continue; for(int i = 0;i < l2;i++){ if(c[i] != 1&&a[s[i]-'a'] != 0) {flag = 1;puts("NO");break;} } if(flag == 0) puts("YES"); } } return 0;}
阅读全文
0 0
- Codeforces Round #425 (Div. 2)B. Petya and Exam
- Codeforces Round #425 (Div. 2) B. Petya and Exam
- Codeforces Round #425 (Div. 2) B. Petya and Exam
- Codeforces Round #425 (Div. 2) B. Petya and Exam
- Codeforces Round #425 (Div. 2) B. Petya and Exam
- Codeforces Round #425 (Div. 2) B. Petya and Exam【模拟】
- Petya and Exam(Codeforces Round #425 (Div. 2))
- Round #425 (Div. 2)B. Petya and Exam
- Codeforces Round #425 (Div. 2) B. Petya and Exam(字符串处理)
- (字符串匹配)Codeforces Round #425 B. Petya and Exam
- Codeforces Round #212 (Div. 2) B. Petya and Staircases
- Codeforces Round #212 (Div. 2) B. Petya and Staircases
- CodeForces 832B Round #425 Div2 B Petya and Exam:双指针暴力模拟
- CodeForces 832B Petya and Exam
- codeforces B. Petya and Exam (模拟)
- codeforces 832B (Petya and Exam)
- CodeForces 832 B. Petya and Exam
- CodeForces-832B Petya and Exam
- PAT 1015. Reversible Primes (20)
- Kubernetes总架构图
- 算法 c语言 冒泡排序改进
- win7下intellij IDEA中使用JDBC连接虚拟机中的phoenix
- 跳马问题
- Codeforces Round #425 (Div. 2) B. Petya and Exam
- 通过cmd命令安装、卸载、启动和停止Windows Service(InstallUtil.exe)
- jackson解析json
- Win10百度云8秒视频怎么破?防止百度云视频变成8秒视频的方法!
- 解决notepad++中英文混编的换行问题
- PHP的异常处理
- Springboot中使用缓存
- json范例2
- 选择排序