implementation *1500

Please click on ads to support us..

Python Code:

def getEnd(i):
    while nodes[i][1] != 0: i = nodes[i][1]-1
    return i

n = int(input())
nodes = [list(map(int, input().split())) for _ in range(n)]
starts = [i for i in range(n) if nodes[i][0] == 0]
ends = [getEnd(i) for i in starts]

for i in range(len(starts)-1):
    nodes[ends[i]][1] = starts[i+1]+1
    nodes[starts[i+1]][0] = ends[i]+1
    
for row in nodes: print(*row)


Comments

Submit
0 Comments
More Questions

1424G - Years
1663A - Who Tested
1073B - Vasya and Books
195B - After Training
455A - Boredom
1099A - Snowball
1651D - Nearest Excluded Points
599A - Patrick and Shopping
237A - Free Cash
1615B - And It's Non-Zero
1619E - MEX and Increments
34B - Sale
1436A - Reorder
1363C - Game On Leaves
1373C - Pluses and Minuses
1173B - Nauuo and Chess
318B - Strings of Power
1625A - Ancient Civilization
864A - Fair Game
1663B - Mike's Sequence
448A - Rewards
1622A - Construct a Rectangle
1620A - Equal or Not Equal
1517A - Sum of 2050
620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two