Envío 7218
Problema 0xd6 - Camino más corto de la Tortuga en un arreglo circular
- Autor: diezgo1008
- Fecha: 2024-02-06 01:12:10 UTC (Hace 10 meses)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.016 s | 3 KBi |
| #2 |
Correcto
|
0.01 s | 3 KBi |
| #3 |
Correcto
|
0.007 s | 3 KBi |
| #4 |
Correcto
|
0.008 s | 3 KBi |
| #5 |
Correcto
|
0.011 s | 3 KBi |
| #6 |
Correcto
|
0.013 s | 3 KBi |
| #7 |
Correcto
|
0.011 s | 3 KBi |
| #8 |
Correcto
|
0.012 s | 3 KBi |
| #9 |
Correcto
|
0.009 s | 3 KBi |
| #10 |
Correcto
|
0.013 s | 3 KBi |
| #11 |
Correcto
|
0.009 s | 3 KBi |
| #12 |
Correcto
|
0.012 s | 3 KBi |
| #13 |
Correcto
|
0.008 s | 3 KBi |
| #14 |
Correcto
|
0.007 s | 3 KBi |
| #15 |
Correcto
|
0.008 s | 3 KBi |
| #16 |
Correcto
|
0.011 s | 3 KBi |
| #17 |
Correcto
|
0.013 s | 3 KBi |
| #18 |
Correcto
|
0.009 s | 3 KBi |
| #19 |
Correcto
|
0.013 s | 3 KBi |
| #20 |
Correcto
|
0.008 s | 3 KBi |
| #21 |
Correcto
|
0.012 s | 3 KBi |
| #22 |
Correcto
|
0.013 s | 3 KBi |
| #23 |
Correcto
|
0.013 s | 3 KBi |
| #24 |
Correcto
|
0.013 s | 3 KBi |
| #25 |
Correcto
|
0.011 s | 3 KBi |
| #26 |
Correcto
|
0.01 s | 3 KBi |
| #27 |
Correcto
|
0.008 s | 3 KBi |
| #28 |
Correcto
|
0.011 s | 3 KBi |
| #29 |
Correcto
|
0.013 s | 3 KBi |
| #30 |
Correcto
|
0.014 s | 3 KBi |
| #31 |
Correcto
|
0.009 s | 3 KBi |
| #32 |
Correcto
|
0.011 s | 3 KBi |
| #33 |
Correcto
|
0.008 s | 3 KBi |
| #34 |
Correcto
|
0.01 s | 3 KBi |
| #35 |
Correcto
|
0.015 s | 3 KBi |
| #36 |
Correcto
|
0.012 s | 3 KBi |
Puntos totales: 100 / 100
Código
def min_movimientos_tortuga(N, X, Y):
clockwise_distance = (Y - X + N) % N
counterclockwise_distance = (X - Y + N) % N
return min(clockwise_distance, counterclockwise_distance)
# Leer la entrada
N, X, Y = map(int, input().split())
# Calcular y mostrar el resultado
result = min_movimientos_tortuga(N, X, Y)
print(result)