oj.uz

Submission #394430

# Submission time Handle Problem Language Result Execution time Memory
394430 2021-04-26T15:43:55 Z vishesh312 Rice Hub (IOI11_ricehub) C++17
100 / 100
 29 ms 3364 KB 
#include "bits/stdc++.h"
#include "ricehub.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

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

using ll = long long;
const int mod = 1e9+7;

ll cost(ll st, ll ed, vector<ll> &v, vector<ll> &pre) {
    ll mid = (st + ed) / 2;
    ll ret = (mid - st) * v[mid] - (pre[mid] - pre[st]) + (pre[ed+1] - pre[mid+1]) - (ed - mid) * v[mid];
    return ret;
}

int besthub(int r, int l, int x[], ll b) {
    vector<ll> v(x, x+r);
    vector<ll> pre(r+1);
    for (int i = 0; i < r; ++i) pre[i+1] = pre[i] + v[i];
    int ans = 0;
    for (int st = 0; st < r; ++st) {
        int lo = st, hi = r;
        while (lo < hi) {
            int mid = (lo + hi) / 2;
            ll cur = cost(st, mid, v, pre);
            if (cur <= b) {
                ans = max(ans, mid - st + 1);
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }
    }
    return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 588 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 23 ms 2276 KB Output is correct
4 Correct 25 ms 3364 KB Output is correct
5 Correct 11 ms 1500 KB Output is correct
6 Correct 11 ms 1612 KB Output is correct
7 Correct 23 ms 3020 KB Output is correct
8 Correct 22 ms 2984 KB Output is correct
9 Correct 15 ms 1584 KB Output is correct
10 Correct 11 ms 1468 KB Output is correct
11 Correct 24 ms 3228 KB Output is correct
12 Correct 29 ms 3308 KB Output is correct
13 Correct 11 ms 1604 KB Output is correct
14 Correct 11 ms 1600 KB Output is correct
15 Correct 18 ms 2568 KB Output is correct
16 Correct 18 ms 2544 KB Output is correct
17 Correct 22 ms 2956 KB Output is correct
18 Correct 22 ms 2944 KB Output is correct
19 Correct 25 ms 3132 KB Output is correct
20 Correct 23 ms 3148 KB Output is correct