Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-10-11 23:45:0666
2015-10-11 23:26:1366
2015-10-11 23:24:2066
2015-10-11 19:13:2766
2015-10-11 19:12:0638
2015-10-11 18:49:5638
2015-10-11 18:43:0311
2015-10-11 18:34:4311
2015-10-11 18:33:1711
2015-10-11 16:22:5711
2015-10-11 16:21:4711
2015-10-11 16:05:5111
2015-10-11 15:28:0611
2015-10-11 15:15:3111
2015-10-11 14:05:0811
2015-10-11 13:57:5111
2015-10-11 13:44:510
2015-10-06 20:43:3638
2015-10-06 19:57:340
2015-10-06 19:46:210
2015-10-06 19:46:000
2015-10-06 19:39:320
2015-10-06 19:13:350
2015-10-06 19:12:2627
2015-10-06 19:11:2627
2015-10-06 19:07:520
2015-10-06 18:55:180
2015-10-06 18:50:240
2015-10-06 18:40:1711
2015-10-06 18:39:080
2015-10-06 18:29:4611
2015-10-06 18:28:2711
2015-10-06 18:24:3211
2015-10-06 18:23:090
2015-10-06 18:22:2211
2015-10-06 18:20:4011
2015-10-06 18:16:1311
2015-10-03 01:02:110
2015-10-03 00:49:330
2015-10-03 00:19:210
2015-10-03 00:17:080
2015-10-03 00:12:230
2015-10-03 00:10:090
2015-10-02 23:48:200
2015-10-02 23:33:2011
2015-10-02 23:31:320
2015-10-02 23:24:180
Task:Bittipeli
Sender:ollpu
Submission time:2015-10-11 23:45:06
Language:Python2
Status:READY
Score:66

Feedback

groupverdictscore
#1ACCEPTED11
#2ACCEPTED27
#3ACCEPTED28
#4WRONG ANSWER0

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.001details
#2ACCEPTED0.06 / 1.001details
#3ACCEPTED0.05 / 1.001details
#4ACCEPTED0.06 / 1.001details
#5ACCEPTED0.06 / 1.001details
#6ACCEPTED0.06 / 1.001details
#7ACCEPTED0.06 / 1.001details
#8ACCEPTED0.06 / 1.001details
#9ACCEPTED0.05 / 1.001details
#10ACCEPTED0.06 / 1.001details
#11ACCEPTED0.00 / 1.001details
#12ACCEPTED0.06 / 1.001details
#13ACCEPTED0.05 / 1.001details
#14ACCEPTED0.06 / 1.001details
#15ACCEPTED0.06 / 1.001details
#16ACCEPTED0.06 / 1.001details
#17ACCEPTED0.07 / 1.001details
#18ACCEPTED0.06 / 1.001details
#19ACCEPTED0.06 / 1.001details
#20ACCEPTED0.06 / 1.001details
#21ACCEPTED0.06 / 1.002details
#22ACCEPTED0.06 / 1.002details
#23ACCEPTED0.06 / 1.002details
#24ACCEPTED0.06 / 1.002details
#25ACCEPTED0.07 / 1.002details
#26ACCEPTED0.06 / 1.002details
#27ACCEPTED0.06 / 1.002details
#28ACCEPTED0.06 / 1.002details
#29ACCEPTED0.06 / 1.002details
#30ACCEPTED0.06 / 1.002details
#31ACCEPTED0.07 / 1.002details
#32ACCEPTED0.05 / 1.002details
#33ACCEPTED0.06 / 1.002details
#34ACCEPTED0.06 / 1.002details
#35ACCEPTED0.06 / 1.002details
#36ACCEPTED0.06 / 1.002details
#37ACCEPTED0.06 / 1.002details
#38ACCEPTED0.07 / 1.002details
#39ACCEPTED0.06 / 1.002details
#40ACCEPTED0.06 / 1.002details
#41ACCEPTED0.06 / 1.003details
#42ACCEPTED0.06 / 1.003details
#43ACCEPTED0.06 / 1.003details
#44ACCEPTED0.06 / 1.003details
#45ACCEPTED0.06 / 1.003details
#46ACCEPTED0.05 / 1.003details
#47ACCEPTED0.06 / 1.003details
#48ACCEPTED0.06 / 1.003details
#49ACCEPTED0.06 / 1.003details
#50ACCEPTED0.06 / 1.003details
#51ACCEPTED0.06 / 1.003details
#52ACCEPTED0.06 / 1.003details
#53ACCEPTED0.05 / 1.003details
#54ACCEPTED0.06 / 1.003details
#55ACCEPTED0.06 / 1.003details
#56ACCEPTED0.60 / 1.003details
#57ACCEPTED0.71 / 1.003details
#58ACCEPTED0.97 / 1.003details
#59ACCEPTED0.87 / 1.003details
#60ACCEPTED0.57 / 1.003details
#61ACCEPTED0.06 / 1.004details
#62ACCEPTED0.06 / 1.004details
#63ACCEPTED0.06 / 1.004details
#64ACCEPTED0.05 / 1.004details
#65ACCEPTED0.06 / 1.004details
#66ACCEPTED0.06 / 1.004details
#67WRONG ANSWER0.06 / 1.004details
#68ACCEPTED0.06 / 1.004details
#69ACCEPTED0.06 / 1.004details
#70ACCEPTED0.07 / 1.004details
#71ACCEPTED0.06 / 1.004details
#72ACCEPTED0.07 / 1.004details
#73ACCEPTED0.06 / 1.004details
#74WRONG ANSWER0.06 / 1.004details
#75ACCEPTED0.06 / 1.004details
#76TIME LIMIT EXCEEDED-- / 1.004details
#77TIME LIMIT EXCEEDED-- / 1.004details
#78TIME LIMIT EXCEEDED-- / 1.004details
#79TIME LIMIT EXCEEDED-- / 1.004details
#80TIME LIMIT EXCEEDED-- / 1.004details

Code

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

# Epätoivoinen viimeinen yritys

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 = 1
    # 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 details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

view   save

correct output
3
1 1 1 

view   save

user output
3
2 1 1

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 2 1 1

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
3 2 1 1

view   save

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

view   save

correct output
3
1 1 1 

view   save

user output
3
2 1 1

view   save

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

view   save

correct output
3
1 2 1 

view   save

user output
3
3 1 1

view   save

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

view   save

correct output
2
1 1 

view   save

user output
2
1 1

view   save

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

view   save

correct output
2
1 1 

view   save

user output
2
1 1

view   save

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1

view   save

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

view   save

correct output
3
1 1 1 

view   save

user output
3
2 1 1

view   save

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

view   save

correct output
4
1 2 1 1 

view   save

user output
4
2 2 1 1

view   save

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1

view   save

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

view   save

correct output
4
2 2 2 1 

view   save

user output
4
2 2 2 1

view   save

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
3 2 1 1

view   save

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

view   save

correct output
3
3 2 1 

view   save

user output
3
2 2 1

view   save

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1

view   save

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1

view   save

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1

view   save

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 1 1 1

view   save

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

view   save

correct output
2
1 1 

view   save

user output
2
1 1

view   save

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

view   save

correct output
2
2 1 

view   save

user output
2
2 1

view   save

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 2 1 1

view   save

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1

view   save

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1

view   save

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

view   save

correct output
3
3 2 1 

view   save

user output
3
3 2 1

view   save

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 2 1 1

view   save

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 2 1 1

view   save

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

view   save

correct output
2
2 1 

view   save

user output
2
2 1

view   save

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 2 1 1

view   save

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1

view   save

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
3 2 1 1

view   save

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 38

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
31
1 20 20 20 20 20 20 20 20 20 2...
view   save

user output
31
21 20 20 19 19 18 18 17 17 16 ...
view   save

Test 39

Group: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...
view   save

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

user output
23
14 13 13 11 11 21 9 11 9 2 2 1...
view   save

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 1 2 1

view   save

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 1 2 1

view   save

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

view   save

correct output
2
2 1 

view   save

user output
2
2 1

view   save

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1

view   save

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

view   save

correct output
3
1 2 1 

view   save

user output
3
2 1 1

view   save

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1

view   save

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1

view   save

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 2 1 1

view   save

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
3 2 1 1

view   save

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1

view   save

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

view   save

correct output
2
1 1 

view   save

user output
2
1 1

view   save

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1

view   save

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1

view   save

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
3 2 1 1

view   save

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 58

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
1501
1 1000 1000 1000 1000 1000 100...
view   save

user output
1501
1001 1000 1000 999 999 998 998...
view   save

Test 59

Group: 3

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 60

Group: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...
view   save

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

user output
1272
840 840 867 841 527 415 867 28...
view   save

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1

view   save

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1

view   save

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1

view   save

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

view   save

correct output
2
1 1 

view   save

user output
2
1 1

view   save

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1

view   save

Test 67

Group: 4

Verdict: WRONG ANSWER

input
0100111010

view   save

correct output
4
2 1 1 1 

view   save

user output
QAQ

view   save

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 2 1 1

view   save

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

view   save

correct output
2
2 1 

view   save

user output
2
2 1

view   save

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

view   save

correct output
4
2 2 2 1 

view   save

user output
4
2 2 2 1

view   save

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1

view   save

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

view   save

correct output
3
3 2 1 

view   save

user output
3
3 2 1

view   save

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

view   save

correct output
2
2 1 

view   save

user output
2
2 1

view   save

Test 74

Group: 4

Verdict: WRONG ANSWER

input
1011000101

view   save

correct output
4
2 1 1 1 

view   save

user output
QAQ

view   save

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
3 2 1 1

view   save

Test 76

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 77

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 78

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
30001
1 20000 20000 20000 20000 2000...
view   save

user output
(empty)

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
010101010101010101010101010101...
view   save

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
(empty)

Test 80

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
111000110000011000001101010010...
view   save

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

user output
(empty)