A9628 | No to Palindromes!
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Paul hates palindromes. He assumes that string $s$ is tolerable if each its character is one of the first $p$ letters of the English alphabet and $s$ doesn't contain any palindrome contiguous substring of length 2 or more.
Paul has found a tolerable string $s$ of length $n$ . Help him find the lexicographically next tolerable string of the same length or else state that such string does not exist.
Paul has found a tolerable string $s$ of length $n$ . Help him find the lexicographically next tolerable string of the same length or else state that such string does not exist.
输入格式
The first line contains two space-separated integers: $n$ and $p$ ( $1<=n<=1000$ ; $1<=p<=26$ ). The second line contains string $s$ , consisting of $n$ small English letters. It is guaranteed that the string is tolerable (according to the above definition).
输出格式
If the lexicographically next tolerable string of the same length exists, print it. Otherwise, print "NO" (without the quotes).
输入输出样例
输入 #1
3 3 cba
输出 #1
NO
输入 #2
3 4 cba
输出 #2
cbd
输入 #3
4 4 abcd
输出 #3
abda
String $s$ is lexicographically larger (or simply larger) than string $t$ with the same length, if there is number $i$ , such that $s_{1}=t_{1}$ , ..., $s_{i}=t_{i}$ , $s_{i+1}>t_{i+1}$ .
The lexicographically next tolerable string is the lexicographically minimum tolerable string which is larger than the given one.
A palindrome is a string that reads the same forward or reversed.
The lexicographically next tolerable string is the lexicographically minimum tolerable string which is larger than the given one.
A palindrome is a string that reads the same forward or reversed.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted