370A - Rook Bishop and King - CodeForces Solution


graphs math shortest paths *1100

Please click on ads to support us..

Python Code:

r1, c1, r2, c2 = [int(x) for x in input().split()]

king = max(abs(r2-r1), abs(c2-c1))

rook = 0
if (r2 == r1 or c2 == c1):
    rook = 1
else:
    rook = 2

bishop = 0
if ((r1+c1)%2 != (r2+c2)%2):
    bisohp = 0
elif (r1+c1) == (r2+c2):
    bishop = 1
elif (r2-r1) == -(c2-c1):
    bishop = 1
elif (r2-r1) == (c2-c1):
    bishop = 1
else:
    bishop = 2

print(rook, bishop, king)
  	  	  	 											 	  				 	


Comments

Submit
0 Comments
More Questions

129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem