# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003210 | 2024-06-20T07:50:24 Z | HasanV11010238 | Rice Hub (IOI11_ricehub) | C++17 | 1000 ms | 604 KB |
#include "ricehub.h" #include <bits/stdc++.h> #define ll long long #define INF 1000000000000 using namespace std; vector<ll> pr, x; int besthub(int R, int L, int X[], long long B) { pr.assign(R + 1, 0), x.assign(R + 1, 0); for (int i = 1; i <= R; i++){ x[i] = X[i - 1]; pr[i] = pr[i - 1] + x[i]; } ll ans = 0; for (int i = 1; i <= L; i++){ ll co = 0, dist = INF; int in; for (int j = 1; j <= R; j++){ if (abs(x[j] - i) < dist){ in = j; dist = abs(x[j] - i); } } ll l = in, r = in + 1; while (true){ ll col, cor; if (l <= 1){ col = INF; } else{ col = i - x[l - 1]; } if (r >= R){ cor = INF; } else{ cor = x[r + 1] - i; } if (co + min(col, cor) > B){ break; } else if (col < cor){ l--; } else{ r++; } } ans = max(ans, r - l + 1); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1068 ms | 604 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |