| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 411325 |
2021-05-25T04:19:09 Z |
jeqcho |
Rice Hub (IOI11_ricehub) |
C++17 |
|
1000 ms |
832 KB |
//#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpi;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define fi first
// subtask 1,2
int besthub(int R, int L, int X[], ll B){
int mx=0;
FOR(x,1,L+1)
{
vi cost;
F0R(i,R)
{
cost.pb(abs(X[i]-x));
}
sort(all(cost));
ll cur=0;
int cand=0;
F0R(i,R)
{
if(cur+(ll)cost[i]>B)break;
cur+=(ll)cost[i];
++cand;
}
mx=max(mx,cand);
}
return mx;
}
| # |
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 |
300 KB |
Output is correct |
| 4 |
Correct |
1 ms |
304 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 |
300 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
3 ms |
256 KB |
Output is correct |
| 6 |
Correct |
2 ms |
204 KB |
Output is correct |
| 7 |
Correct |
3 ms |
304 KB |
Output is correct |
| 8 |
Correct |
3 ms |
304 KB |
Output is correct |
| 9 |
Correct |
1 ms |
300 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 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 |
3 ms |
304 KB |
Output is correct |
| 16 |
Correct |
3 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 |
3 ms |
204 KB |
Output is correct |
| 20 |
Correct |
3 ms |
204 KB |
Output is correct |
| 21 |
Correct |
8 ms |
304 KB |
Output is correct |
| 22 |
Correct |
9 ms |
204 KB |
Output is correct |
| 23 |
Correct |
109 ms |
304 KB |
Output is correct |
| 24 |
Correct |
109 ms |
284 KB |
Output is correct |
| 25 |
Correct |
116 ms |
304 KB |
Output is correct |
| 26 |
Correct |
108 ms |
308 KB |
Output is correct |
| 27 |
Correct |
89 ms |
304 KB |
Output is correct |
| 28 |
Correct |
90 ms |
308 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
304 KB |
Output is correct |
| 2 |
Correct |
27 ms |
300 KB |
Output is correct |
| 3 |
Execution timed out |
1075 ms |
304 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1082 ms |
832 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
