# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
880438 | 2023-11-29T12:31:57 Z | andro | Rice Hub (IOI11_ricehub) | C++14 | 1000 ms | 600 KB |
#include <bits/stdc++.h> #include "ricehub.h" //#define int long long using namespace std; int besthub(int R, int L, int X[], long long B){ int ans=0; for(int i=1;i<=R;i++){ //od desno kolko ih ima u [X[i],X[i]+mid] // od levo [X[i]-mid,X[i]] int l=0,r=1e15+1,p=-1; while(l<=r){ int mid=(l+r)/2; int c=0; for(int j=1;j<=R;j++){ if(abs(X[i]-X[j])<=mid)c+=abs(X[i]-X[j]); } if(c<=B){ l=mid+1; p=mid; } else { r=mid-1; } } int u=0; for(int j=1;j<=R;j++){ if(abs(X[i]-X[j])<=p)u++; } ans=max(ans,u); } return ans; }/* signed main(){ int X[4]={0,10,12,14}; cout<<besthub(3,14,X,6); }*/ /* 1 3 2 3 3 3 3 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Execution timed out | 1033 ms | 348 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Execution timed out | 1038 ms | 344 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1025 ms | 600 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |