Visualization Notes: April 2023

Saturday, April 29, 2023

📑 Farewell Round A 2023 Task 2 Illumination Optimization

Farewell Round A 2023. Task 2

Python Only


def update(i,start,end,radius,condition,answer):
    while (i < N):
        if X[i]-start > radius: break
        else: end=X[i]
        i+=1
    if end!=condition: 
        answer+=[end]
        start=end
    else:
        answer=[]
    return i,start,end,answer
T=int(input())
for t in range(T):
    [M,R,N]=list(map(int,input().split()))
    X=list(map(int,input().split()))
    i,start,end,answer=0,0,-1,[]
    i,start,end,answer=update(i,start,end,R,-1,answer)
    while ((i < N) and (answer!=[]) and (end+R < M)):
        i,start,end,answer=update(i,start,end,2*R,start,answer)
    if M-end > R: answer=[]
    if answer!=[]:
        print('Case #{}: {}'.format((t+1),len(answer)))
    else: 
        print('Case #{}: IMPOSSIBLE'.format(t+1))

xxxxxxxxxx
 
@interact
def illumination_optimization(
    T=selector([1,2,3],default=1,label='$\\mathbb{T}$'),
    MRN=input_box('10 3 3\n10 2 3\n10 2 4',type=str,
                  label='$\\mathbb{MRN}$',width=10,height=3),
    XL=input_box('2 7 9\n2 7 9\n2 3 7 9',type=str,
                 label='$\\mathbb{XL}$',width=10,height=3)):
    [M,R,N]=list(map(int,(str(MRN).split('\n')[T-1]).split()))
    X=list(map(int,(str(XL).split('\n')[T-1]).split()))
    pretty_print([T,M,R,N,X])
    
    def update(i,start,end,radius,condition,answer,N=N,X=X):
        while (i < N):
            if X[i]-start > radius: break
            else: end=X[i]
            i+=1
        if end!=condition: 
            answer+=[end]
            start=end
        else:
            answer=[]
        return i,start,end,answer   
    
    i,start,end,answer=0,0,-1,[]
    i,start,end,answer=update(i,start,end,R,-1,answer)
    while ((i < N) and (answer!=[]) and (end+R < M)):
        i,start,end,answer=update(i,start,end,2*R,start,answer)
    if M-end > R: answer=[]
    if answer!=[]:
        pretty_print('Case #{}: {}'.format((T),len(answer)))
    else: 
        pretty_print('Case #{}: IMPOSSIBLE'.format(T))

📑 Farewell Round A 2023 Task 1 Colliding Encoding

Farewell Round A 2023. Task 1

Python Only


T=int(input())
letters='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for t in range(T):
    D=input().replace(' ','')
    N=int(input())
    numbers=set()
    words=set()
    for i in range(N):
        w=input()
        words.update([w])
        n=''.join([D[letters.find(s)] for s in w])
        numbers.update([n])
    if len(numbers) < len(words):
        print('Case #{}: YES'.format(t+1))
    else:
        print('Case #{}: NO'.format(t+1))

xxxxxxxxxx
 
@interact
def colliding_encoding(
    T=selector([1,2],default=1,label='$\\mathbb{T}$'),
    D=input_box('0 1 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n'+\
                '0 1 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3',
                type=str,label='$\\mathbb{D}$',width=50,height=3),
    N=input_box('4|3',type=str,label='$\\mathbb{N}$',width=50),
    W=input_box('ABC BC BCD CDE|CDE DEF EFG',
                type=str,label='$\\mathbb{W}$',width=50)):
    letters='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
    numbers=set(); words=set()
    DS=str(D).split('\n')[T-1]
    DS=DS.replace(' ','')
    N=int(str(N).split('|')[T-1])
    WS=(str(W).split('|')[T-1]).split()
    pretty_print([T,DS,N,WS])
    for i in range(N):
        w=WS[i]
        words.update([w])
        n=''.join([DS[letters.find(s)] for s in w])
        numbers.update([n])
    if len(numbers) < len(words):
        pretty_print('Case #{}: YES'.format(T))
    else:
        pretty_print('Case #{}: NO'.format(T))