Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.019 s | 64 KBi |
#2 |
Correcto
|
0.004 s | 63 KBi |
#3 |
Correcto
|
0.004 s | 63 KBi |
#4 |
Correcto
|
0.003 s | 0 KBi |
#5 |
Correcto
|
0.004 s | 3 KBi |
#6 |
Correcto
|
0.004 s | 2 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.06 s | 0 KBi |
#9 |
Tiempo límite excedido
|
1.068 s | 2 KBi |
#10 |
Tiempo límite excedido
|
1.042 s | 2 KBi |
#11 |
Tiempo límite excedido
|
1.065 s | 2 KBi |
#12 |
Tiempo límite excedido
|
1.047 s | 2 KBi |
#13 |
Tiempo límite excedido
|
1.031 s | 2 KBi |
#14 |
Tiempo límite excedido
|
1.057 s | 2 KBi |
#include <iostream> #include <vector> using namespace std; void solve(vector<int> totals, int start, int end) { int sum = totals[end]; if (start > 0) { sum -= totals[start - 1]; } cout << sum << "\n"; } int main(int argc, char const *argv[]) { int n, sum = 0, start, end; cin >> n; vector<int> data(n); vector<int> totals(n); /*get data of array */ for (size_t i = 0; i < n; i++) { cin >> data[i]; sum += data[i]; totals[i] = sum; } /* get n subarrays */ cin >> n; for (size_t i = 0; i < n; i++) { /* get subarray index start, end*/ cin >> start >> end; solve(totals, start, end); } return (EXIT_SUCCESS); }