# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003381 | vjudge1 | Rice Hub (IOI11_ricehub) | C++17 | 1014 ms | 2008 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "ricehub.h"
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define f first
#define s second
#define pb push_back
#define p_b pop_back
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
ll n = R, i;
ll h[n+5], pref[n+5];
pref[0] = 0;
for(i = 1; i <= n; i++)
h[i] = X[i-1];
h[0] = X[0];
for(i = 1; i <= n; i++)
pref[i] = pref[i-1] + h[i];
ll res = 0;
for(i = 1; i <= n; i++)
{
vector<pll>vect;
ll minn = LLONG_MAX, maxx = LLONG_MIN;
for(ll j = 1; j <= n; j++)
vect.pb({abs(h[i] - h[j]), j});
ll sum = 0;
//cout << "i: " << i << "\n";
for(ll j = 0; j < vect.size(); j++)
{
//cout << vect[j].f << ' ' << vect[j].s << "\n";
if(sum + vect[j].f <= B)
{
sum += vect[j].f;
minn = min(minn, vect[j].s);
maxx = max(maxx, vect[j].s);
}
}
res = max(res, maxx - minn + 1);
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |