607 div2 c

C. As Simple as One and Two
time limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given a non-empty string s=s1s2…sn, 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≤j≤n−2), that sjsj+1sj+2=“one” or sjsj+1sj+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?

Input
The first line of the input contains an integer t (1≤t≤104) — 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⋅105. 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⋅106.

Output
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≤r≤|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.

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) ((x)<<1)
#define r(x) ((x)<<1|1)
#define lowbit(x) ((x)&(-(x)))
#define abs(x) ((x)>=0?(x):(-(x)))
#define ms(a,b) memset(a,b,sizeof(a))

using namespace std;

const int maxn = 211111;

char one[] = "one";
char twone[] = "twone";
char twoone[] = "twoone";
int on,ton,ttn, t,now,slen;
char str[maxn];
int len, res[maxn];

void slove(){
	scanf("%s",str);
	slen = strlen(str);
	len = on = ton = ttn = 0;
	
	for (int i = 0; i < slen; i++) {
		if (str[i] == twoone[ttn]) {
			ttn++;
			if (ttn == 6) {
				res[len++] = i - 1;
				res[len++] = i - 2;
				ttn = on = 0;
			}
		}
		else {
			if (ton <= 1) {
				if (ttn > 2) {
					res[len++] = i - ttn + 2;
				}
			}
			if (str[i] == twoone[0])ttn = 1;
			else ttn = 0;
		}

		if (str[i] == twone[ton]) {
			ton++;
			if (ton == 5) {
				res[len++] = i - 1;
				ton = on = 0;
			}
		}
		else {
			if (ttn <= 1) {
				if (ton > 2)
					res[len++] = i - ton + 2;
			}
			if (str[i] == twone[0])ton = 1;
			else ton = 0;
		}

		if (str[i] == one[on]) {
			on++;
			if (on == 3) {
				res[len++] = i;
				on = 0;
			}
		}
		else 
			if (str[i] == one[0])on = 1;
			else on = 0;
	}
	if (ttn > 2) res[len++] = slen - ttn + 2;
	else if (ton > 2) res[len++] = slen - ton + 2;
	
	printf("%d\n", len);
	for (int i = 0; i < len; i++) printf("%d ", res[i]);
	
	printf("\n");
}

int main() {
	ios::sync_with_stdio(false);

	scanf("%d", &t);
	while (t--) 
		slove();

	return 0;
}