CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:ollpu
Submission time:2015-10-06 18:39:08 +0300
Language:Python2
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#10.06 s1details
#20.06 s1details
#30.06 s1details
#40.06 s1details
#50.06 s1details
#60.04 s1details
#70.06 s1details
#80.06 s1details
#90.05 s1details
#100.05 s1details
#110.06 s1details
#120.05 s1details
#130.06 s1details
#140.05 s1details
#150.05 s1details
#160.06 s1details
#170.05 s1details
#180.06 s1details
#190.06 s1details
#200.06 s1details
#210.06 s2details
#220.06 s2details
#230.06 s2details
#240.04 s2details
#250.06 s2details
#260.05 s2details
#270.05 s2details
#280.06 s2details
#290.05 s2details
#300.05 s2details
#310.06 s2details
#320.06 s2details
#330.06 s2details
#340.06 s2details
#350.06 s2details
#360.06 s2details
#370.06 s2details
#380.06 s2details
#390.05 s2details
#400.06 s2details
#410.06 s3details
#420.05 s3details
#430.06 s3details
#440.05 s3details
#450.06 s3details
#460.06 s3details
#470.05 s3details
#480.06 s3details
#490.06 s3details
#500.06 s3details
#510.06 s3details
#520.06 s3details
#530.05 s3details
#540.05 s3details
#550.06 s3details
#56--3details
#57--3details
#58--3details
#590.79 s3details
#60--3details
#610.05 s4details
#620.05 s4details
#630.05 s4details
#640.05 s4details
#650.06 s4details
#660.06 s4details
#670.06 s4details
#680.05 s4details
#690.06 s4details
#700.05 s4details
#710.06 s4details
#720.06 s4details
#730.06 s4details
#740.06 s4details
#750.05 s4details
#76--4details
#77--4details
#78--4details
#79--4details
#80--4details

Code

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

from sys import stdin

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


string = readline()
print(string)
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):
    bits.pop(jakso)
    bits_pol.pop(jakso)
    
def remove_jakso(jakso):
    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)
        if around >= 1:
            bits[jakso] = around
            bits_pol[jakso] = not bits_pol[jakso]
            if before:
                rem(jakso-1)
        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

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 details

Test 1

Group: 1

Verdict:

input
1011001010

correct output
QAQ

user output
1011001010
QAQ

Test 2

Group: 1

Verdict:

input
0000001001

correct output
3
1 1 1 

user output
0000001001
3
2 1 1

Test 3

Group: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
0111011100
3
1 2 1

Test 4

Group: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
0100100100
4
1 2 1 1

Test 5

Group: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
1110010110
4
3 2 1 1

Test 6

Group: 1

Verdict:

input
1111110110

correct output
3
1 1 1 

user output
1111110110
3
2 1 1

Test 7

Group: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
0011110001
3
3 1 1

Test 8

Group: 1

Verdict:

input
0111111000

correct output
2
1 1 

user output
0111111000
2
1 1

Test 9

Group: 1

Verdict:

input
1111111100

correct output
2
1 1 

user output
1111111100
2
1 1

Test 10

Group: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
1000010011
3
1 2 1

Test 11

Group: 1

Verdict:

input
1101110000

correct output
3
1 1 1 

user output
1101110000
3
2 1 1

Test 12

Group: 1

Verdict:

input
1101101100

correct output
4
1 2 1 1 

user output
1101101100
4
2 2 1 1

Test 13

Group: 1

Verdict:

input
0100111110

correct output
3
1 1 1 

user output
0100111110
3
1 1 1

Test 14

Group: 1

Verdict:

input
1101001011

correct output
4
2 2 2 1 

user output
1101001011
4
2 2 2 1

Test 15

Group: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
1110110010
4
3 2 1 1

Test 16

Group: 1

Verdict:

input
0011011100

correct output
3
3 2 1 

user output
0011011100
3
2 2 1

Test 17

Group: 1

Verdict:

input
1100101011

correct output
QAQ

user output
1100101011
QAQ

Test 18

Group: 1

Verdict:

input
1101100111

correct output
3
2 2 1 

user output
1101100111
3
2 2 1

Test 19

Group: 1

Verdict:

input
0110000100

correct output
3
2 1 1 

user output
0110000100
3
2 1 1

Test 20

Group: 1

Verdict:

input
0000101000

correct output
QAQ

user output
0000101000
QAQ

Test 21

Group: 2

Verdict:

input
1110010100

correct output
QAQ

user output
1110010100
QAQ

Test 22

Group: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
1110010000
3
2 1 1

Test 23

Group: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
1001101100
4
2 1 1 1

Test 24

Group: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
0000000111
2
1 1

Test 25

Group: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
0011111110
2
2 1

Test 26

Group: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
1100101100
4
2 2 1 1

Test 27

Group: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
0111101110
3
1 2 1

Test 28

Group: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
0000011011
3
2 1 1

Test 29

Group: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
1110011101
3
3 2 1

Test 30

Group: 2

Verdict:

input
0001011011

correct output
4
1 1 1 1 

user output
0001011011
4
2 2 1 1

Test 31

Group: 2

Verdict:

input
0010110011

correct output
4
1 1 1 1 

user output
0010110011
4
2 2 1 1

Test 32

Group: 2

Verdict:

input
0011100000

correct output
2
2 1 

user output
0011100000
2
2 1

Test 33

Group: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
1110100110
4
2 2 1 1

Test 34

Group: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
0110110111
4
2 1 1 1

Test 35

Group: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
1110110010
4
3 2 1 1

Test 36

Group: 2

Verdict:

input
110011001100110011001010101010...

correct output
QAQ

user output
110011001100110011001010101010...

Test 37

Group: 2

Verdict:

input
110011001100110011001100101010...

correct output
QAQ

user output
110011001100110011001100101010...

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

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

user output
110011001100110011001100110011...

Test 39

Group: 2

Verdict:

input
010101010101010101010101010101...

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

user output
010101010101010101010101010101...

Test 40

Group: 2

Verdict:

input
011010000011111011110000110011...

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

user output
011010000011111011110000110011...

Test 41

Group: 3

Verdict:

input
0010101000

correct output
QAQ

user output
0010101000
QAQ

Test 42

Group: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
0100010110
4
1 1 2 1

Test 43

Group: 3

Verdict:

input
0100110110

correct output
4
2 1 1 1 

user output
0100110110
4
1 1 2 1

Test 44

Group: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
1110000001
2
2 1

Test 45

Group: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
0001001110
3
2 2 1

Test 46

Group: 3

Verdict:

input
0011100011

correct output
3
1 2 1 

user output
0011100011
3
2 1 1

Test 47

Group: 3

Verdict:

input
0100111100

correct output
3
1 1 1 

user output
0100111100
3
1 1 1

Test 48

Group: 3

Verdict:

input
0001001000

correct output
3
2 2 1 

user output
0001001000
3
2 2 1

Test 49

Group: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
0100100010
4
1 2 1 1

Test 50

Group: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
1100101110
4
3 2 1 1

Test 51

Group: 3

Verdict:

input
1000111011

correct output
3
2 1 1 

user output
1000111011
3
2 1 1

Test 52

Group: 3

Verdict:

input
1000111111

correct output
2
1 1 

user output
1000111111
2
1 1

Test 53

Group: 3

Verdict:

input
0110011100

correct output
3
2 1 1 

user output
0110011100
3
2 1 1

Test 54

Group: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
0001000110
3
2 2 1

Test 55

Group: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
1110110010
4
3 2 1 1

Test 56

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 57

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 59

Group: 3

Verdict:

input
010101010101010101010101010101...

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

user output
010101010101010101010101010101...

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

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

user output
(empty)

Test 61

Group: 4

Verdict:

input
1110101110

correct output
QAQ

user output
1110101110
QAQ

Test 62

Group: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
0111001011
4
2 1 1 1

Test 63

Group: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
1101111101
3
2 2 1

Test 64

Group: 4

Verdict:

input
1001110001

correct output
3
2 1 1 

user output
1001110001
3
2 1 1

Test 65

Group: 4

Verdict:

input
1000000011

correct output
2
1 1 

user output
1000000011
2
1 1

Test 66

Group: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
0100010111
4
1 1 1 1

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
0100111010
QAQ

Test 68

Group: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
0010111101
4
2 2 1 1

Test 69

Group: 4

Verdict:

input
0011111000

correct output
2
2 1 

user output
0011111000
2
2 1

Test 70

Group: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
1101001101
4
2 2 2 1

Test 71

Group: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
0110111000
3
1 2 1

Test 72

Group: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
1100110111
3
3 2 1

Test 73

Group: 4

Verdict:

input
1110011111

correct output
2
2 1 

user output
1110011111
2
2 1

Test 74

Group: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
1011000101
QAQ

Test 75

Group: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
1110110010
4
3 2 1 1

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

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
(empty)