oj.uz

Submission #396546

# Submission time Handle Problem Language Result Execution time Memory
396546 2021-04-30T09:19:49 Z IloveN Rice Hub (IOI11_ricehub) C++14
100 / 100
 18 ms 2636 KB 
#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
const int N = 1e6 + 10;

ll ps[N];

ll cost(int len, int n, int X[])
{
    ll res = 1e18;
    for (int l = 1; l <= n - len + 1; ++l)
    {
        int r = l + len - 1;
        int mid = (l + r) / 2;
        ll C = (ll)X[mid - 1] * (mid - l + 1) - ps[mid] + ps[l - 1] + ps[r] - ps[mid] - (ll)X[mid - 1] * (r - mid);
        res = min(res, C);
    }
    return res;
}

int besthub(int n, int L, int X[], ll B)
{
    for (int i = 1; i <= n; ++i) ps[i] = ps[i - 1] + X[i - 1];
    int l = 1, r = n, ans = 1;
    while (l <= r)
    {
        int mid = (l + r) / 2;
        if (cost(mid, n, X) <= B) ans = mid, l = mid + 1;
        else r = mid - 1;
    }
    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 260 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 304 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 208 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 288 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 300 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 308 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 332 KB Output is correct
4 Correct 1 ms 332 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 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 332 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 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 320 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 316 KB Output is correct
28 Correct 2 ms 320 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 572 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 18 ms 2636 KB Output is correct
4 Correct 17 ms 2508 KB Output is correct
5 Correct 10 ms 1216 KB Output is correct
6 Correct 10 ms 1228 KB Output is correct
7 Correct 14 ms 2252 KB Output is correct
8 Correct 15 ms 2164 KB Output is correct
9 Correct 9 ms 1052 KB Output is correct
10 Correct 9 ms 1100 KB Output is correct
11 Correct 17 ms 2460 KB Output is correct
12 Correct 17 ms 2512 KB Output is correct
13 Correct 12 ms 1228 KB Output is correct
14 Correct 11 ms 1256 KB Output is correct
15 Correct 13 ms 1892 KB Output is correct
16 Correct 13 ms 1964 KB Output is correct
17 Correct 16 ms 2244 KB Output is correct
18 Correct 15 ms 2252 KB Output is correct
19 Correct 16 ms 2300 KB Output is correct
20 Correct 16 ms 2380 KB Output is correct