Envío 1472
Problema 0xf2 - Partir un arreglo grande en 2
- Autor: Serivt
- Fecha: 2020-10-28 01:49:36 UTC (Hace más de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.02 s | 3 KBi |
| #2 |
Correcto
|
0.022 s | 3 KBi |
| #3 |
Correcto
|
0.02 s | 3 KBi |
| #4 |
Correcto
|
0.021 s | 3 KBi |
| #5 |
Correcto
|
0.022 s | 3 KBi |
| #6 |
Correcto
|
0.021 s | 3 KBi |
| #7 |
Correcto
|
0.02 s | 3 KBi |
| #8 |
Incorrecto
|
0.023 s | 3 KBi |
| #9 |
Correcto
|
0.025 s | 3 KBi |
| #10 |
Correcto
|
0.024 s | 3 KBi |
| #11 |
Correcto
|
0.024 s | 3 KBi |
| #12 |
Correcto
|
0.024 s | 3 KBi |
| #13 |
Correcto
|
0.022 s | 3 KBi |
| #14 |
Correcto
|
0.186 s | 32 KBi |
| #15 |
Correcto
|
0.272 s | 27 KBi |
| #16 |
Correcto
|
0.258 s | 29 KBi |
| #17 |
Correcto
|
0.245 s | 29 KBi |
| #18 |
Correcto
|
0.138 s | 29 KBi |
| #19 |
Correcto
|
0.196 s | 29 KBi |
| #20 |
Correcto
|
0.276 s | 58 KBi |
Puntos totales: 95 / 100
Código
import itertools
n = int(input())
arr = list(map(int, input().split(" ")))
acum = list(itertools.accumulate(arr))
total = acum[n - 1]
middle = None
for i in range(0, n):
right = acum[i] if i != 0 else 0
if acum[i] > 0 and total - acum[i] <= 0:
middle = i + 1
break
print(middle or "Impossible")