Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.026 s | 3 KBi |
#2 |
Correcto
|
0.021 s | 3 KBi |
#3 |
Correcto
|
0.024 s | 3 KBi |
#4 |
Correcto
|
0.021 s | 3 KBi |
#5 |
Correcto
|
0.027 s | 4 KBi |
#6 |
Correcto
|
0.023 s | 3 KBi |
#7 |
Correcto
|
0.025 s | 3 KBi |
#8 |
Correcto
|
0.066 s | 5 KBi |
#9 |
Correcto
|
0.28 s | 15 KBi |
#10 |
Correcto
|
0.241 s | 15 KBi |
#11 |
Correcto
|
0.277 s | 15 KBi |
#12 |
Correcto
|
0.252 s | 15 KBi |
#13 |
Correcto
|
0.281 s | 16 KBi |
#14 |
Correcto
|
0.284 s | 16 KBi |
n = int(input()) numbers = list(map(int, input().split())) assert(n == len(numbers)) c = int(input()) queries = [list(map(int, input().split())) for i in range(c)] accumulated_sum = [] sum = 0 for number in numbers: sum += number accumulated_sum.append(sum) def sub_array_sum(p, q): assert(p <= q) assert(q <= len(accumulated_sum)) if p == 0: return (accumulated_sum[q]) return(accumulated_sum[q] - accumulated_sum[p - 1]) for query in queries: p, q = query print(sub_array_sum(p, q))