oj.uz

Submission #975082

# Submission time Handle Problem Language Result Execution time Memory
975082 2024-05-04T11:45:37 Z yoav_s Rainforest Jumps (APIO21_jumps) C++17
8 / 100
 4000 ms 12524 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef pair<ll, ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()

const ll INF = 1e18;
const ll mod = 1e9 + 7;

#include "jumps.h"

v H;
ll N;
v nextHigher;
v prevHigher;
v st;
ll n;

ll query(ll l, ll r)
{
    l += n;
    r += n;
    ll res = -INF;
    while (l <= r)
    {
        if (l % 2 == 1)
        {
            res = max(res, st[l]);
            l++;
        }
        if (r % 2 == 0)
        {
            res = max(res,st[r]);
            r--;
        }
        l /= 2;
        r /= 2;
    }
    return res;
}

void init(int Nn, std::vector<int> Hh) {
    H = v();
    for (auto x : Hh) H.pb(x);
    N = Nn;
    nextHigher = v(N, N);
    stack<p> mon;
    for (ll i = N - 1; i >= 0; i--)
    {
        while (!mon.empty() && mon.top().s <= H[i]) mon.pop();
        if (!mon.empty()) nextHigher[i] = mon.top().f;
        mon.emplace(i, H[i]);
    }
    mon = stack<p>();
    prevHigher = v(N, -1);
    for (ll i = 0; i < N; i++)
    {
        while (!mon.empty() && mon.top().s <= H[i]) mon.pop();
        if (!mon.empty()) prevHigher[i] = mon.top().f;
        mon.emplace(i, H[i]);
    }
    n = pow(2, ceil(log2(N)));
    st = v(2 * n, -INF);
    for (ll i = 0; i < N; i++) st[n + i] = H[i];
    for (ll i = n - 1;  i> 0; i--) st[i] = max(st[2 * i], st[2 * i + 1]);
}

int minimum_jumps(int A, int B, int C, int D) {
    ll mini = INF;
    for (ll i = A; i <= B; i++)
    {
        for (ll j = C; j <= D; j++)
        {
            if (query(i, j) == H[j])
            {
                ll steps = 0;
                ll cur = i;
                while (cur != j)
                {
                    ll next = -1;
                    if (prevHigher[cur] != -1 && H[prevHigher[cur]] <= H[j]) next = prevHigher[cur];
                    if (nextHigher[cur] != N && H[nextHigher[cur]] <= H[j] && (next == -1 || H[next] < H[nextHigher[cur]])) next = nextHigher[cur];
                    steps++;
                    cur = next;
                }
                mini = min(mini, steps);
            }
        }
    }
    if (mini == INF) mini = -1;
    return mini;
}
/*
int main() {
  int N, Q;
  assert(2 == scanf("%d %d", &N, &Q));
  std::vector<int> H(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &H[i]));
  }
  init(N, H);

  for (int i = 0; i < Q; ++i) {
    int A, B, C, D;
    assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
    printf("%d\n", minimum_jumps(A, B, C, D));
  }
  return 0;
}
/**/

Compilation message

jumps.cpp:130:1: warning: "/*" within comment [-Wcomment]
  130 | /**/
      |

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4054 ms 10904 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 11 ms 344 KB Output is correct
11 Correct 44 ms 344 KB Output is correct
12 Correct 28 ms 344 KB Output is correct
13 Correct 17 ms 344 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 27 ms 344 KB Output is correct
16 Correct 13 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 596 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 2 ms 344 KB Output is correct
39 Correct 2 ms 344 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 11 ms 344 KB Output is correct
11 Correct 44 ms 344 KB Output is correct
12 Correct 28 ms 344 KB Output is correct
13 Correct 17 ms 344 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 27 ms 344 KB Output is correct
16 Correct 13 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 596 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 2 ms 344 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 500 KB Output is correct
45 Correct 11 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 10 ms 344 KB Output is correct
48 Correct 2 ms 344 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Correct 43 ms 344 KB Output is correct
51 Correct 26 ms 344 KB Output is correct
52 Correct 17 ms 344 KB Output is correct
53 Correct 11 ms 344 KB Output is correct
54 Correct 27 ms 344 KB Output is correct
55 Correct 13 ms 344 KB Output is correct
56 Correct 3 ms 344 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Execution timed out 4038 ms 344 KB Time limit exceeded
59 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Execution timed out 4048 ms 9696 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 128 ms 5272 KB Output is correct
5 Correct 601 ms 10804 KB Output is correct
6 Correct 450 ms 2380 KB Output is correct
7 Correct 616 ms 10800 KB Output is correct
8 Correct 367 ms 4668 KB Output is correct
9 Correct 618 ms 10804 KB Output is correct
10 Execution timed out 4030 ms 12524 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 128 ms 5272 KB Output is correct
5 Correct 601 ms 10804 KB Output is correct
6 Correct 450 ms 2380 KB Output is correct
7 Correct 616 ms 10800 KB Output is correct
8 Correct 367 ms 4668 KB Output is correct
9 Correct 618 ms 10804 KB Output is correct
10 Execution timed out 4030 ms 12524 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4054 ms 10904 KB Time limit exceeded
4 Halted 0 ms 0 KB -