| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 460396 |
2021-08-09T06:22:13 Z |
Khizri |
Rice Hub (IOI11_ricehub) |
C++17 |
|
1000 ms |
800 KB |
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
int besthub(int n, int l, int arr[], long long k)
{
ll ans=0;
for(int i=0;i<l;i++){
vector<int>vt;
for(int j=0;j<n;j++){
vt.pb(abs(arr[j]-i));
}
sort(all(vt));
ll x=k,q=0;
for(int j=0;j<n;j++){
if(x>=vt[j]){
x-=vt[j];
q=j+1;
}
else{
break;
}
}
ans=max(ans,q);
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
216 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
2 ms |
204 KB |
Output is correct |
| 6 |
Correct |
2 ms |
204 KB |
Output is correct |
| 7 |
Correct |
2 ms |
308 KB |
Output is correct |
| 8 |
Correct |
2 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
300 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
2 ms |
204 KB |
Output is correct |
| 16 |
Correct |
2 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
2 ms |
204 KB |
Output is correct |
| 20 |
Correct |
3 ms |
204 KB |
Output is correct |
| 21 |
Correct |
7 ms |
204 KB |
Output is correct |
| 22 |
Correct |
7 ms |
204 KB |
Output is correct |
| 23 |
Correct |
109 ms |
204 KB |
Output is correct |
| 24 |
Correct |
110 ms |
300 KB |
Output is correct |
| 25 |
Correct |
109 ms |
288 KB |
Output is correct |
| 26 |
Correct |
105 ms |
288 KB |
Output is correct |
| 27 |
Correct |
89 ms |
304 KB |
Output is correct |
| 28 |
Correct |
92 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
204 KB |
Output is correct |
| 2 |
Correct |
27 ms |
204 KB |
Output is correct |
| 3 |
Execution timed out |
1092 ms |
204 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1088 ms |
800 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
