Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 2 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.528 s | 1 KBi |
#9 |
Tiempo límite excedido
|
1.051 s | 2 KBi |
#10 |
Tiempo límite excedido
|
1.079 s | 2 KBi |
#11 |
Tiempo límite excedido
|
1.028 s | 2 KBi |
#12 |
Tiempo límite excedido
|
1.055 s | 1 KBi |
#13 |
Correcto
|
0.032 s | 2 KBi |
#14 |
Tiempo límite excedido
|
1.063 s | 2 KBi |
#include <stdio.h> #include <stdlib.h> #include <stdbool.h> int main() { int size; scanf("%d", &size); int *array; array = malloc(size * sizeof(int)); for (int i = 0; i < size; i++) { scanf("%d", &array[i]); } int sizeQuery; scanf("%d", &sizeQuery); int sum = 0; bool query = false; int num_query = 0; for (int i = 0; i <= size; i++) { int p, q; if (i < sizeQuery && query == false) { scanf("%d %d", &p, &q); i = p; query = true; num_query++; } if (i <= q && query == true) sum += array[i]; if (i == q) { printf("%d\n", sum); i = 0; query = false; sum = 0; } if (num_query == sizeQuery && query == false) break; } return 0; }