Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.133 s | 25 KBi |
#2 |
Incorrecto
|
0.106 s | 16 KBi |
#3 |
Incorrecto
|
0.163 s | 34 KBi |
#4 |
Incorrecto
|
0.121 s | 45 KBi |
#5 |
Incorrecto
|
0.149 s | 14 KBi |
#6 |
Incorrecto
|
0.192 s | 28 KBi |
#7 |
Incorrecto
|
0.128 s | 17 KBi |
#8 |
Incorrecto
|
0.805 s | 45 KBi |
#9 |
Tiempo límite excedido
|
1.137 s | 125 KBi |
#10 |
Error en tiempo de ejecución (NZEC)
Exited with error status 137 run: line 1: 3 Killed /usr/local/openjdk13/bin/java Main |
0.945 s | 125 KBi |
#11 |
Tiempo límite excedido
|
1.233 s | 93 KBi |
#12 |
Tiempo límite excedido
|
1.151 s | 75 KBi |
#13 |
Tiempo límite excedido
|
1.047 s | 72 KBi |
#14 |
Tiempo límite excedido
|
1.158 s | 80 KBi |
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = scanner.nextInt(); } //O(n) int[] s = new int[n]; int sum = 0; for (int i = 0; i < n; i++) { sum += a[i]; s[i] = sum; } System.out.println(Arrays.toString(s)); int c = scanner.nextInt(); for (int k = 0; k < c; k++) { int p = scanner.nextInt(); int q = scanner.nextInt(); solve(a, s, p, q); } } private static void solve(int[] a, int[] s, int p, int q) { int sum = 0; sum = s[q]; if (p - 1 >= 0) { sum -= s[p - 1]; } System.out.println(sum); } }