oj.uz

Submission #975147

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

using namespace std;

typedef int 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;
vv largestLifting;
v rightHeight;
ll logN;
v nextLargest;
vv nextLifting;

ll query(ll l, ll r, v &st, bool maxi = true)
{
    ll n = st.size() / 2;
    l += n;
    r += n;
    ll res = maxi? -INF : INF;
    while (l <= r)
    {
        if (l % 2 == 1)
        {
            if (maxi)
                res = max(res, st[l]);
            else
                res = min(res, st[l]);
            l++;
        }
        if (r % 2 == 0)
        {
            if (maxi)
                res = max(res,st[r]);
            else
                res = min(res, st[l]);
            r--;
        }
        l /= 2;
        r /= 2;
    }
    return res;
}

ll largestSmaller(ll l, ll r, ll threshold, v &st)
{
    ll n = st.size() / 2;
    l += n;
    r += n;
    v segs, segsRev;
    while (l <= r)
    {
        if (l % 2 == 1)
        {
            segs.pb(l); l++;
        }
        if (r % 2 == 0)
        {
            segsRev.pb(r); r--;
        }
        l /= 2; r /= 2;
    }
    reverse(all(segs));
    for (ll x : segs) segsRev.pb(x);
    v relevantSegs;
    ll lastSeg;
    for (ll x : segsRev)
    {
        if (st[x] >= threshold)
        {
            lastSeg = x;
            break;
        }
        relevantSegs.pb(x);
    }
    ll lastSegMaxi = -INF;
    ll cur = lastSeg;
    while (cur < n)
    {
        if (st[2 * cur + 1] < threshold)
        {
            lastSegMaxi = max(lastSegMaxi, st[2 * cur + 1]);
            cur *= 2;
        }
        else cur = 2 * cur + 1;
    }
    ll best = -INF;
    for (ll x : relevantSegs) best = max(best, st[x]);
    if (best > lastSegMaxi)
    {
        for (ll x : relevantSegs)
        {
            if (st[x] == best)
            {
                ll cur = x;
                while (cur < n)
                {
                    if (st[2 * cur] == x) cur *= 2;
                    else cur = 2 * cur + 1;
                }
                return cur - n;
            }
        }
    }
    if (lastSegMaxi == -INF) return -1;
    cur = lastSeg;
    while (cur < n)
    {
        if (st[2 * cur + 1] >= lastSegMaxi) cur = 2 * cur + 1;
        else cur *= 2;
    }
    return cur - n;
}

void init(int Nn, std::vector<int> Hh) {
    vp hSorted;
    for (ll i =0 ; i < Nn; i++) hSorted.eb(Hh[i], i);
    sort(all(hSorted));
    H = v(Nn, -1);
    for (ll i = 0; i < hSorted.size(); i++) H[hSorted[i].s] = i;
    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]);
    nextLargest = v(N, -1);
    for (ll i = 0; i < N; i++)
    {
        if (nextHigher[i] != N) nextLargest[i] = nextHigher[i];
        if (prevHigher[i] != -1 && (nextLargest[i] == -1 || H[nextLargest[i]] < H[prevHigher[i]])) nextLargest[i] = prevHigher[i];
    }
    logN = log2(N);
    largestLifting = vv(N, v(logN + 1, -1));
    for (ll i = 0; i < N; i++) largestLifting[i][0] = nextLargest[i];
    for (ll iter = 1; iter <= logN; iter++)
    {
        for (ll i= 0; i < N; i++)
        {
            if (largestLifting[i][iter - 1] == -1) largestLifting[i][iter] = -1;
            else largestLifting[i][iter] = largestLifting[largestLifting[i][iter - 1]][iter - 1];
        }
    }
    vv nextHigherRev(N + 1);
    for (ll i =0; i <N; i++) nextHigherRev[nextHigher[i]].pb(i);
    rightHeight = v(N + 1, 0);
    stack<p> dfs;
    dfs.emplace(N, 0);
    while (!dfs.empty())
    {
        auto top = dfs.top();
        dfs.pop();
        rightHeight[top.f] = top.s;
        for (ll x : nextHigherRev[top.f]) dfs.emplace(x, top.s + 1);
    }
    nextLifting = vv(N + 1, v(logN + 1, N));
    for (ll i = 0; i < N; i++) nextLifting[i][0] = nextHigher[i];
    for (ll i = 1; i <= logN; i++)
    {
        for (ll j = 0; j < N; j++)
        {
            nextLifting[j][i] = nextLifting[nextLifting[j][i - 1]][i - 1];
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    ll mini = INF;
    for (ll j = C; j <= D; j++)
    {
        ll i = largestSmaller(A, B, H[j], st);
        if (i == -1 || query(i, j - 1, st, true) > H[j]) continue;
        ll steps = 0;
        ll cur = i;
        for (ll k = logN; k >= 0; k--)
        {
            if (largestLifting[cur][k] != -1 && H[largestLifting[cur][k]] <= H[j])
            {
                cur = largestLifting[cur][k];
                steps += (1 << k);
            }
        }
        steps += abs(rightHeight[cur] - rightHeight[j]);
        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:250:1: warning: "/*" within comment [-Wcomment]
  250 | /**/
      |  
jumps.cpp:27:16: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   27 | const ll INF = 1e18;
      |                ^~~~
jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:149:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |     for (ll i = 0; i < hSorted.size(); i++) H[hSorted[i].s] = i;
      |                    ~~^~~~~~~~~~~~~~~~
jumps.cpp: In function 'll largestSmaller(ll, ll, ll, v&)':
jumps.cpp:109:18: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
  109 |         if (st[2 * cur + 1] < threshold)
      |                ~~^~~~~

Subtask #1
0 / 4.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 Execution timed out 4032 ms 49036 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.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 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.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 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 101 ms 47252 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 176 ms 26944 KB Output is correct
5 Correct 743 ms 58092 KB Output is correct
6 Correct 423 ms 9936 KB Output is correct
7 Correct 719 ms 58080 KB Output is correct
8 Correct 412 ms 20828 KB Output is correct
9 Correct 687 ms 58144 KB Output is correct
10 Correct 901 ms 60956 KB Output is correct
11 Correct 693 ms 60976 KB Output is correct
12 Correct 811 ms 61412 KB Output is correct
13 Correct 737 ms 58672 KB Output is correct
14 Correct 842 ms 57980 KB Output is correct
15 Correct 694 ms 57120 KB Output is correct
16 Correct 692 ms 57124 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 14 ms 1112 KB Output is correct
28 Correct 11 ms 956 KB Output is correct
29 Correct 11 ms 1112 KB Output is correct
30 Correct 12 ms 1112 KB Output is correct
31 Correct 12 ms 1112 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 58 ms 33544 KB Output is correct
34 Correct 128 ms 58408 KB Output is correct
35 Correct 108 ms 61200 KB Output is correct
36 Correct 124 ms 58672 KB Output is correct
37 Correct 126 ms 57960 KB Output is correct
38 Correct 118 ms 56880 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 176 ms 26944 KB Output is correct
5 Correct 743 ms 58092 KB Output is correct
6 Correct 423 ms 9936 KB Output is correct
7 Correct 719 ms 58080 KB Output is correct
8 Correct 412 ms 20828 KB Output is correct
9 Correct 687 ms 58144 KB Output is correct
10 Correct 901 ms 60956 KB Output is correct
11 Correct 693 ms 60976 KB Output is correct
12 Correct 811 ms 61412 KB Output is correct
13 Correct 737 ms 58672 KB Output is correct
14 Correct 842 ms 57980 KB Output is correct
15 Correct 694 ms 57120 KB Output is correct
16 Correct 692 ms 57124 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 14 ms 1112 KB Output is correct
28 Correct 11 ms 956 KB Output is correct
29 Correct 11 ms 1112 KB Output is correct
30 Correct 12 ms 1112 KB Output is correct
31 Correct 12 ms 1112 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 58 ms 33544 KB Output is correct
34 Correct 128 ms 58408 KB Output is correct
35 Correct 108 ms 61200 KB Output is correct
36 Correct 124 ms 58672 KB Output is correct
37 Correct 126 ms 57960 KB Output is correct
38 Correct 118 ms 56880 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 169 ms 26836 KB Output is correct
43 Correct 724 ms 58048 KB Output is correct
44 Correct 434 ms 10192 KB Output is correct
45 Correct 742 ms 58124 KB Output is correct
46 Correct 361 ms 20424 KB Output is correct
47 Correct 725 ms 58140 KB Output is correct
48 Correct 877 ms 61104 KB Output is correct
49 Correct 732 ms 61212 KB Output is correct
50 Correct 855 ms 61084 KB Output is correct
51 Correct 683 ms 58468 KB Output is correct
52 Correct 825 ms 57956 KB Output is correct
53 Correct 642 ms 57192 KB Output is correct
54 Correct 642 ms 57216 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 176 ms 57716 KB Output is correct
57 Incorrect 728 ms 58032 KB Output isn't correct
58 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 1 ms 344 KB Output is correct
3 Execution timed out 4032 ms 49036 KB Time limit exceeded
4 Halted 0 ms 0 KB -