A12611 | Good Triple
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Toad Rash has a binary string $s$ . A binary string consists only of zeros and ones.
Let $n$ be the length of $s$ .
Rash needs to find the number of such pairs of integers $l$ , $r$ that $1 \leq l \leq r \leq n$ and there is at least one pair of integers $x$ , $k$ such that $1 \leq x, k \leq n$ , $l \leq x < x + 2k \leq r$ , and $s_x = s_{x+k} = s_{x+2k}$ .
Find this number of pairs for Rash.
Let $n$ be the length of $s$ .
Rash needs to find the number of such pairs of integers $l$ , $r$ that $1 \leq l \leq r \leq n$ and there is at least one pair of integers $x$ , $k$ such that $1 \leq x, k \leq n$ , $l \leq x < x + 2k \leq r$ , and $s_x = s_{x+k} = s_{x+2k}$ .
Find this number of pairs for Rash.
输入格式
The first line contains the string $s$ ( $1 \leq |s| \leq 300\,000$ ), consisting of zeros and ones.
输出格式
Output one integer: the number of such pairs of integers $l$ , $r$ that $1 \leq l \leq r \leq n$ and there is at least one pair of integers $x$ , $k$ such that $1 \leq x, k \leq n$ , $l \leq x < x + 2k \leq r$ , and $s_x = s_{x+k} = s_{x+2k}$ .
输入输出样例
输入 #1
010101
输出 #1
3
输入 #2
11001100
输出 #2
0
In the first example, there are three $l$ , $r$ pairs we need to count: $1$ , $6$ ; $2$ , $6$ ; and $1$ , $5$ .
In the second example, there are no values $x$ , $k$ for the initial string, so the answer is $0$ .
In the second example, there are no values $x$ , $k$ for the initial string, so the answer is $0$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted