CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:Perdex
Submission time:2015-10-08 17:53:13
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.20 s1details
#2ACCEPTED0.17 s1details
#30.18 s1details
#4ACCEPTED0.17 s1details
#5ACCEPTED0.17 s1details
#6ACCEPTED0.17 s1details
#70.17 s1details
#8ACCEPTED0.17 s1details
#90.17 s1details
#100.17 s1details
#11ACCEPTED0.18 s1details
#120.18 s1details
#13ACCEPTED0.18 s1details
#140.17 s1details
#15ACCEPTED0.17 s1details
#160.17 s1details
#17ACCEPTED0.17 s1details
#180.17 s1details
#19ACCEPTED0.17 s1details
#20ACCEPTED0.17 s1details
#21ACCEPTED0.17 s2details
#220.06 s2details
#23ACCEPTED0.18 s2details
#240.19 s2details
#25ACCEPTED0.17 s2details
#26ACCEPTED0.17 s2details
#27ACCEPTED0.16 s2details
#280.17 s2details
#29ACCEPTED0.17 s2details
#30ACCEPTED0.17 s2details
#31ACCEPTED0.18 s2details
#320.18 s2details
#33ACCEPTED0.17 s2details
#340.17 s2details
#35ACCEPTED0.17 s2details
#36ACCEPTED0.17 s2details
#37ACCEPTED0.18 s2details
#380.18 s2details
#39ACCEPTED0.17 s2details
#40ACCEPTED0.18 s2details
#41ACCEPTED0.17 s3details
#42ACCEPTED0.17 s3details
#43ACCEPTED0.16 s3details
#44ACCEPTED0.17 s3details
#45ACCEPTED0.19 s3details
#460.18 s3details
#47ACCEPTED0.17 s3details
#480.18 s3details
#49ACCEPTED0.18 s3details
#50ACCEPTED0.17 s3details
#51ACCEPTED0.17 s3details
#52ACCEPTED0.17 s3details
#530.17 s3details
#54ACCEPTED0.17 s3details
#55ACCEPTED0.17 s3details
#56ACCEPTED0.17 s3details
#57ACCEPTED0.17 s3details
#580.36 s3details
#59ACCEPTED0.47 s3details
#600.19 s3details
#61ACCEPTED0.18 s4details
#620.17 s4details
#63ACCEPTED0.19 s4details
#64ACCEPTED0.17 s4details
#65ACCEPTED0.17 s4details
#660.16 s4details
#67ACCEPTED0.18 s4details
#68ACCEPTED0.17 s4details
#690.17 s4details
#70ACCEPTED0.17 s4details
#710.17 s4details
#720.17 s4details
#730.17 s4details
#74ACCEPTED0.17 s4details
#75ACCEPTED0.18 s4details
#76ACCEPTED0.19 s4details
#77ACCEPTED0.20 s4details
#78--4details
#79--4details
#800.85 s4details

Code

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();
    private static int trueTotal;
    
    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;
        trueTotal = 0;
        
        for(int i = 1; i < c.length; i++){
            if((c[i] == '1') == currentBool){
                count++;
            }else{
                currentBool = !currentBool;
                
                if(count != 1){
                    trueTotal++;
                    falseCount = 0;
                }else{
                    falseCount++;
                    mostFalses = Math.max(mostFalses, 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(){
        
        if(firstTrue > (double)bits.size()/2)
            return;
        
        if(bits.size() == 1){
            if(bits.get(0)){
                ans.add(1);
                solved = true;
            }
            return;
        }
        
        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 && !bits.get(1)) || (i == bits.size() - 1 && !bits.get(bits.size()-2))){
                    bits.remove(i);
                    trueTotal--;
                    
                    ans.add(counter);
                    take();
                    if(!solved){
                        ans.remove(ans.size()-1);
                        bits.add(i, true);
                        trueTotal++;
                    }
                }else 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);
                    
                    if(first || second)
                        trueTotal--;
                    
                    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(first || second)
                            trueTotal++;
                    }
                }
                if(solved)
                    return;
            }
            
        }
        
        if(!(trueTotal > (double)bits.size() / 2)){
            int falseCounter = firstTrue;
            for(int i = firstTrue; i - falseCounter < (double)bits.size()/2; i++){
                if(bits.get(i)){
                    falseCounter = 0;
                }else{
                    falseCounter++;
                    if(falseCounter > (double)bits.size()/2)
                        return;
                }
            }
        }
        
        for(int i = firstTrue; i < bits.size(); i++){
            
            if(bits.get(i)){
                
                counter++;
                
                if((i == 0 && bits.get(1)) || (i == bits.size() - 1 && bits.get(bits.size()-2))){
                    bits.remove(i);
                    trueTotal--;
                    
                    ans.add(counter);
                    take();
                    if(!solved){
                        ans.remove(ans.size()-1);
                        bits.add(i, true);
                        trueTotal++;
                    }
                }else 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);
                    
                    if(first)
                        trueTotal--;
                    if(second)
                        trueTotal--;
                    
                    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(first)
                            trueTotal++;
                        if(second)
                            trueTotal++;
                    }
                }
                if(solved)
                    return;
            }
            
        }
        
    }
    
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
1 1 1 

Test 3

Group: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
4
1 4 3 1 

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
1 1 1 

Test 7

Group: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
3
3 3 1 

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1 

Test 9

Group: 1

Verdict:

input
1111111100

correct output
2
1 1 

user output
2
3 1 

Test 10

Group: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
4
1 4 3 1 

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
1 1 1 

Test 12

Group: 1

Verdict:

input
1101101100

correct output
4
1 2 1 1 

user output
5
1 1 4 3 1 

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

correct output
3
1 1 1 

user output
3
1 1 1 

Test 14

Group: 1

Verdict:

input
1101001011

correct output
4
2 2 2 1 

user output
5
1 1 1 3 1 

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1 

Test 16

Group: 1

Verdict:

input
0011011100

correct output
3
3 2 1 

user output
4
2 4 3 1 

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Group: 1

Verdict:

input
1101100111

correct output
3
2 2 1 

user output
4
1 1 3 1 

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

correct output
3
2 1 1 

user output
3
2 1 1 

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000

correct output
QAQ

user output
QAQ

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

Test 22

Group: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
3
2 3 1 

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 24

Group: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
2
3 1 

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

correct output
2
2 1 

user output
2
2 1 

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

correct output
3
2 1 1 

user output
3
1 2 1 

Test 28

Group: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
3
2 3 1 

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

correct output
3
3 2 1 

user output
3
3 2 1 

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 32

Group: 2

Verdict:

input
0011100000

correct output
2
2 1 

user output
3
4 3 1 

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 34

Group: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
4
1 2 3 1 

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1 

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

correct output
31
1 20 20 20 20 20 20 20 20 20 2...

user output
40
20 19 18 17 16 15 14 13 12 11 ...

Test 39

Group: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...

correct output
23
13 13 12 11 11 11 11 10 9 9 9 ...

user output
25
1 1 1 1 1 4 3 4 3 2 3 2 1 1 1 ...

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

correct output
4
2 1 1 1 

user output
4
1 1 2 1 

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

correct output
4
2 1 1 1 

user output
4
1 1 2 1 

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

correct output
2
2 1 

user output
2
2 1 

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

correct output
3
2 2 1 

user output
3
2 2 1 

Test 46

Group: 3

Verdict:

input
0011100011

correct output
3
1 2 1 

user output
4
5 4 3 1 

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

correct output
3
1 1 1 

user output
3
1 1 1 

Test 48

Group: 3

Verdict:

input
0001001000

correct output
3
2 2 1 

user output
4
1 1 3 1 

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

correct output
3
2 1 1 

user output
3
2 1 1 

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

correct output
2
1 1 

user output
2
1 1 

Test 53

Group: 3

Verdict:

input
0110011100

correct output
3
2 1 1 

user output
4
1 4 3 1 

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

correct output
3
2 2 1 

user output
3
2 2 1 

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1 

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
1501
1 1000 1000 1000 1000 1000 100...

user output
2000
1000 999 998 997 996 995 994 9...

Test 59

Group: 3

Verdict: ACCEPTED

input
010101010101010101010101010101...

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

correct output
1272
1 1 648 647 646 646 645 645 64...

user output
1294
1 3 2 3 2 2 1 1 1 1 2 3 4 3 4 ...

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Group: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 3 1 

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

correct output
3
2 2 1 

user output
3
2 2 1 

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

correct output
3
2 1 1 

user output
3
1 2 1 

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1 

Test 66

Group: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
4
1 1 3 1 

Test 67

Group: 4

Verdict: ACCEPTED

input
0100111010

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 69

Group: 4

Verdict:

input
0011111000

correct output
2
2 1 

user output
3
4 3 1 

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

correct output
4
2 2 2 1 

user output
4
2 2 2 1 

Test 71

Group: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
4
1 4 3 1 

Test 72

Group: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
4
3 4 3 1 

Test 73

Group: 4

Verdict:

input
1110011111

correct output
2
2 1 

user output
3
4 3 1 

Test 74

Group: 4

Verdict: ACCEPTED

input
1011000101

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1 

Test 76

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 77

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
30001
1 20000 20000 20000 20000 2000...

user output
(empty)

Test 79

Group: 4

Verdict:

input
010101010101010101010101010101...

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 80

Group: 4

Verdict:

input
111000110000011000001101010010...

correct output
25011
1 12471 12470 12469 12468 1246...

user output
25072
7 6 5 4 4 7 6 5 4 4 3 3 2 1 1 ...