Visualization Notes: 05/20/23

Saturday, May 20, 2023

📑 Farewell Round A 2023 Task 3 Rainbow Sort

Farewell Round A 2023. Task 3

Python Only


# Competition Variant 1 (All Points)
T=int(input())
for t in range(T):
    N=int(input())
    cards=input().split()
    cards_set=set()
    result=[]
    for i in range(N):
        if cards[i] not in cards_set:
            cards_set.update([cards[i]])
            result.append(cards[i])
        elif result[-1]!=cards[i]:
            result='IMPOSSIBLE'
            break
 #       print(i,result)
    if result!='IMPOSSIBLE': result=' '.join(result)
    print('Case #{}: {}'.format((t+1),result))

xxxxxxxxxx
 
@interact
def rainbow_sort(
    T=selector([1,2],default=1,label='$\\mathbb{T}$'),
    NL=input_box('4 5',type=str,label='$\\mathbb{N}$',width=10),
    CL=input_box('3 8 8 2\n3 8 2 2 8',type=str,
                 label='$\\mathbb{cards}$',width=10,height=3)):
    N=int(str(NL).split()[T-1])
    cards=(str(CL).split('\n')[T-1]).split()
    pretty_print([T,N,cards])
    cards_set=set()
    result=[]
    for i in range(N):
        if cards[i] not in cards_set:
            cards_set.update([cards[i]])
            result.append(cards[i])
        elif result[-1]!=cards[i]:
            result='IMPOSSIBLE'
            break
    if result!='IMPOSSIBLE': result=' '.join(result)
    pretty_print('Case #{}: {}'.format(T,result))