Envío 7069
Problema 0xd6 - Camino más corto de la Tortuga en un arreglo circular
- Autor: ilogico22@hotmail.com
- Fecha: 2023-08-10 15:42:20 UTC (Hace más de 1 año)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.016 s | 3 KBi |
| #2 |
Correcto
|
0.018 s | 3 KBi |
| #3 |
Correcto
|
0.016 s | 3 KBi |
| #4 |
Correcto
|
0.019 s | 3 KBi |
| #5 |
Correcto
|
0.021 s | 3 KBi |
| #6 |
Correcto
|
0.016 s | 3 KBi |
| #7 |
Correcto
|
0.021 s | 3 KBi |
| #8 |
Correcto
|
0.014 s | 3 KBi |
| #9 |
Correcto
|
0.019 s | 3 KBi |
| #10 |
Correcto
|
0.017 s | 3 KBi |
| #11 |
Correcto
|
0.021 s | 6 KBi |
| #12 |
Correcto
|
0.018 s | 3 KBi |
| #13 |
Correcto
|
0.02 s | 3 KBi |
| #14 |
Correcto
|
0.017 s | 3 KBi |
| #15 |
Correcto
|
0.015 s | 3 KBi |
| #16 |
Correcto
|
0.017 s | 3 KBi |
| #17 |
Correcto
|
0.015 s | 3 KBi |
| #18 |
Correcto
|
0.014 s | 3 KBi |
| #19 |
Correcto
|
0.017 s | 3 KBi |
| #20 |
Correcto
|
0.02 s | 3 KBi |
| #21 |
Correcto
|
0.016 s | 3 KBi |
| #22 |
Correcto
|
0.019 s | 3 KBi |
| #23 |
Correcto
|
0.016 s | 3 KBi |
| #24 |
Correcto
|
0.014 s | 3 KBi |
| #25 |
Correcto
|
0.02 s | 3 KBi |
| #26 |
Correcto
|
0.015 s | 3 KBi |
| #27 |
Correcto
|
0.017 s | 3 KBi |
| #28 |
Correcto
|
0.014 s | 3 KBi |
| #29 |
Correcto
|
0.018 s | 3 KBi |
| #30 |
Correcto
|
0.015 s | 3 KBi |
| #31 |
Correcto
|
0.022 s | 3 KBi |
| #32 |
Correcto
|
0.018 s | 3 KBi |
| #33 |
Correcto
|
0.015 s | 3 KBi |
| #34 |
Correcto
|
0.015 s | 3 KBi |
| #35 |
Correcto
|
0.023 s | 3 KBi |
| #36 |
Correcto
|
0.019 s | 3 KBi |
Puntos totales: 100 / 100
Código
elementsArray = [int(item) for item in input().split()] n = elementsArray[0] x = elementsArray[1] y = elementsArray[2] difference = abs(x - y) steps = min(difference, n - difference) print(steps)