Submission #482828

# Submission time Handle Problem Language Result Execution time Memory
482828 2021-10-26T13:25:06 Z jalsol Rice Hub (IOI11_ricehub) C++17
100 / 100
15 ms 2892 KB
#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 1e5 + 5;

#include "ricehub.h"

int n, len;
ll budget;
int a[maxn];
ll pref[maxn];

// fuck me
ll check(int L, int R) {
    int M = (L + R) / 2;

    ll left = 1LL * a[M] * (M - L) - (pref[M - 1] - pref[L - 1]);
    ll right = (pref[R] - pref[M]) - 1LL * a[M] * (R - M);

    return left + right;
}

int besthub(int _R, int _L, int _X[], ll _B) {
// globalization
    n = _R; len = _L; budget = _B;
    For (i, 1, n) a[i] = _X[i - 1];
// end of globalization

    For (i, 1, n) {
        pref[i] = pref[i - 1] + a[i];
    }

    int ans = 0;
    int R = 1;

    For (L, 1, n) {
        while (R < n && check(L, R + 1) <= budget) {
            ++R;
        }

        chmax(ans, R - L + 1);
    }

    assert(ans != -1);
    return ans;
}
// wait this could still get TLE...
// and I'm not even sure if this will be correct...
// iirc this IOI was offline

// bro wtf lmaooooooo
// it worked
// but many people in the actual contest got this correct as well...

// maybe sliding window?
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 12 ms 1868 KB Output is correct
4 Correct 15 ms 1868 KB Output is correct
5 Correct 6 ms 1356 KB Output is correct
6 Correct 9 ms 1356 KB Output is correct
7 Correct 10 ms 2584 KB Output is correct
8 Correct 12 ms 2636 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 6 ms 1356 KB Output is correct
11 Correct 14 ms 2892 KB Output is correct
12 Correct 13 ms 2876 KB Output is correct
13 Correct 6 ms 1484 KB Output is correct
14 Correct 7 ms 1492 KB Output is correct
15 Correct 10 ms 2252 KB Output is correct
16 Correct 14 ms 2252 KB Output is correct
17 Correct 14 ms 2672 KB Output is correct
18 Correct 11 ms 2612 KB Output is correct
19 Correct 14 ms 2764 KB Output is correct
20 Correct 14 ms 2820 KB Output is correct