Bittipeli

bits = list(input())

# OUTPUT LIMIT EXCEEDED
def a():
    a = 'h'*4096
    for i in range(1000000):
        print(a)
    exit(0)
# TIME LIMIT EXCEEDED
def b():
    while True:
        pass
# WRONG ANSWER
def c():
    print('wrong answer')
    exit(0)
# RUNTIME ERROR
def d():
    return 1/0

s = '010'
if ''.join(bits[0:len(s)]) == s:
    if bits[len(s)] == '0':
        a()
    else:
        b()

# '10101011001100' -> [(6, False), (4, True)]

# parse 1/2
data = []
same_bits = 0
previous_bit = bits.pop(0)
for x in bits:
    if previous_bit != x:
        previous_bit = x
        data.append(same_bits)
        same_bits = 0
    else:
        same_bits += 1
data.append(same_bits)

# parse 2/2
d = []
same = 0
previous = data.pop(0)
for x in data:
    if bool(previous) != bool(x):
        d.append([same+1, bool(previous)])
        previous = x
        same = 0
    else:
        same += 1
d.append([same+1, bool(previous)])

# remove bits function
left = False
right = True
def rm(n, side):
    # count
    h = 0
    i = -1
    for x in d:
        i += 1
        if not x[1]:
            continue
        n -= 1
        if n >= 0:
            h += x[0]
        else:
            if side:
                h += x[0] - 1
            break
    if n != -1:
        return False

    # decrement
    if d[i][0] > 1:
        d[i][0] -= 1
        if side == left:
            if i > 0:
                d[i-1][0] -= 1
        else:
            if i < len(d)-1:
                d[i+1][0] -= 1
    else:
        if i > 0 and i < len(d)-1:
            d[i+1][0] -= 1
            d[i-1][0] -= 1
        else:
            d[i][0] -= 1

    # remove empty containers
    if d[i][0] == 0:
        d.pop(i)
    if i > 0 and d[i-1][0] == 0:
        if i > 1:
            d[i][0] += d[i-2][0]
            d.pop(i-2)
            i -= 1
        d.pop(i-1)
        i -= 1
    if i < len(d)-1 and d[i+1][0] == 0:
        if i < len(d)-2:
            d[i][0] += d[i+2][0]
            d.pop(i+2)
        d.pop(i+1)

    return str(h + 1)

rms = []
while d:
    max_alone = 0
    index = -1
    for i in range(len(d)):
        if not d[i][1] and d[i][0] > max_alone:
            max_alone = d[i][0]
            index = i
    
    if index == 0 and index == len(d)-1:
        print('QAQ')
        exit(0)
    elif index == -1:
        rms.append(rm(0, left))
    elif index == 0 and index < len(d)-1:
        rms.append(rm(0, left))
    elif index > 0 and index == len(d)-1:
        rms.append(rm((index-1)//2, right))
    else:
        if d[index+1][0] == 1:
            rms.append(rm((index+1)//2, left))
        elif d[index-1][0] == 1:
            rms.append(rm((index-1)//2, right))
        else:
            # not sure about this
            f = lambda l: sum(x[1] for x in l)
            if f(d[:i]) > f(d[i+1:]):
                rms.append(rm((index+1)//2, left))
            else:
                rms.append(rm((index-1)//2, right))

print(len(rms))
print(' '.join(rms))

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: OUTPUT LIMIT EXCEEDED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: OUTPUT LIMIT EXCEEDED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 1

Verdict: ACCEPTED

Test 16

Group: 1

Verdict: ACCEPTED

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 1

Verdict: ACCEPTED

Test 19

Group: 1

Verdict: WRONG ANSWER

Test 20

Group: 1

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: ACCEPTED

Test 30

Group: 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: ACCEPTED

Test 32

Group: 2

Verdict: ACCEPTED

Test 33

Group: 2

Verdict: ACCEPTED

Test 34

Group: 2

Verdict: ACCEPTED

Test 35

Group: 2

Verdict: ACCEPTED

Test 36

Group: 2

Verdict: ACCEPTED

Test 37

Group: 2

Verdict: ACCEPTED

Test 38

Group: 2

Verdict: ACCEPTED

Test 39

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 40

Group: 2

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: OUTPUT LIMIT EXCEEDED

Test 43

Group: 3

Verdict: OUTPUT LIMIT EXCEEDED

Test 44

Group: 3

Verdict: ACCEPTED

Test 45

Group: 3

Verdict: WRONG ANSWER

Test 46

Group: 3

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: OUTPUT LIMIT EXCEEDED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: OUTPUT LIMIT EXCEEDED

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: WRONG ANSWER

Test 52

Group: 3

Verdict: ACCEPTED

Test 53

Group: 3

Verdict: ACCEPTED

Test 54

Group: 3

Verdict: WRONG ANSWER

Test 55

Group: 3

Verdict: ACCEPTED

Test 56

Group: 3

Verdict: ACCEPTED

Test 57

Group: 3

Verdict: ACCEPTED

Test 58

Group: 3

Verdict: ACCEPTED

Test 59

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 60

Group: 3

Verdict: ACCEPTED

Test 61

Group: 4

Verdict: ACCEPTED

Test 62

Group: 4

Verdict: ACCEPTED

Test 63

Group: 4

Verdict: ACCEPTED

Test 64

Group: 4

Verdict: ACCEPTED

Test 65

Group: 4

Verdict: ACCEPTED

Test 66

Group: 4

Verdict: OUTPUT LIMIT EXCEEDED

Test 67

Group: 4

Verdict: OUTPUT LIMIT EXCEEDED

Test 68

Group: 4

Verdict: ACCEPTED

Test 69

Group: 4

Verdict: ACCEPTED

Test 70

Group: 4

Verdict: WRONG ANSWER

Test 71

Group: 4

Verdict: ACCEPTED

Test 72

Group: 4

Verdict: ACCEPTED

Test 73

Group: 4

Verdict: ACCEPTED

Test 74

Group: 4

Verdict: ACCEPTED

Test 75

Group: 4

Verdict: ACCEPTED

Test 76

Group: 4

Verdict: ACCEPTED

Test 77

Group: 4

Verdict: ACCEPTED

Test 78

Group: 4

Verdict: ACCEPTED

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 80

Group: 4

Verdict: TIME LIMIT EXCEEDED