CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:ollpu
Submission time:2015-10-11 16:05:51
Language:Python2
Status:READY
Result:11
Feedback
groupverdictscore
#1ACCEPTED11
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.01 s1details
#7ACCEPTED0.07 s1details
#8ACCEPTED0.06 s1details
#9ACCEPTED0.06 s1details
#10ACCEPTED0.06 s1details
#11ACCEPTED0.06 s1details
#12ACCEPTED0.05 s1details
#13ACCEPTED0.06 s1details
#14ACCEPTED0.06 s1details
#15ACCEPTED0.06 s1details
#16ACCEPTED0.06 s1details
#17ACCEPTED0.05 s1details
#18ACCEPTED0.07 s1details
#19ACCEPTED0.06 s1details
#20ACCEPTED0.06 s1details
#21ACCEPTED0.05 s2details
#22ACCEPTED0.06 s2details
#23ACCEPTED0.06 s2details
#24ACCEPTED0.06 s2details
#25ACCEPTED0.06 s2details
#26ACCEPTED0.06 s2details
#27ACCEPTED0.05 s2details
#28ACCEPTED0.05 s2details
#29ACCEPTED0.06 s2details
#30ACCEPTED0.06 s2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.06 s2details
#33ACCEPTED0.06 s2details
#34ACCEPTED0.06 s2details
#35ACCEPTED0.06 s2details
#36ACCEPTED0.07 s2details
#37ACCEPTED0.07 s2details
#38ACCEPTED0.05 s2details
#390.06 s2details
#40ACCEPTED0.05 s2details
#41ACCEPTED0.06 s3details
#42ACCEPTED0.06 s3details
#43ACCEPTED0.07 s3details
#44ACCEPTED0.06 s3details
#45ACCEPTED0.05 s3details
#46ACCEPTED0.05 s3details
#47ACCEPTED0.06 s3details
#48ACCEPTED0.05 s3details
#49ACCEPTED0.05 s3details
#50ACCEPTED0.06 s3details
#51ACCEPTED0.06 s3details
#52ACCEPTED0.05 s3details
#53ACCEPTED0.06 s3details
#54ACCEPTED0.06 s3details
#55ACCEPTED0.06 s3details
#56ACCEPTED0.43 s3details
#57ACCEPTED0.45 s3details
#58ACCEPTED0.43 s3details
#590.81 s3details
#60ACCEPTED0.35 s3details
#61ACCEPTED0.06 s4details
#62ACCEPTED0.05 s4details
#63ACCEPTED0.06 s4details
#64ACCEPTED0.06 s4details
#65ACCEPTED0.06 s4details
#66ACCEPTED0.07 s4details
#670.06 s4details
#68ACCEPTED0.06 s4details
#69ACCEPTED0.06 s4details
#70ACCEPTED0.06 s4details
#71ACCEPTED0.07 s4details
#72ACCEPTED0.06 s4details
#73ACCEPTED0.06 s4details
#740.06 s4details
#75ACCEPTED0.06 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()
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=0):
    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 > 10:
    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
                elif left_chain_alive and right_chain_alive:
                    score += 1
        return score

    impossible = False
    
    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:
        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
        
        if max_score != -1:
            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 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
2 1 1

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

user output
3
1 2 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
3 2 1 1

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
2 1 1

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

correct output
3
1 2 1 

user output
3
3 1 1

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

correct output
2
1 1 

user output
2
1 1

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

correct output
3
2 1 1 

user output
3
1 2 1

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
2 1 1

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

user output
4
2 2 1 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: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
4
2 2 2 1

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
3
2 2 1

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
3
2 2 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: ACCEPTED

input
1110010000

correct output
3
2 1 1 

user output
3
2 1 1

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

correct output
4
1 1 1 1 

user output
4
2 1 1 1

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

correct output
2
1 1 

user output
2
1 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 2 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: ACCEPTED

input
0000011011

correct output
3
2 1 1 

user output
3
2 1 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
2 2 1 1

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
2 2 1 1

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
2
2 1

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

correct output
4
1 1 1 1 

user output
4
2 2 1 1

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 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: ACCEPTED

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:

input
010101010101010101010101010101...

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

user output
QAQ

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...

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

user output
29
14 13 13 13 1 10 9 9 21 20 2 2...

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

input
0011100011

correct output
3
1 2 1 

user output
3
2 1 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: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
3
2 2 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
3 2 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: ACCEPTED

input
0110011100

correct output
3
2 1 1 

user output
3
2 1 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
3 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: ACCEPTED

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:

input
010101010101010101010101010101...

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

user output
QAQ

Test 60

Group: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...

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

user output
1683
552 1095 415 574 840 1061 1150...

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 1 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
2 1 1

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

correct output
4
1 1 1 1 

user output
4
1 1 1 1

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
QAQ

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

correct output
4
1 1 1 1 

user output
4
2 2 1 1

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
2
2 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: ACCEPTED

input
0110111000

correct output
3
2 1 1 

user output
3
1 2 1

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

correct output
3
3 2 1 

user output
3
3 2 1

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
2
2 1

Test 74

Group: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
QAQ

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
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)