제출 #164576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
164576		itiam	Zamjena (COCI18_zamjena)	Cpython 3	14 / 70	1077 ms	4968 KiB

zamjena

def provjera(L1,L2):
    A,B=[],[]
    for i in range(len(L1)):
        if L1[i]!=L2[i]:
            A.append(L1[i])
            B.append(L2[i])
    return A,B
        
def main():
    N=int(input())
    L=input().split()
    L2=input().split()
    #print('L:',L,'L2:',L2)
    L,L2=provjera(L,L2)
    #print('NAKON    L:',L,'L2:',L2)
    while L!=[]:
        for i in range(len(L)):
            if L[i].isdigit() and L2[i].isdigit():
                print("NE")
                return
            elif (L[i].isdigit() is not True) and L2[i].isdigit():
                for j in range(len(L)):
                    if L[j]==L[i]:  L[j]=L2[i]
                    if L2[j]==L[i]:  L2[j]=L2[i]
            elif (L2[i].isdigit() is not True) and L[i].isdigit():
                for j in range(len(L)):
                    if L[j]==L2[i]:  L[j]=L[i]
                    if L2[j]==L2[i]:  L2[j]=L[i]
            elif (L[i].isdigit() is not True) and (L2[i].isdigit() is not True):
                for j in range(len(L)):
                    if L[j]==L2[i]:  L[j]=L[i]
                    if L2[j]==L2[i]:  L2[j]=L[i]
        L,L2=provjera(L,L2)
    print("DA")
    return

main()

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14