H - Mr. Panda and Birthday Song Gym - 101775H (动态规划)
Mrs. Panda’s birthday is coming. Mr. Panda wants to compose a song as gift for her birthday.
It is known that Mrs. Panda does not like a song if and only if its lyrics contain Xvowels in a row, or Y consonants in a row (Otherwise, Mrs. Panda likes the song). The letters 'a', 'e', 'i', 'o', 'u' are vowels, and all others are consonants.
Though Mr. Panda is a gifted singer, he is bad at composing lyrics. Mr. Panda wants the song to be special. Thus, he searched Google for a template for lyrics of the song.
The template consists of lowercase English letters and possibly question marks. For example, "happybirthday" (without quotes, the same below), "????ybirthday" are valid templates but neither "happy birthday" nor "HappyBirthday" is. Mr. Panda needs to substitute all the question marks with lowercase English letters so that it becomes actual lyrics of the song.
Mr. Panda wants to give a surprise to Mrs. Panda. So, Mr. Panda hopes to compose not only a song from the template that Mrs. Panda likes but also a song from the same template that Mrs. Panda dislikes.
Because Mr. Panda is really bad at composing lyrics, even with a template, the task has confused him for days. Luckily, Mr. Panda knows you are in the contest and wants to ask you for help.
For a given template, output either "DISLIKE" (without quotes, the same below) if Mrs. Panda dislikes all the songs that are generated from the template (that means you cannot substitute letters for question marks so that Mrs. Panda likes the song), "LIKE" if Mrs. Panda likes all the songs that are generated from the template, or "SURPRISE" if Mr. Panda can compose a song Mrs. Panda likes and another song Mrs. Panda dislikes.
Input
The first line of the input gives the number of test cases, an integer T. T test cases follow.
Each test case consists of a line containing a string S, the template that Mr. Panda gets, an integer X, the minimum number of continuous vowels that Mrs. Panda dislikes, and an integer Y, the minimum number of continuous consonants that Mrs. Panda dislikes. In the template S, each character can be either one of lowercase English letters ('a’ to 'z’) or question mark ('?’).
- 1 ≤ T ≤ 300.
- 2 ≤ |S| ≤ 106.
- 1 ≤ X ≤ |S|.
- 1 ≤ Y ≤ |S|.
- Sum of |S| over all test cases ≤ 5 × 107.
Output
For each test case, output one line containing "Case #x: y", where x is the test case number (starting from 1) and y can be either "LIKE", "DISLIKE" or "SURPRISE" as mentioned in the problem description.
Example
5
happybirthda? 3 4
happybirth?ay 3 5
happybirthd?y 3 5
hellow?rld 3 5
helllllowooorld 3 5
Case #1: DISLIKE
Case #2: LIKE
Case #3: SURPRISE
Case #4: SURPRISE
Case #5: DISLIKE 精选博客题解:https://blog.csdn.net/Link_Ray/article/details/89740922
题意
连续出现元音长度 >= x || 连续出现辅音长度 >= y ,输出DISLIKE。
连续出现元音长度 < x && 连续出现辅音长度 <y,输出LIKE。
即满足1又满足2,输出SURPRISE。
题解
对于1,直接贪心求最大的连续元音/辅音次数,即遇到?时,元/辅音都+1。
对于2,采用dp。
0: 元音,1:辅音
设dp[i][0/1] dp[i][0/1]dp[i][0/1]:到第i位时连续的元/辅音最小长度。
状态转移:
ch == 元音
dp[i][0]=dp[i−1][0]+1,dp[i][1]=0 dp[i][0] = dp[i-1][0]+1,dp[i][1] = 0
dp[i][0]=dp[i−1][0]+1,dp[i][1]=0
ch == 辅音
dp[i][1]=dp[i−1][1]+1,dp[i][0]=0 dp[i][1] = dp[i-1][1]+1,dp[i][0] = 0
dp[i][1]=dp[i−1][1]+1,dp[i][0]=0
ch == ?
如果dp[i-1][0]+1 < x,那么便可以把?变成元音
如果dp[i-1][1]+1 < y,那么便可以把?变成辅音
则:
如果当前位既可填元音又可填辅音:dp[i][0] = dp[i][1] = 0.
如果当前位只可填元音:dp[i][0] = dp[i-1][0] + 1, dp[i][1] = 0;
如果当前为只可填辅音:dp[i][1] = dp[i-1][1] + 1, dp[i][0] = 0;
如果都不可以填,则必然不能出现like的情况,break.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=;
const int maxn = ;
char s[maxn];
int dp[maxn][],x,y;
int ok(char c)
{
if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')return ;
return ;
}
int main()
{
ios::sync_with_stdio();
int T,k = ;
cin >> T;
while(T--){
cin >> (s+);
cin >> x >> y;
int n = strlen(s+);
int dislike=,like=;
memset(dp,,sizeof(dp));
for(int i = ;i <= n;i++){//贪心求出是否有dislike的情况,这时dp[i][0/1]代表到目前为止元(辅)音的最大长度
if(s[i] == '?'){
dp[i][] = dp[i-][]+;
dp[i][] = dp[i-][]+;
}
else if(ok(s[i])){
dp[i][] = dp[i-][]+;
}
else{
dp[i][] = dp[i-][]+;
}
if(dp[i][] >= x || dp[i][] >= y){
dislike = ;
break;
}
}
memset(dp,,sizeof(dp));
for(int i = ;i <= n;i++){//dp求出是否可以满足like,这时dp[i][0/1]代表到目前为止填元(辅)音的最小长度
if(s[i] == '?'){
if(dp[i-][] + < x && dp[i-][] + < y){//元音辅音都可以填
dp[i][] = dp[i][] = ;
}
else if(dp[i-][] + < x){//只可填元音
dp[i][] = dp[i-][] + ;
dp[i][] = ;
}
else if(dp[i-][] + < y){//只可填辅音
dp[i][] = dp[i-][] + ;
dp[i][] = ;
}
else{//都不能填,跳出循环
like = ;
break;
}
}
else if(ok(s[i])){//元音
dp[i][] = dp[i-][] + ;
}
else{//辅音
dp[i][] = dp[i-][] + ;
}
if(dp[i][] >= x || dp[i][] >= y){//判断到目前为止,是否有不满足条件的
like = ;
break;
}
}
cout << "Case #"<<k++<<": ";
if(dislike && like)cout << "SURPRISE" << endl;
else if(dislike)cout << "DISLIKE" << endl;
else cout << "LIKE" << endl;
}
return ;
}
H - Mr. Panda and Birthday Song Gym - 101775H (动态规划)的更多相关文章
- 2018 China Collegiate Programming Contest Final (CCPC-Final 2018)-K - Mr. Panda and Kakin-中国剩余定理+同余定理
2018 China Collegiate Programming Contest Final (CCPC-Final 2018)-K - Mr. Panda and Kakin-中国剩余定理+同余定 ...
- hdu6007 Mr. Panda and Crystal 最短路+完全背包
/** 题目:hdu6007 Mr. Panda and Crystal 链接:http://acm.hdu.edu.cn/showproblem.php?pid=6007 题意:魔法师有m能量,有n ...
- Gym 101194C / UVALive 7899 - Mr. Panda and Strips - [set][2016 EC-Final Problem C]
题目链接: http://codeforces.com/gym/101194/attachments https://icpcarchive.ecs.baylor.edu/index.php?opti ...
- Codeforces Gym 101194C Mr. Panda and Strips(2016 EC-Final,区间DP预处理 + 枚举剪枝)
题目链接 2016 EC-Final 题意 现在要找到数列中连续两个子序列(没有公共部分).要求这两个子序列本身内部没有重复出现的数. 求这两个子序列的长度的和的最大值. 首先预处理一下.令$ ...
- Gym 101194F Mr. Panda and Fantastic Beasts
#include<bits/stdc++.h> using namespace std; #define ms(arr,a) memset(arr,a,sizeof arr) #defin ...
- Codeforces Gym 101775D Mr. Panda and Geometric Sequence(2017-2018 ACM-ICPC Asia East Continent League Final,D题,枚举剪枝)
题目链接 ECL-Final 2017 Problem D 题意 给定$2*10^{5}$组询问,每个询问求$l$到$r$之间有多少个符合条件的数 如果一个数小于等于$10^{15}$, 并且能被 ...
- [acm/icpc2016ChinaFinal][CodeforcesGym101194] Mr. Panda and Fantastic Beasts
地址:http://codeforces.com/gym/101194 题目:略 思路: 这题做法挺多的,可以sam也可以后缀数组,我用sam做的. 1.我自己yy的思路(瞎bb的) 把第一个串建立s ...
- Mr. Panda and Crystal(最短路+完全背包)
http://codeforces.com/gym/101206/attachments 题意: T组输入,每组给出m,n,k,m为能量总数,n为水晶种类数,k为合成方案数.有的水晶可以用能量制造,有 ...
- (CCPC-Final 2018)K - Mr. Panda and Kakin
题意:x是\([1e5,1e9]\)的随机数,p是小于x的最大素数,q是大于等于x的最小素数,\(n=pq\),\(c=f^{2^{30}+3}\mod{n}\),给n和c求f 题解:rsa解密,首先 ...
随机推荐
- cf 444C.
听说这是线段树的裸题??(看来我也就能搞个求和什么的了2333) #include<bits/stdc++.h> #define INF 0x7fffffff #define LL lon ...
- Python Learning Day6
selenium操作 点击.清除操作 from selenium import webdriver from selenium.webdriver.common.keys import Keys im ...
- TP多条件查询实例
where条件查询,时间范围查询 $condition = [ ['member_id', '=', $member_id] ]; if($type) { $condition[] = ['type' ...
- CodeForces - 446A DZY Loves Sequences(dp)
题意:给定一个序列a,求最长的连续子序列b的长度,在至多修改b内一个数字(可修改为任何数字)的条件下,使得b严格递增. 分析: 1.因为至多修改一个数字,假设修改a[i], 2.若能使a[i] < ...
- 使用AJAX(阿贾克斯)创建级联菜单
1. html页面 <!DOCTYPE html> <html> <head> <meta charset="UTF-8"> < ...
- pipeline简单规则
Declarative 1. pipeline{ agent options{ } stages{ stage(' '){ steps{ } } } post{ always{} changed{} ...
- UML-如何使用GRASP进行对象设计?
1.GRASP有以下模式 2.创建者 问题:谁创建某类的新实例? 方案:(我认为) 聚集:物理模型下,由父类创建子类.(父类聚集了子类的集合) 包含:子类包含父类对象 专家模式:提供初始化数据的类来创 ...
- 使用GitHub+Hexo搭建个人博客
title: CozyMo date: 2019-12-28 16:01:29 tags: 书写 前言:搭建博客要自己打代码吗? 开始动手:搭建博客的步骤 个性化:更换主题!! 写博客:初识 mark ...
- Docker MongoDB 集群搭建
简单地在Docker环境上搭建一个无认证的MongoDB集群.1.本文使用的容器集群角色 ContainerName IP:portConfig Server cfg_1 10.1.1.2:27 ...
- java日志处理汇总
org.apache.commons.lang3.time.DateUtils https://blog.csdn.net/yihaoawang/article/details/50638199