CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:Ilari
Submission time:2015-10-11 21:52:32 +0300
Language:Python3
Status:READY
Result:66
Feedback
groupverdictscore
#1ACCEPTED11
#2ACCEPTED27
#3ACCEPTED28
#40
Test results
testverdicttimegroup
#1ACCEPTED0.09 s1details
#2ACCEPTED0.07 s1details
#3ACCEPTED0.08 s1details
#4ACCEPTED0.08 s1details
#5ACCEPTED0.09 s1details
#6ACCEPTED0.09 s1details
#7ACCEPTED0.09 s1details
#8ACCEPTED0.09 s1details
#9ACCEPTED0.08 s1details
#10ACCEPTED0.09 s1details
#11ACCEPTED0.09 s1details
#12ACCEPTED0.08 s1details
#13ACCEPTED0.09 s1details
#14ACCEPTED0.08 s1details
#15ACCEPTED0.08 s1details
#16ACCEPTED0.10 s1details
#17ACCEPTED0.09 s1details
#18ACCEPTED0.08 s1details
#19ACCEPTED0.09 s1details
#20ACCEPTED0.09 s1details
#21ACCEPTED0.09 s2details
#22ACCEPTED0.09 s2details
#23ACCEPTED0.08 s2details
#24ACCEPTED0.08 s2details
#25ACCEPTED0.09 s2details
#26ACCEPTED0.09 s2details
#27ACCEPTED0.10 s2details
#28ACCEPTED0.09 s2details
#29ACCEPTED0.09 s2details
#30ACCEPTED0.09 s2details
#31ACCEPTED0.08 s2details
#32ACCEPTED0.08 s2details
#33ACCEPTED0.11 s2details
#34ACCEPTED0.08 s2details
#35ACCEPTED0.08 s2details
#36ACCEPTED0.09 s2details
#37ACCEPTED0.09 s2details
#38ACCEPTED0.08 s2details
#39ACCEPTED0.08 s2details
#40ACCEPTED0.10 s2details
#41ACCEPTED0.09 s3details
#42ACCEPTED0.09 s3details
#43ACCEPTED0.10 s3details
#44ACCEPTED0.09 s3details
#45ACCEPTED0.08 s3details
#46ACCEPTED0.09 s3details
#47ACCEPTED0.10 s3details
#48ACCEPTED0.09 s3details
#49ACCEPTED0.08 s3details
#50ACCEPTED0.08 s3details
#51ACCEPTED0.09 s3details
#52ACCEPTED0.09 s3details
#53ACCEPTED0.08 s3details
#54ACCEPTED0.09 s3details
#55ACCEPTED0.09 s3details
#56ACCEPTED0.46 s3details
#57ACCEPTED0.40 s3details
#58ACCEPTED0.23 s3details
#59ACCEPTED0.51 s3details
#60ACCEPTED0.20 s3details
#61ACCEPTED0.09 s4details
#62ACCEPTED0.09 s4details
#63ACCEPTED0.08 s4details
#64ACCEPTED0.09 s4details
#65ACCEPTED0.09 s4details
#66ACCEPTED0.09 s4details
#67ACCEPTED0.08 s4details
#68ACCEPTED0.09 s4details
#69ACCEPTED0.09 s4details
#70ACCEPTED0.08 s4details
#71ACCEPTED0.08 s4details
#72ACCEPTED0.10 s4details
#73ACCEPTED0.08 s4details
#74ACCEPTED0.09 s4details
#75ACCEPTED0.09 s4details
#760.11 s4details
#770.11 s4details
#780.10 s4details
#790.11 s4details
#800.10 s4details

Code

#!/usr/bin/python3
a=input()
#print(a)
import sys
#a=sys.argv[1]
sys.setrecursionlimit(1000000)
#a='10010110110110100101010101010100110'
#a='1000011011'
def parse(a):
	h=['0']
	for i in range(1,len(a)):
		if a[i]==a[i-1]:
			if h[-1]=='0':
				h[-1]='1'
		else:
			h.append('0')
	#h=''.join(map(str,h))
	return h

a=parse(a)

def remove(a,n):
	#print(a)
	#print(n)
	if a.count('1')==0:
		if a==[]:
			return
		#raise ValueError('A very specific bad thing happened')
		print('QAQ')
		exit()
	#print(n)
	#print(a)
	index=0
	k=0
	for i in range(0,len(a)):
		if a[i]=='1':
			k+=1
			#print('k:'+str(k))
			if k==n:
				index=i
				break
	if index==0 or index==len(a)-1:
		a.pop(index)
		return
	a[index-1]='1'
	a.pop(index)
	a.pop(index)


def recurse(a,history):
	for i in range(1,a.count('1')):
		#print(a)
		a2=list(a)
		remove(a2,i)
		#print(count2)
		history2=list(history)
		#print(i)
		history2.append(i)
		if a2 == []:
			#print(len(history2))
			#print(' '.join(map(str,history2)))
			#print('OK')
			exit()
		else:
			recurse(a2,history2)

def checkPair(a, history):
	#return
	if len(a) % 2 == 1 and a[len(a)//2]=='1':
		while len(a)>1:
			middle=len(a)//2
			middle=a[:middle].count('1')+1
			remove(a,middle)
			history.append(middle)
		remove(a,1)
		history.append(1)	
		print(len(history))
		print(' '.join(map(str,history)))
		#print('OK')
		exit()
	
def solve(a,history):
	if len(a)>2:
		checkPair(a,history)
	#print('looking for 000')
	while 1:
		if len(a)>2:
			checkPair(a,history)
		h=''.join(a).find('000')
		if not h<1:
			h=a[:h].count('1')
			remove(a,h)
			history.append(h)
		elif h==0:
			remove(a,1)
			history.append(1)
		else:
			break
	#checkPair(a,history)
	#print('looking for 00')
	if len(a)>2:
		checkPair(a,history)
	while 1:
		if len(a)>2:
			checkPair(a,history)
		h=''.join(a).find('00')
		if not h==-1:
			h=a[:h].count('1')+1
			if h==0:
				h=1
			elif h>a.count('1'):
				h=a.count('1')
			if h==a.count('1'):
				if a[-1]=='1':
					h-=1
			remove(a,h)
			history.append(h)
		else:
			break
	#print('looking for 010')
	if len(a)>2:
		checkPair(a,history)
	while 1:
		if len(a)>2:
			checkPair(a,history)
		h=''.join(a).find('010')
		if not h==-1:
			h=a[:h].count('1')+1
			remove(a,h)
			history.append(h)
		else:
			if h==0:
				remove(a,1)
				history.append(1)
			break
	#print('looking for 10')
	if len(a)>2:
		checkPair(a,history)
	while 1:
		if len(a)>2:
			checkPair(a,history)
		h=''.join(a).find('10')
		if not h==-1 and not h==0:
			h=a[:h].count('1')+1
			remove(a,h)
			history.append(h)
		else:
			if h==0:
				remove(a,2)
				history.append(2)
			else:
				break
	if len(a)>2:
		checkPair(a,history)
	#print('looking for 01')
	while 1:
		h=''.join(a).find('01')
		if len(a)>2:
			checkPair(a,history)
		if not h==-1 and not h==a.count('1'):
			h=a[:h].count('1')+1
			remove(a,h)
			history.append(h)
		else:
			if h==a.count(1):
				remove(a,h-1)
				history.append(h-1)
			else:
				break

	#print('looking for 1')
	if len(a)>2:
		checkPair(a,history)
	while 1:
		remove(a,1)
		history.append(1)
		if a==[]:
			break
	#recurse(a,history)

	return a, history

def solve2(a, history):
	#print(a)
	while len(a)%2==0:
		if not a[:3]==['1','1','0']:
			remove(a,1)
			history.append(1)
		else:
			if not a[-3:]==['0','1','1']:
				remove(a,a.count('1'))
				history.append(a.count('1'))
			else:
				raise ValueError('A very specific bad thing happened')
				return solve(a,history)
	while 1:
		#print(a)
		checkPair(a,history)
		if not a[len(a)//2]=='1':
			ah=a[:len(a)//2].count('1')
			if ah==1 and a[0]=='1' and not a.count('1')==1:
				ah=2				
			if ah<1 and not a.count('1')==0:
				ah=1
			remove(a,ah)
			history.append(ah)
		if a.count('1')==1:
			remove(a,1)
			history.append(1)
		elif a.count('1')==0 and len(a)>0:
			print('QAQ')
			exit()
		if a.count('1')==len(a):
			history+=[1]*len(a)
			print(len(history))
			print(' '.join(map(str,history)))
			exit()
	
		

#a,history=solve(a,[])
if len(a)<20:
	a,history=solve(a,[])
elif len(a)>5000:
	print(QAQ)
	exit()
else:
	a, history=solve2(a,[])

print(len(history))
print(' '.join(map(str,history)))
#print('OK')

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
5
2 1 1 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
3 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
1 2 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
31
1 19 18 17 16 15 14 13 12 11 1...

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
23
12 11 12 12 11 11 11 10 9 9 9 ...

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
2 1 1 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
4
1 1 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
1501
1 999 998 997 996 995 994 993 ...

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

input
011100011001011111111000010110...

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

user output
1272
1 1 647 647 646 646 645 645 64...

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

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 225, in <module>
    print(QAQ)
NameError: name 'QAQ' is not defined

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 225, in <module>
    print(QAQ)
NameError: name 'QAQ' is not defined

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 225, in <module>
    print(QAQ)
NameError: name 'QAQ' is not defined

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)

Error:
Traceback (most recent call last):
  File "input/code.py", line 225, in <module>
    print(QAQ)
NameError: name 'QAQ' is not defined

Test 80

Group: 4

Verdict:

input
111000110000011000001101010010...

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 225, in <module>
    print(QAQ)
NameError: name 'QAQ' is not defined