oj.uz

Submission #482818

# Submission time Handle Problem Language Result Execution time Memory
482818 2021-10-26T13:02:09 Z jalsol Rice Hub (IOI11_ricehub) C++17
68 / 100
 1000 ms 460 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];
int option[maxn];

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

    int ans = 0;

    For (p, 1, n) {
        For (i, 1, n) {
            option[i] = abs(a[i] - a[p]);
        }
        sort(option + 1, option + n + 1);

        ll cost = budget;
        int cnt = 0;

        For (i, 1, n) {
            if (cost < option[i]) break;

            cost -= option[i];
            ++cnt;
        }

        chmax(ans, cnt);
    }

    return ans;
}
// wait this could still get TLE...
// and I'm not even sure if this will be correct...
// iirc this IOI was offline

Subtask #1
17.0 / 17.0

# 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 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 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 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 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 5 ms 332 KB Output is correct
24 Correct 5 ms 332 KB Output is correct
25 Correct 4 ms 336 KB Output is correct
26 Correct 5 ms 336 KB Output is correct
27 Correct 5 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 16 ms 332 KB Output is correct
4 Correct 15 ms 344 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 10 ms 332 KB Output is correct
8 Correct 10 ms 332 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 324 KB Output is correct
11 Correct 12 ms 332 KB Output is correct
12 Correct 12 ms 348 KB Output is correct
13 Correct 19 ms 332 KB Output is correct
14 Correct 19 ms 356 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 12 ms 344 KB Output is correct
18 Correct 11 ms 332 KB Output is correct
19 Correct 20 ms 332 KB Output is correct
20 Correct 19 ms 332 KB Output is correct
21 Correct 293 ms 332 KB Output is correct
22 Correct 291 ms 392 KB Output is correct
23 Correct 648 ms 412 KB Output is correct
24 Correct 665 ms 332 KB Output is correct
25 Correct 617 ms 412 KB Output is correct
26 Correct 600 ms 404 KB Output is correct
27 Correct 593 ms 456 KB Output is correct
28 Correct 545 ms 452 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 460 KB Time limit exceeded
2 Halted 0 ms 0 KB -