# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
468598 | 2021-08-29T00:19:34 Z | Maurimuri80 | Rice Hub (IOI11_ricehub) | C++14 | 1000 ms | 588 KB |
#include <cmath> #include <vector> using namespace std; int besthub(int R, int L, int X[], long long B) { vector<long long> ac(R + 1); ac[0] = 0; for (int i = 1; i < ac.size(); i++){ ac[i] = ac[i-1] + X[i-1]; } int min,max,med; min = 1; max = R; while (true) { if (min == max) { return min; } med = (min+max)/2; //hallamos la mitad de los posible y no posible bool possible = false; for (int i = 0; i <= R - med; i++) { int izq = i; int der = i + med - 1; int mid = (izq + der) / 2; long long aux =(mid - izq); long long aux2 = (der - mid); long long rm = X[mid]; long long sum = ((aux - aux2) * rm) - (ac[mid] - ac[izq]) + (ac[der + 1] - ac[mid + 1]); if (sum <= B) { possible = true; break; } } if (possible == true) { min = med; }else{ max = med-1; } } return 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Execution timed out | 1085 ms | 204 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 216 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Execution timed out | 1088 ms | 204 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1079 ms | 204 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1079 ms | 588 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |