# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
614872 | 2022-07-31T05:17:50 Z | Shithila | Rice Hub (IOI11_ricehub) | C++14 | 1000 ms | 340 KB |
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { int dis[R]; int pos=0; long long max=0; for(int i=0;i<L;i++) { for(int j=0;j<R;j++) { dis[j]=abs(i-X[j]); } sort(dis,dis+R); long long sum=0; int j=0; while(sum<=B && j<R) { sum=sum+dis[j]; j++; } j--; if(pos<j) { pos=j; } //cout<<i<<" "<<j<<endl; } return pos; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Incorrect | 1 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 212 KB | Output is correct |
2 | Correct | 20 ms | 304 KB | Output is correct |
3 | Execution timed out | 1086 ms | 212 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1068 ms | 340 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |