Envío 7207
Problema 0xd6 - Camino más corto de la Tortuga en un arreglo circular
- Autor: JhoanO
- Fecha: 2023-11-23 00:21:39 UTC (Hace alrededor de 1 año)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.009 s | 3 KBi |
| #2 |
Correcto
|
0.012 s | 3 KBi |
| #3 |
Correcto
|
0.01 s | 3 KBi |
| #4 |
Correcto
|
0.011 s | 3 KBi |
| #5 |
Correcto
|
0.015 s | 3 KBi |
| #6 |
Correcto
|
0.013 s | 3 KBi |
| #7 |
Correcto
|
0.012 s | 3 KBi |
| #8 |
Correcto
|
0.012 s | 3 KBi |
| #9 |
Correcto
|
0.009 s | 3 KBi |
| #10 |
Correcto
|
0.009 s | 3 KBi |
| #11 |
Correcto
|
0.012 s | 3 KBi |
| #12 |
Correcto
|
0.01 s | 3 KBi |
| #13 |
Correcto
|
0.008 s | 3 KBi |
| #14 |
Correcto
|
0.009 s | 3 KBi |
| #15 |
Correcto
|
0.009 s | 3 KBi |
| #16 |
Correcto
|
0.011 s | 3 KBi |
| #17 |
Correcto
|
0.013 s | 3 KBi |
| #18 |
Correcto
|
0.012 s | 3 KBi |
| #19 |
Correcto
|
0.012 s | 3 KBi |
| #20 |
Correcto
|
0.012 s | 3 KBi |
| #21 |
Correcto
|
0.012 s | 3 KBi |
| #22 |
Correcto
|
0.013 s | 3 KBi |
| #23 |
Correcto
|
0.012 s | 3 KBi |
| #24 |
Correcto
|
0.009 s | 3 KBi |
| #25 |
Correcto
|
0.012 s | 3 KBi |
| #26 |
Correcto
|
0.012 s | 3 KBi |
| #27 |
Correcto
|
0.013 s | 3 KBi |
| #28 |
Correcto
|
0.013 s | 3 KBi |
| #29 |
Correcto
|
0.01 s | 3 KBi |
| #30 |
Correcto
|
0.011 s | 3 KBi |
| #31 |
Correcto
|
0.013 s | 3 KBi |
| #32 |
Correcto
|
0.009 s | 3 KBi |
| #33 |
Correcto
|
0.011 s | 3 KBi |
| #34 |
Correcto
|
0.013 s | 3 KBi |
| #35 |
Correcto
|
0.012 s | 3 KBi |
| #36 |
Correcto
|
0.013 s | 3 KBi |
Puntos totales: 100 / 100
Código
#N number of cells in array
#x box where the turttle is located
#y box to be reached
n, x, y = input().split(" ")
n = int(n)
x = int(x)
y = int(y)
def minMovements(n, x, y):
clockWise = (y - x + n) % n
leftward = (x - y + n) % n
minMovements = min(clockWise,leftward)
return minMovements
print(minMovements(n,x,y))