CSES - Putka Open 2015 – 1/6

CSES - Putka Open 2015 – 1/6 - Results

Submission details
Task:	Aita
Sender:
Submission time:	2015-07-20 01:05:38 +0300
Language:	Python2
Status:	READY
Result:	17

Feedback
group	verdict	score
#1	ACCEPTED	17
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.09 s	1	details
#2	ACCEPTED	0.07 s	1	details
#3	ACCEPTED	0.08 s	1	details
#4	ACCEPTED	0.09 s	1	details
#5	ACCEPTED	0.08 s	1	details
#6	TIME LIMIT EXCEEDED	--	2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	TIME LIMIT EXCEEDED	--	2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	ACCEPTED	0.08 s	2	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details

Code

# Algoritmi on vaan vaarin ajateltu, ei auta mikaan ;)
# taysin uusi yritys 2, aika loppuuu..i..

a, b = [int(x) for x in raw_input().split(" ")]     

def aita(n, k, left):
    QAQ=False
    lista = []
    for i in range(n,0,-1):
        lista.append(int(i))
    
    puu_lista = []
    puu_lista.append(int(lista[0]))
    lista.remove(lista[0])
    
    pituus=len(lista)
    puulistan_pituus=1
    #left = False
    goboth=False
    last_number_left = n
    last_number_right = n
    try_other_side=False
    while(lista):
        
        found=False
        notfound=False
        ko=int(k)
        if left==True:
            
            while found==False and notfound==False:
                if ko>pituus:
                    QAQ=True
                    notfound=True
                
                
                if int(last_number_left-ko) in lista:
                    found=True
                    last_number_left=lista[lista.index(last_number_left-ko)]
                    lista.remove(last_number_left)
                    puu_lista.append(last_number_left)
                    
                    QAQ=False
                    try_other_side=False
                    
                elif int(last_number_left+ko) in lista:
                    found=True
                    last_number_left=lista[lista.index(last_number_left+ko)]
                    lista.remove(last_number_left)
                    puu_lista.append(last_number_left)
                    
                    QAQ=False
                    try_other_side=False
                    
                ko=ko+1
                
                
                
                
                    
                        
        else:
            while found==False and notfound==False:
                
                if int(last_number_right-ko) in lista:
                    found=True
                    last_number_right=lista[lista.index(last_number_right-ko)]
                    lista.remove(last_number_right)
                    puu_lista.insert(0,last_number_right)
                    
                    QAQ=False
                    try_other_side=False
                    
                elif int(last_number_right+ko) in lista:
                    found=True
                    last_number_right=lista[lista.index(last_number_right+ko)]
                    
                    lista.remove(last_number_right)
                    puu_lista.insert(0,last_number_right)
                    
                    QAQ=False
                    try_other_side=False
                    
                
                
                if ko>pituus:
                    QAQ=True
                    notfound=True
                    
                    
                ko=ko+1
                
                
        left=not left #negate
        
        if QAQ == True and try_other_side == False:
            try_other_side=True
            
        elif QAQ == True and try_other_side == True:
            # no solution
            break
        
    if QAQ==True:
        print "QAQ"
    else:
        str_lista = "";
        for item in puu_lista:
            str_lista = str_lista + str(item) + " "
       
        print str_lista
    
aita(a, b, False)

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`2 2` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`3 2` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`4 2` view save

correct output
`3 1 4 2` view save

user output
`2 4 1 3` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`7 4` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`8 4` view save

correct output
`5 1 6 2 7 3 8 4` view save

user output
`4 8 3 7 2 6 1 5` view save

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`80476 2` view save

correct output
`40239 1 40240 2 40241 3 40242 ...` view save

user output
(empty)

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`68652 2` view save

correct output
`34327 1 34328 2 34329 3 34330 ...` view save

user output
(empty)

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`62735 2` view save

correct output
`31368 1 31369 2 31370 3 31371 ...` view save

user output
(empty)

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`71954 2` view save

correct output
`35978 1 35979 2 35980 3 35981 ...` view save

user output
(empty)

Test 10

Group: 2

Verdict: ACCEPTED

input
`4 2` view save

correct output
`3 1 4 2` view save

user output
`2 4 1 3` view save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`89814 3` view save

correct output
`44908 1 44909 2 44910 3 44911 ...` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`91140 5` view save

correct output
`45571 1 45572 2 45573 3 45574 ...` view save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`66703 16675` view save

correct output
`33352 1 33353 2 33354 3 33355 ...` view save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`66666 33333` view save

correct output
`33334 1 33335 2 33336 3 33337 ...` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`66666 33334` view save

correct output
`QAQ` view save

user output
(empty)

Putka Open 2015 – 1/6

Aita

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions ()