oj.uz

Submission #661217

# Submission time Handle Problem Language Result Execution time Memory
661217 2022-11-25T00:10:00 Z benjaminkleyn Rice Hub (IOI11_ricehub) C++17
17 / 100
 66 ms 2256 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
typedef long long ll;

ll pref[100001], x[100000];

ll sum(int l, int r)
{
    return pref[r + 1] - pref[l];
}

ll cost(int l, int r, int i)
{
    return sum(i + 1, r) + x[i] * (2 * i - l - r) - sum(l, i - 1);
}

ll find_min(int l, int r)
{
    int lo = l, hi = r, mid;
    while (lo < hi)
    {
        mid = (lo + hi) / 2;
        if (cost(l, r, mid + 1) < cost(l, r, mid))
            lo = mid + 1;
        else
            hi = mid;
    }
    for (int i = lo + 1; i <= hi; i++)
        if (cost(l, r, i) < cost(l, r, lo))
            lo = i;
    return cost(l, r, lo);
}

ll calc(int R, int X[], int cnt)
{
    ll mn = LLONG_MAX;
    for (int l = 0, r = cnt - 1; r < R; l++, r++)
        mn = min(mn, find_min(l, r));
    return mn;
}

int besthub(int R, int L, int X[], ll B) 
{
    for (int i = 0; i < R; i++)
        x[i] = X[i], pref[i + 1] = pref[i] + X[i];

    int lo = 0, hi = R;
    while (lo < hi)
    {
        int mid = (lo + hi + 1) / 2;

        if (calc(R, X, mid) <= B)
            lo = mid;
        else hi = mid - 1;
    }

    return lo;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 1 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 596 KB Output is correct
2 Correct 19 ms 704 KB Output is correct
3 Correct 31 ms 2132 KB Output is correct
4 Correct 33 ms 2236 KB Output is correct
5 Correct 66 ms 1356 KB Output is correct
6 Correct 60 ms 1252 KB Output is correct
7 Correct 25 ms 2256 KB Output is correct
8 Incorrect 46 ms 2132 KB Output isn't correct
9 Halted 0 ms 0 KB -