Envío 6276
Problema 0xd6 - Camino más corto de la Tortuga en un arreglo circular
- Autor: Felipe
- Fecha: 2022-05-28 18:09:51 UTC (Hace casi 2 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.013 s | 3 KBi |
| #2 |
Correcto
|
0.011 s | 3 KBi |
| #3 |
Correcto
|
0.017 s | 3 KBi |
| #4 |
Correcto
|
0.011 s | 3 KBi |
| #5 |
Correcto
|
0.011 s | 3 KBi |
| #6 |
Correcto
|
0.021 s | 3 KBi |
| #7 |
Correcto
|
0.011 s | 3 KBi |
| #8 |
Correcto
|
0.018 s | 3 KBi |
| #9 |
Correcto
|
0.01 s | 3 KBi |
| #10 |
Correcto
|
0.021 s | 3 KBi |
| #11 |
Correcto
|
0.011 s | 3 KBi |
| #12 |
Correcto
|
0.01 s | 3 KBi |
| #13 |
Correcto
|
0.01 s | 3 KBi |
| #14 |
Correcto
|
0.011 s | 3 KBi |
| #15 |
Correcto
|
0.026 s | 3 KBi |
| #16 |
Correcto
|
0.011 s | 3 KBi |
| #17 |
Correcto
|
0.028 s | 3 KBi |
| #18 |
Correcto
|
0.01 s | 3 KBi |
| #19 |
Correcto
|
0.01 s | 3 KBi |
| #20 |
Correcto
|
0.01 s | 3 KBi |
| #21 |
Correcto
|
0.012 s | 3 KBi |
| #22 |
Correcto
|
0.01 s | 3 KBi |
| #23 |
Correcto
|
0.023 s | 3 KBi |
| #24 |
Correcto
|
0.011 s | 3 KBi |
| #25 |
Correcto
|
0.015 s | 3 KBi |
| #26 |
Correcto
|
0.01 s | 3 KBi |
| #27 |
Correcto
|
0.013 s | 3 KBi |
| #28 |
Correcto
|
0.018 s | 3 KBi |
| #29 |
Correcto
|
0.01 s | 3 KBi |
| #30 |
Correcto
|
0.011 s | 3 KBi |
| #31 |
Correcto
|
0.01 s | 3 KBi |
| #32 |
Correcto
|
0.021 s | 3 KBi |
| #33 |
Correcto
|
0.011 s | 3 KBi |
| #34 |
Correcto
|
0.011 s | 3 KBi |
| #35 |
Correcto
|
0.01 s | 3 KBi |
| #36 |
Correcto
|
0.011 s | 3 KBi |
Puntos totales: 100 / 100
Código
n, x, y = map(lambda x: int(x), input().split(" "))
closest = min( abs(x - (y+n)), abs(y - (x+n)))
print(min(abs(y-x),closest))