oj.uz

Submission #592704

# Submission time Handle Problem Language Result Execution time Memory
592704 2022-07-09T13:37:43 Z Mahtimursu Rice Hub (IOI11_ricehub) C++17
25 / 100
 1000 ms 2884 KB 
#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int besthub(int R, int L, int X[], long long B) {
    vector<ll> lft;
    vector<ll> rgt;

    int best = 0;

    int n = R;

    for (int i = n - 1; i > 0; --i) {
        rgt.push_back(X[i]);
    }

    for (int i = 0; i < n; ++i) {
        ll leftm = B;
        int cur = 1;

        int li = lft.size() - 1;
        int ri = 0;

        while (true) {
            ll leftd = li >= 0 ? abs(lft[li] - X[i]) : 1e18;
            ll rightd = ri < (int)rgt.size() ? abs(rgt[ri] - X[i]) : 1e18;

            if (min(leftd, rightd) > leftm) break;

            cur++;

            if (leftd < rightd) {
                leftm -= leftd;
                li--;
            } else {
                leftm -= rightd;
                ri++;
            }
        }

        best = max(best, cur);

        lft.push_back(X[i]);
        rgt.pop_back();
    }

    return best;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 312 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 1 ms 212 KB Output is correct
13 Correct 1 ms 308 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 284 KB Output is correct
17 Correct 1 ms 284 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 2 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 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Incorrect 1 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1020 KB Output is correct
2 Correct 7 ms 1020 KB Output is correct
3 Execution timed out 1081 ms 2884 KB Time limit exceeded
4 Halted 0 ms 0 KB -