Bittipeli

import java.util.ArrayList;

public class Bittipeli{
    
    private static boolean solved = false;
    private static final ArrayList<Integer> ans = new ArrayList();
    private static final ArrayList<Boolean> bits = new ArrayList();
    
    public static void main(String[] args){
        IO io = new IO();
        
        char[] c = io.next().toCharArray();
        
        boolean currentBool = c[0] == '1';
        int count = 1;
        
        boolean trueFound = false;
        int falseCount = 0, mostFalses = 0;
        
        for(int i = 1; i < c.length; i++){
            if((c[i] == '1') == currentBool){
                count++;
            }else{
                currentBool = !currentBool;
                
                if(count != 1){
                    mostFalses = Math.max(mostFalses, falseCount);
                    falseCount = 0;
                }else{
                    falseCount++;
                }
                
                bits.add(count != 1);
                
                if(!trueFound && count != 1){
                    trueFound = true;
                    firstTrue = bits.size() - 1;
                }
                
                count = 1;
            }
        }
        if(!trueFound)
            firstTrue = bits.size();
        bits.add(count != 1);
        
        
        //bits initialized
        
        if(mostFalses < (double)bits.size()/2)
            take();
        
        if(ans.isEmpty()){
            io.print("QAQ");
        }else{
            io.println(ans.size());
            for(int i: ans)
                io.print(i + " ");
        }
        
        io.close();
    }
    
    static int firstTrue;
    
    private static void take(){
        
        int counter = 0;
        boolean firstFound = false;
        
        for(int i = firstTrue; i < bits.size(); i++){
            
            if(bits.get(i)){
                
                if(!firstFound){
                    firstTrue = Math.max(0, i - 1);
                    firstFound = true;
                }
                
                counter++;
                
                if(i == 0 || i == bits.size() - 1){
                    bits.remove(i);
                    
                    if(bits.isEmpty()){
                        ans.add(counter);
                        solved = true;
                        return;
                    }
                    
                    ans.add(counter);
                    take();
                    if(!solved){
                        ans.remove(ans.size()-1);
                        bits.add(i, true);
                    }
                }else if(!bits.get(i-1) || !bits.get(i+1)){
                    //took from middle
                    
                    boolean first = bits.get(i-1), second = bits.get(i+1);
                    bits.remove(i);
                    bits.remove(i);
                    bits.set(i-1, true);
                    
                    ans.add(counter);
                    take();
                    if(!solved){
                        ans.remove(ans.size()-1);

                        bits.set(i-1, first);
                        bits.add(i, true);
                        bits.add(i+1, second);
                    }
                }
                if(solved)
                    return;
            }
            
        }
        
        int falseCounter = firstTrue;
        for(int i = firstTrue; i < bits.size(); i++){
            if(bits.get(i)){
                if(falseCounter > (double)bits.size()/2)
                    return;
                falseCounter = 0;
            }else
                falseCounter++;
        }
        
        for(int i = firstTrue; i < bits.size(); i++){
            
            if(bits.get(i)){
                
                if(!firstFound){
                    firstTrue = Math.max(0, i - 1);
                    firstFound = true;
                }
                
                counter++;
                
                if(i != 0 && i != bits.size() - 1 && bits.get(i-1) && bits.get(i+1)){
                    //took from middle
                    
                    boolean first = bits.get(i-1), second = bits.get(i+1);
                    bits.remove(i);
                    bits.remove(i);
                    bits.set(i-1, true);
                    
                    ans.add(counter);
                    take();
                    if(!solved){
                        ans.remove(ans.size()-1);

                        bits.set(i-1, first);
                        bits.add(i, true);
                        bits.add(i+1, second);
                    }
                }
                if(solved)
                    return;
            }
            
        }
        
    }
    
}

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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

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

Test 75

Group: 4

Verdict: ACCEPTED

Test 76

Group: 4

Verdict: ACCEPTED

Test 77

Group: 4

Verdict: ACCEPTED

Test 78

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 80

Group: 4

Verdict: ACCEPTED