Bittipeli

#!/usr/bin/env python
# -*- coding: utf-8 -*-

from sys import stdin

def readline():
    return stdin.readline().strip()


# ONGELMAKOHTA: 00000000010100110101

string = readline()
n = len(string)

bits = []
bits_pol = []

last = 'x'
for char in string:
    if char == last:
        bits[-1] += 1
    else:
        bits.append(1)
        bits_pol.append(char == '1')
    last = char

moves = []

def in_bounds(jakso):
    return jakso >= 0 and jakso < len(bits)

def rem(jakso, scores):
    bits.pop(jakso)
    bits_pol.pop(jakso)
    if scores is not 0:
        scores.pop(jakso)
    
def remove_jakso(jakso, scores=0):
    global bits, moves
    if bits[jakso] >= 2:
        len_bits = len(bits)
        around = 0
        before = False
        after = False
        
        # Get the nth-over-2-index
        nth = 1
        for group in bits[:jakso]:
            if group >= 2:
                nth += 1
        
        if jakso-1 >= 0:
            around += bits[jakso-1]
            before = True
        if jakso+1 < len_bits:
            around += bits[jakso+1]
            after = True
        if after:
            rem(jakso+1, scores)
        if around >= 1:
            bits[jakso] = around
            bits_pol[jakso] = not bits_pol[jakso]
            if before:
                rem(jakso-1, scores)
        else:
            bits = []
        
        moves.append(nth)
    else:
        raise 'Tried to remove a chunck with length = 1'

def removable(jakso):
    if in_bounds(jakso):
        return bits[jakso] >= 2
    else:
        return False
if n > 20:
    def calc_score(i, max_dist):
        score = 0
        lenbits = len(bits)
        
        left_chain_alive = True
        right_chain_alive = True
        for dist in xrange(1, max_dist+1):
            if i >= dist and i < lenbits-dist:
                if left_chain_alive:
                    if bits[i-dist] == 1:
                        score += 1
                    else:
                        left_chain_alive = False
                if right_chain_alive:
                    if bits[i+dist] == 1:
                        score += 1
                    else:
                        right_chain_alive = False
                if not (left_chain_alive or right_chain_alive):
                    break
        return score

    impossible = False
    
    max_range = 50
    if n > 5000:
        max_range = 5
    # Measure first scores
    scores = [-1] * len(bits)
    for i, group in enumerate(bits):
        if group >= 2:
            scores[i] = calc_score(i, max_range)
    
    while not impossible:
        lenbits_2 = len(bits)/2
        max_score = -1
        max_scorer = -1
        for i, score in enumerate(scores):
            if score != -1:
                if score > max_score:
                    max_score = score
                    max_scorer = i
                elif score == max_score:
                    if abs(i-lenbits_2) < abs(max_scorer-lenbits_2):
                        max_score = score
                        max_scorer = i
        
        if max_score != -1:
            # print(bits)
            # print(scores)
            # print(max_scorer)
            remove_jakso(max_scorer, scores)
            for i in xrange(max(0, max_scorer-max_range), min(len(bits), max_scorer+max_range)):
                if bits[i] >= 2:
                    scores[i] = calc_score(i, max_range)
                else:
                    scores[i] = -1
        else:
            impossible = True
            break
        
        if len(bits) == 0:
            break # We are finished!
else:
    def calc_with_dist(i, dist, mp):
        score = 0
        if i >= dist and i < len(bits)-dist:
            score += 1
            if bits[i-dist] == 1:
                score += mp-dist
            if bits[i+dist] == 1:
                score += mp-dist
        return score

    impossible = False
    while not impossible:
        max_score = -1
        max_scorer = -1
        for i, group in enumerate(bits):
            if group >= 2:
                score = 0
                calc_range = 2
                if n > 20:
                    calc_range = 16
                for dist in xrange(1, calc_range+1):
                    score += calc_with_dist(i, dist, dist+1)
                
                if score > max_score:
                    max_score = score
                    max_scorer = i
        
        if max_score >= 0:
            remove_jakso(max_scorer)
        else:
            impossible = True
            break
        
        if len(bits) == 0:
            break # We are finished!
    
if not impossible:
    print(len(moves))
    print(' '.join(map(str, moves)))
else:
    print('QAQ')

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

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: ACCEPTED

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: ACCEPTED

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: ACCEPTED

Test 40

Group: 2

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: ACCEPTED

Test 43

Group: 3

Verdict: ACCEPTED

Test 44

Group: 3

Verdict: ACCEPTED

Test 45

Group: 3

Verdict: ACCEPTED

Test 46

Group: 3

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: ACCEPTED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: ACCEPTED

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: ACCEPTED

Test 52

Group: 3

Verdict: ACCEPTED

Test 53

Group: 3

Verdict: ACCEPTED

Test 54

Group: 3

Verdict: ACCEPTED

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: ACCEPTED

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: ACCEPTED

Test 67

Group: 4

Verdict: WRONG ANSWER

Test 68

Group: 4

Verdict: ACCEPTED

Test 69

Group: 4

Verdict: ACCEPTED

Test 70

Group: 4

Verdict: ACCEPTED

Test 71

Group: 4

Verdict: ACCEPTED

Test 72

Group: 4

Verdict: ACCEPTED

Test 73

Group: 4

Verdict: ACCEPTED

Test 74

Group: 4

Verdict: WRONG ANSWER

Test 75

Group: 4

Verdict: ACCEPTED

Test 76

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 77

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 78

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 80

Group: 4

Verdict: TIME LIMIT EXCEEDED