A13114 | As Simple as One and Two
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a non-empty string $s=s_1s_2\dots s_n$ , which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string "two" (or both at the same time) as a substring. In other words, Polycarp does not like the string $s$ if there is an integer $j$ ( $1 \le j \le n-2$ ), that $s_{j}s_{j+1}s_{j+2}=$ "one" or $s_{j}s_{j+1}s_{j+2}=$ "two".
For example:
- Polycarp does not like strings "oneee", "ontwow", "twone" and "oneonetwo" (they all have at least one substring "one" or "two"),
- Polycarp likes strings "oonnee", "twwwo" and "twnoe" (they have no substrings "one" and "two").
Polycarp wants to select a certain set of indices (positions) and remove all letters on these positions. All removals are made at the same time.
For example, if the string looks like $s=$ "onetwone", then if Polycarp selects two indices $3$ and $6$ , then "onetwone" will be selected and the result is "ontwne".
What is the minimum number of indices (positions) that Polycarp needs to select to make the string liked? What should these positions be?
For example:
- Polycarp does not like strings "oneee", "ontwow", "twone" and "oneonetwo" (they all have at least one substring "one" or "two"),
- Polycarp likes strings "oonnee", "twwwo" and "twnoe" (they have no substrings "one" and "two").
Polycarp wants to select a certain set of indices (positions) and remove all letters on these positions. All removals are made at the same time.
For example, if the string looks like $s=$ "onetwone", then if Polycarp selects two indices $3$ and $6$ , then "onetwone" will be selected and the result is "ontwne".
What is the minimum number of indices (positions) that Polycarp needs to select to make the string liked? What should these positions be?
输入格式
The first line of the input contains an integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases in the input. Next, the test cases are given.
Each test case consists of one non-empty string $s$ . Its length does not exceed $1.5\cdot10^5$ . The string $s$ consists only of lowercase Latin letters.
It is guaranteed that the sum of lengths of all lines for all input data in the test does not exceed $1.5\cdot10^6$ .
Each test case consists of one non-empty string $s$ . Its length does not exceed $1.5\cdot10^5$ . The string $s$ consists only of lowercase Latin letters.
It is guaranteed that the sum of lengths of all lines for all input data in the test does not exceed $1.5\cdot10^6$ .
输出格式
Print an answer for each test case in the input in order of their appearance.
The first line of each answer should contain $r$ ( $0 \le r \le |s|$ ) — the required minimum number of positions to be removed, where $|s|$ is the length of the given line. The second line of each answer should contain $r$ different integers — the indices themselves for removal in any order. Indices are numbered from left to right from $1$ to the length of the string. If $r=0$ , then the second line can be skipped (or you can print empty). If there are several answers, print any of them.
The first line of each answer should contain $r$ ( $0 \le r \le |s|$ ) — the required minimum number of positions to be removed, where $|s|$ is the length of the given line. The second line of each answer should contain $r$ different integers — the indices themselves for removal in any order. Indices are numbered from left to right from $1$ to the length of the string. If $r=0$ , then the second line can be skipped (or you can print empty). If there are several answers, print any of them.
输入输出样例
输入 #1
4 onetwone testme oneoneone twotwo
输出 #1
2 6 3 0 3 4 1 7 2 1 4
输入 #2
10 onetwonetwooneooonetwooo two one twooooo ttttwo ttwwoo ooone onnne oneeeee oneeeeeeetwooooo
输出 #2
6 18 11 12 1 6 21 1 1 1 3 1 2 1 6 0 1 4 0 1 1 2 1 11
In the first example, answers are:
- "onetwone",
- "testme" — Polycarp likes it, there is nothing to remove,
- "oneoneone",
- "twotwo".
In the second example, answers are:
- "onetwonetwooneooonetwooo",
- "two",
- "one",
- "twooooo",
- "ttttwo",
- "ttwwoo" — Polycarp likes it, there is nothing to remove,
- "ooone",
- "onnne" — Polycarp likes it, there is nothing to remove,
- "oneeeee",
- "oneeeeeeetwooooo".
- "onetwone",
- "testme" — Polycarp likes it, there is nothing to remove,
- "oneoneone",
- "twotwo".
In the second example, answers are:
- "onetwonetwooneooonetwooo",
- "two",
- "one",
- "twooooo",
- "ttttwo",
- "ttwwoo" — Polycarp likes it, there is nothing to remove,
- "ooone",
- "onnne" — Polycarp likes it, there is nothing to remove,
- "oneeeee",
- "oneeeeeeetwooooo".
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted