A Tide of Riverscape CodeForces - 989B （水题）

最新推荐文章于 2021-05-15 23:52:04 发布

Levi——

最新推荐文章于 2021-05-15 23:52:04 发布

阅读量745

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/qq_41874469/article/details/80662154

题目要求确定给定字符串中是否存在一个非周期性子串，字符串由'0', '1'和'.'组成，'.'可替换为'0'或'1'。通过检查每个可能的周期，如果找到不满足周期性的子串，则返回其替换后的字符串，否则返回"No"。" 5598024,234545,最大前驱路径挖掘算法详解,"['算法', '数据挖掘', '网络分析', '用户行为分析', '模式识别']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Walking along a riverside, Mino silently takes a note of something.

"Time," Mino thinks aloud.

"What?"

"Time and tide wait for no man," explains Mino. "My name, taken from the river, always reminds me of this."

"And what are you recording?"

"You see it, tide. Everything has its own period, and I think I've figured out this one," says Mino with confidence.

Doubtfully, Kanno peeks at Mino's records.

The records are expressed as a string $s$ of characters '0', '1' and '.', where '0' denotes a low tide, '1' denotes a high tide, and '.' denotes an unknown one (either high or low).

You are to help Mino determine whether it's possible that after replacing each '.' independently with '0' or '1', a given integer $p$ is not a period of the resulting string. In case the answer is yes, please also show such a replacement to Mino.

In this problem, a positive integer $p$ is considered a period of string $s$ , if for all