oj.uz

Submission #481895

# Submission time Handle Problem Language Result Execution time Memory
481895 2021-10-22T07:29:48 Z uHyHn Rice Hub (IOI11_ricehub) C++14
0 / 100
 6 ms 844 KB 
#include<bits/stdc++.h>

//IBOW
#define Task "IOI11_RICEHUB"
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define eb emplace_back

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;

const int N = 2e5 + 10;
const int inf = 2e9 + 10;
const ll INF = 2e18 + 10;
const int MOD = 1e9 + 7;

bool ok(int va, int n, int l, int x[], ll B, int pre[])
{
    ll mn = INF;
    for (int i = va; i <= n; ++i)
    {
        int rr = i;
        int ll = i - va + 1;
        int median = (rr + ll) / 2;
        for (int j = median - 1; j <= median + 1; ++j)
        {
            mn = min(mn, x[j] * 1LL * (j - ll + 1) - (pre[j] - pre[ll - 1]) + (pre[rr] - pre[j]) - x[j] * 1LL * (rr - j));
        }
    }
    return mn <= B;
}
int besthub(int n, int l, int x[], ll B)
{
    int pre[100010] = {};
    for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + x[i];
    int L = 1, R = n, ans = -1;
    while (L <= R)
    {
        int mid = (L + R) / 2;
        if (ok(mid, n, l, x, B, pre))
            L = mid + 1, ans = mid;
        else R = mid - 1;
    }
    return ans;
//    return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 844 KB Output isn't correct
2 Halted 0 ms 0 KB -