oj.uz

답안 #975121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975121 2024-05-04T13:15:36 Z yoav_s 밀림 점프 (APIO21_jumps) C++17
23 / 100
 4000 ms 97936 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;
vv st2;

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, vv &st)
{
    ll n = st.size() / 2;
    ll tl = n, tr = threshold + n - 1;
    v segs, segsRev;
    while (tl <= tr)
    {
        if (tl % 2 == 1)
        {
            segs.pb(tl);
            tl++;
        }
        if (tr % 2 == 0)
        {
            segsRev.pb(tr);
            tr--;
        }
        tl /= 2; tr /= 2;
    }
    reverse(all(segs)); for (ll x : segs) segsRev.pb(x);
    for (ll x : segsRev)
    {
        auto ptr = lower_bound(all(st[x]), l);
        if (ptr != st[x].end() && (*ptr) <= r)
        {
            while (x < n)
            {
                auto ptr = lower_bound(all(st[2 * x + 1]), l);
                if (ptr != st[2 * x + 1].end() && (*ptr) <= r) x = 2 * x + 1;
                else x *= 2;
            }
            return st[x][0];
        }
    }
    return -1;
}

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);
    }
    st2 = vv(2 * n, v());
    for (ll i = 0; i < N; i++) st2[H[i] + n] = {i};
    for (ll i = n - 1;  i> 0; i--)
    {
        merge(all(st2[2 * i]), all(st2[2 * i + 1]), back_inserter(st2[i]));
    }
    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], st2);
        ll i = -1;
        for (ll k = A; k <= B; k++) if (H[k] < H[j] && (i == -1 || H[i] < H[k])) i = k;
        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:226:1: warning: "/*" within comment [-Wcomment]
  226 | /**/
      |  
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:117: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]
  117 |     for (ll i = 0; i < hSorted.size(); i++) H[hSorted[i].s] = i;
      |                    ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4040 ms 80728 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 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

# 결과 실행 시간 메모리 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 Correct 1045 ms 79168 KB Output is correct
6 Execution timed out 4091 ms 94576 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 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 199 ms 43716 KB Output is correct
5 Correct 798 ms 94780 KB Output is correct
6 Correct 421 ms 16816 KB Output is correct
7 Correct 794 ms 95164 KB Output is correct
8 Correct 424 ms 34852 KB Output is correct
9 Correct 787 ms 94756 KB Output is correct
10 Correct 837 ms 97716 KB Output is correct
11 Correct 786 ms 97828 KB Output is correct
12 Correct 787 ms 97588 KB Output is correct
13 Correct 763 ms 95520 KB Output is correct
14 Correct 833 ms 94664 KB Output is correct
15 Correct 694 ms 93732 KB Output is correct
16 Correct 685 ms 93672 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 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 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 1 ms 612 KB Output is correct
27 Correct 11 ms 1368 KB Output is correct
28 Correct 11 ms 1360 KB Output is correct
29 Correct 13 ms 1368 KB Output is correct
30 Correct 15 ms 1360 KB Output is correct
31 Correct 10 ms 1368 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 97 ms 53660 KB Output is correct
34 Correct 198 ms 94568 KB Output is correct
35 Correct 156 ms 97936 KB Output is correct
36 Correct 183 ms 95264 KB Output is correct
37 Correct 164 ms 94500 KB Output is correct
38 Correct 139 ms 93508 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 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 199 ms 43716 KB Output is correct
5 Correct 798 ms 94780 KB Output is correct
6 Correct 421 ms 16816 KB Output is correct
7 Correct 794 ms 95164 KB Output is correct
8 Correct 424 ms 34852 KB Output is correct
9 Correct 787 ms 94756 KB Output is correct
10 Correct 837 ms 97716 KB Output is correct
11 Correct 786 ms 97828 KB Output is correct
12 Correct 787 ms 97588 KB Output is correct
13 Correct 763 ms 95520 KB Output is correct
14 Correct 833 ms 94664 KB Output is correct
15 Correct 694 ms 93732 KB Output is correct
16 Correct 685 ms 93672 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 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 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 1 ms 612 KB Output is correct
27 Correct 11 ms 1368 KB Output is correct
28 Correct 11 ms 1360 KB Output is correct
29 Correct 13 ms 1368 KB Output is correct
30 Correct 15 ms 1360 KB Output is correct
31 Correct 10 ms 1368 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 97 ms 53660 KB Output is correct
34 Correct 198 ms 94568 KB Output is correct
35 Correct 156 ms 97936 KB Output is correct
36 Correct 183 ms 95264 KB Output is correct
37 Correct 164 ms 94500 KB Output is correct
38 Correct 139 ms 93508 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 220 ms 43704 KB Output is correct
43 Correct 719 ms 94800 KB Output is correct
44 Correct 422 ms 16816 KB Output is correct
45 Correct 741 ms 94636 KB Output is correct
46 Correct 411 ms 34852 KB Output is correct
47 Correct 746 ms 95004 KB Output is correct
48 Correct 907 ms 97788 KB Output is correct
49 Correct 819 ms 97564 KB Output is correct
50 Correct 853 ms 97824 KB Output is correct
51 Correct 727 ms 95096 KB Output is correct
52 Correct 839 ms 94480 KB Output is correct
53 Correct 749 ms 93592 KB Output is correct
54 Correct 706 ms 93684 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Incorrect 1144 ms 94488 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4040 ms 80728 KB Time limit exceeded
4 Halted 0 ms 0 KB -