# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233122 | 2020-05-19T11:55:09 Z | crossing0ver | Rice Hub (IOI11_ricehub) | C++17 | 8 ms | 512 KB |
#include<bits/stdc++.h> #include "ricehub.h" using namespace std; int besthub(int n, int L, int X[], long long B){ long long sum = 0; int num = 0; int last = 0; vector<long long> PR(n); int ans = 0,ps = 0; for (int i = 0 ; i < n; i++) { sum += X[i]; PR[i] = sum; num++; while (true) { long long e = sum/num; int pos = lower_bound(X + last, X + i+1, e) - X; long long D = 0; long long s = X[pos]*(pos - last + 1) - (PR[pos] - (last ? PR[last-1] : 0)) + (PR[i] - PR[pos]) -X[pos]*( i - pos); if (s <= B) if (ans < i - last + 1) ans = i - last + 1, ps = X[pos]; D = s; pos = upper_bound(X + last, X + i+1, e) - X - 1; if (pos <= i && pos >= last) { s =X[pos]*(pos - last + 1) - (PR[pos] - (last ? PR[last-1] : 0)) + (PR[i] - PR[pos]) -X[pos]*( i - pos); D = min(D,s); if (s <= B) if (ans < i - last + 1) ans = i - last + 1, ps = X[pos]; } if (D > B) { sum-=X[last]; last++; num--; continue; } else break; } } return ans; } /* main() { int n,L; long long B; cin >> n >> L >> B; int X[n]; for (int i = 0; i < n ; i++) cin >> X[i]; << besthub(n,L,X,B); } ) */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |