Submission details
Task:Bittipeli
Sender:AnttiR
Submission time:2015-10-03 18:05:44 +0300
Language:Python3
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
Test results
testverdicttimesubtask
#1ACCEPTED0.08 s1details
#20.09 s1details
#30.08 s1details
#40.08 s1details
#50.08 s1details
#60.08 s1details
#70.07 s1details
#80.09 s1details
#90.08 s1details
#100.09 s1details
#110.09 s1details
#120.08 s1details
#130.08 s1details
#140.07 s1details
#150.09 s1details
#160.12 s1details
#17ACCEPTED0.08 s1details
#180.07 s1details
#190.08 s1details
#20ACCEPTED0.08 s1details
#21ACCEPTED0.08 s2details
#220.08 s2details
#230.08 s2details
#240.07 s2details
#250.07 s2details
#260.08 s2details
#270.08 s2details
#280.08 s2details
#290.09 s2details
#300.08 s2details
#310.09 s2details
#320.08 s2details
#330.08 s2details
#340.08 s2details
#350.07 s2details
#36--2details
#37--2details
#38--2details
#390.08 s2details
#400.08 s2details
#41ACCEPTED0.09 s3details
#420.08 s3details
#430.08 s3details
#440.08 s3details
#450.09 s3details
#460.07 s3details
#470.07 s3details
#480.10 s3details
#490.10 s3details
#500.08 s3details
#510.09 s3details
#520.09 s3details
#530.09 s3details
#540.08 s3details
#550.09 s3details
#560.30 s3details
#570.26 s3details
#580.18 s3details
#590.33 s3details
#600.18 s3details
#61ACCEPTED0.08 s4details
#620.08 s4details
#630.09 s4details
#640.10 s4details
#650.09 s4details
#660.14 s4details
#670.09 s4details
#680.09 s4details
#690.12 s4details
#700.09 s4details
#710.08 s4details
#720.07 s4details
#730.08 s4details
#740.07 s4details
#750.09 s4details
#760.22 s4details
#770.22 s4details
#780.27 s4details
#790.76 s4details
#800.27 s4details

Code

def recursiveBitGame(input):
	removableIndex = 0
	for objectIndex in range(0,len(input)):
		if input[objectIndex] >= 2:
			removableIndex += 1
			if len(input) == 1:
				return [1]
			newInput = list(input)
			del newInput[objectIndex]
			if len(newInput)-1 >= objectIndex and objectIndex > 0:
				newInput[objectIndex-1] += newInput.pop(objectIndex)
			recOut = recursiveBitGame(newInput)
			if recOut is not None:
				recOut.insert(0,removableIndex)
				return recOut
	return None
	
input = input()
prevChar = 'n'
inputList = []
for char in input:
	if prevChar != char:
		inputList.append(1)
		prevChar = char
	else:
		inputList[len(inputList)-1] += 1
output = recursiveBitGame(inputList)
if output is not None:
	for i in output:
		print(i,end=" ")
else:
	print("QAQ")

Test details

Test 1

Subtask: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Subtask: 1

Verdict:

input
0000001001

correct output
3
1 1 1 

user output
1 1 1 

Test 3

Subtask: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
1 1 1 1 

Test 4

Subtask: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
1 2 1 1 

Test 5

Subtask: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
2 1 1 1 

Test 6

Subtask: 1

Verdict:

input
1111110110

correct output
3
1 1 1 

user output
1 1 1 

Test 7

Subtask: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
1 2 1 

Test 8

Subtask: 1

Verdict:

input
0111111000

correct output
2
1 1 

user output
1 1 

Test 9

Subtask: 1

Verdict:

input
1111111100

correct output
2
1 1 

user output
1 1 

Test 10

Subtask: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
1 1 1 1 

Test 11

Subtask: 1

Verdict:

input
1101110000

correct output
3
1 1 1 

user output
1 1 1 

Test 12

Subtask: 1

Verdict:

input
1101101100

correct output
4
1 2 1 1 

user output
1 1 1 1 1 

Test 13

Subtask: 1

Verdict:

input
0100111110

correct output
3
1 1 1 

user output
1 1 1 

Test 14

Subtask: 1

Verdict:

input
1101001011

correct output
4
2 2 2 1 

user output
1 1 1 1 1 

Test 15

Subtask: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
1 2 1 1 

Test 16

Subtask: 1

Verdict:

input
0011011100

correct output
3
3 2 1 

user output
1 1 1 1 

Test 17

Subtask: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Subtask: 1

Verdict:

input
1101100111

correct output
3
2 2 1 

user output
1 1 1 1 

Test 19

Subtask: 1

Verdict:

input
0110000100

correct output
3
2 1 1 

user output
2 1 1 

Test 20

Subtask: 1

Verdict: ACCEPTED

input
0000101000

correct output
QAQ

user output
QAQ

Test 21

Subtask: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

Test 22

Subtask: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
2 1 1 

Test 23

Subtask: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
1 1 1 1 

Test 24

Subtask: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
1 1 

Test 25

Subtask: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
2 1 

Test 26

Subtask: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
2 1 1 1 

Test 27

Subtask: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
1 2 1 

Test 28

Subtask: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
2 1 1 

Test 29

Subtask: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
3 2 1 

Test 30

Subtask: 2

Verdict:

input
0001011011

correct output
4
1 1 1 1 

user output
1 1 1 1 

Test 31

Subtask: 2

Verdict:

input
0010110011

correct output
4
1 1 1 1 

user output
1 1 1 1 

Test 32

Subtask: 2

Verdict:

input
0011100000

correct output
2
2 1 

user output
1 1 1 

Test 33

Subtask: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
1 1 1 1 

Test 34

Subtask: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
1 2 1 1 

Test 35

Subtask: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
1 2 1 1 

Test 36

Subtask: 2

Verdict:

input
110011001100110011001010101010...

correct output
QAQ

user output
(empty)

Test 37

Subtask: 2

Verdict:

input
110011001100110011001100101010...

correct output
QAQ

user output
(empty)

Test 38

Subtask: 2

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 39

Subtask: 2

Verdict:

input
010101010101010101010101010101...

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

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

Test 40

Subtask: 2

Verdict:

input
011010000011111011110000110011...

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

user output
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 41

Subtask: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Subtask: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
1 1 2 1 

Test 43

Subtask: 3

Verdict:

input
0100110110

correct output
4
2 1 1 1 

user output
1 1 2 1 

Test 44

Subtask: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
2 1 

Test 45

Subtask: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
2 2 1 

Test 46

Subtask: 3

Verdict:

input
0011100011

correct output
3
1 2 1 

user output
1 1 1 1 

Test 47

Subtask: 3

Verdict:

input
0100111100

correct output
3
1 1 1 

user output
1 1 1 

Test 48

Subtask: 3

Verdict:

input
0001001000

correct output
3
2 2 1 

user output
1 1 1 1 

Test 49

Subtask: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
1 2 1 1 

Test 50

Subtask: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
2 1 1 1 

Test 51

Subtask: 3

Verdict:

input
1000111011

correct output
3
2 1 1 

user output
2 1 1 

Test 52

Subtask: 3

Verdict:

input
1000111111

correct output
2
1 1 

user output
1 1 

Test 53

Subtask: 3

Verdict:

input
0110011100

correct output
3
2 1 1 

user output
1 1 1 1 

Test 54

Subtask: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
2 2 1 

Test 55

Subtask: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
1 2 1 1 

Test 56

Subtask: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 27, in <module>
    output = recursiveBitGame(inputList)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recurs...

Test 57

Subtask: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 27, in <module>
    output = recursiveBitGame(inputList)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recurs...

Test 58

Subtask: 3

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 27, in <module>
    output = recursiveBitGame(inputList)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recurs...

Test 59

Subtask: 3

Verdict:

input
010101010101010101010101010101...

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 27, in <module>
    output = recursiveBitGame(inputList)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recurs...

Test 60

Subtask: 3

Verdict:

input
011100011001011111111000010110...

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 27, in <module>
    output = recursiveBitGame(inputList)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recursiveBitGame
    recOut = recursiveBitGame(newInput)
  File "input/code.py", line 12, in recurs...

Test 61

Subtask: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Subtask: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
2 1 1 1 

Test 63

Subtask: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
2 2 1 

Test 64

Subtask: 4

Verdict:

input
1001110001

correct output
3
2 1 1 

user output
1 2 1 

Test 65

Subtask: 4

Verdict:

input
1000000011

correct output
2
1 1 

user output
1 1 

Test 66

Subtask: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
1 1 1 1 

Test 67

Subtask: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
2 1 1 1 

Test 68

Subtask: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
1 1 1 1 

Test 69

Subtask: 4

Verdict:

input
0011111000

correct output
2
2 1 

user output
1 1 1 

Test 70

Subtask: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
2 2 2 1 

Test 71

Subtask: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
1 1 1 1 

Test 72

Subtask: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
1 2 1 1 

Test 73

Subtask: 4

Verdict:

input
1110011111

correct output
2
2 1 

user output
1 1 1 

Test 74

Subtask: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
2 1 1 1 

Test 75

Subtask: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
1 2 1 1 

Test 76

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Subtask: 4

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 79

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

Subtask: 4

Verdict:

input
111000110000011000001101010010...

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

user output
(empty)