# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28859 | kavun | Rice Hub (IOI11_ricehub) | C++14 | 1000 ms | 104080 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 "ricehub.h"
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
typedef long long ll;
int dp[5010][5010];
int pr(int i, int j, int X[])
{
if(dp[i][j])
return dp[i][j];
if(i == j)
return 0;
if(j == i+1)
return X[j] - X[i];
int median = i + (j-i)/2;
dp[i][j] = pr(i+1,j-1,X) - X[i] + X[j];
return dp[i][j];
}
int besthub(int R, int L, int X[], long long B)
{
for(int res = R; res > 0; res--)
{
for(int i = 0; i <= R - res; i++)
{
ll cost = pr(i,i+res-1,X);
if(cost <= B)
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... |