Etäisyydet

def main():
    t = int(input())
    finalresult = ""
    for useless in range(t):
        n = int(input())
        vieruslistafor = []
        for i in range(n+1):
            vieruslistafor.append([])
        for i in range(n-1):
            syöte = input().split(" ")
            vieruslistafor[int(syöte[0])].append(int(syöte[1]))
            vieruslistafor[int(syöte[1])].append(int(syöte[0]))
 
        # aloita jostain päästä
        for i in range(200):
            if len(vieruslistafor[i+1]) == 1:
                curpos = i+1
                break
 
        movesleft = 3
        pathfromintersection = [curpos] #index0 : intersec
        usednodes = []
        result = ""
 
        while True:
            if len(vieruslistafor[curpos]) == 1:
                if not (curpos in usednodes):
                    result += str(curpos) + " "
                    movesleft = 3
                    usednodes.append(curpos)
                lastpos = curpos
                curpos = vieruslistafor[curpos][0]
                movesleft -= 1
                vieruslistafor[curpos].remove(lastpos)
                pathfromintersection.pop()
                if len(pathfromintersection) == 0:
                    pathfromintersection.append(curpos)
            elif len(vieruslistafor[curpos]) == 0:
                result += str(curpos) + " "
                break
            else:
                if movesleft == 0:
                    result += str(curpos) + " "
                    movesleft = 3
                    usednodes.append(curpos)
 
                for i in range(100):
                    if not (vieruslistafor[curpos][i] in pathfromintersection):
                         curpos = vieruslistafor[curpos][i]
                         break
                movesleft -= 1
                pathfromintersection.append(curpos)
 
 
 
 
 
        finalresult += result[:-1] + "\n"
    print(finalresult[:-1])
 
main()

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED