📑 Trouble Sort

Codejam Qualification Round 2018. Task 2

Python Only

def trouble_sort(L,N):
    LE,LO=[],[]
    for i in range(N):
        (LO,LE)[i%2==0].append(L[i])
    LE=sorted(LE)
    LO=sorted(LO)
    L=sorted(L)
    for i in range(N):
        if i%2==0:
            el=LE[i//2]
        else:
            el=LO[i//2]
        if el!=L[i]:
            break
    if N-1!=i:
        return str(i)
    else: 
        return 'OK'
T=int(input())
for t in range(T):
    N=int(input())
    L=list(map(int,input().split()))
    ANS=trouble_sort(L,N)
    print('Case #{}: {}'.format(t+1,ANS))

xxxxxxxxxx

 

1

def tsort(L,N):

2

    LE,LO=[],[]

3

    for i in range(N):

4

        (LO,LE)[i%2==0].append(L[i])

5

    for l in [LE,LO,L]:

6

        l.sort()

7

    for i in range(N):

8

        if i%2==0:

9

            el=LE[i//2]

10

        else:

11

            el=LO[i//2]

12

        if el!=L[i]:

13

            break

14

    if N-1!=i:

15

        return str(i)

16

    else: 

17

        return 'OK'

18

@interact

19

def trouble_sort(

20

    T=selector([1,2,3],default=1,label='$\\mathbb{T}$'),

21

    N=input_box('5|3|8',type=str,label='$\\mathbb{N}$',width=25),

22

    L=input_box('5 6 8 4 3|8 9 7|5 3 4 8 9 2 1 6',

23

                type=str,label='$\\mathbb{L}$',width=25)):

24

    N=int(str(N).split('|')[T-1])

25

    L=str(L).split('|')[T-1]

26

    L=list(map(int,L.split()))

27

    ANS=tsort(L,N)

28

    print('Case #{}: {}'.format(T,ANS))

Language: Sage Gap GP HTML Macaulay2 Maxima Octave Python R Singular

---

Messages