Submission #28847

# Submission time Handle Problem Language Result Execution time Memory
28847 2017-07-17T10:39:52 Z kavun Rice Hub (IOI11_ricehub) C++14
0 / 100
1000 ms 5924 KB
#include "ricehub.h"
#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;
typedef long long ll;

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++)
        {
            int median = (2*i+res-1) / res;
            ll cost = 0;
            for(int j = i; j < i+res; j++)
            {
                cost += abs(X[j] - X[median]);
            }
            if(cost <= B)
                return res;
        }
    }
  return 1;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5924 KB Output is correct
2 Incorrect 0 ms 5924 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5924 KB Output is correct
2 Correct 0 ms 5924 KB Output is correct
3 Correct 0 ms 5924 KB Output is correct
4 Incorrect 0 ms 5924 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5924 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 5924 KB Execution timed out
2 Halted 0 ms 0 KB -