1277C - As Simple as One and Two - CodeForces Solution


dp greedy *1400

Please click on ads to support us..

Python Code:

import math

ta = int(input())
while ta:
    ta -= 1

    a = input()
    coun = [0] * len(a)
    for i in range(len(a)-2):
        if a[i] == 'o' and a[i + 1] == 'n' and a[i + 2] == 'e':
            coun[i] += 1
            coun[i + 1] += 1
            coun[i + 2] += 1
        elif a[i] == 't' and a[i + 1] == 'w' and a[i + 2] == 'o':
            coun[i] += 2
            coun[i + 1] += 2
            coun[i + 2] += 2
    for i in range(2, len(a) - 2):
        if coun[i] == 3:
            coun[i - 1] = 0
            coun[i - 2] = 0
            coun[i + 1] = 0
            coun[i + 2] = 0
    ans = []
    for i in range(len(a)):
        if coun[i] == 3:
            ans.append(i+1)
        elif coun[i] == 2:
            ans.append(i + 2)
            coun[i] = 0
            coun[i+1]=0
            coun[i + 2] = 0
        elif coun[i] == 1:
            ans.append(i + 2)
            coun[i] = 0
            coun[i+1]=0
            coun[i + 2] = 0
    print(len(ans))
    print(*ans)


Comments

Submit
0 Comments
More Questions

233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians
110A - Nearly Lucky Number
1220B - Multiplication Table
1644A - Doors and Keys
1644B - Anti-Fibonacci Permutation
1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football