oj.uz

답안 #975099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975099 2024-05-04T12:39:23 Z yoav_s 밀림 점프 (APIO21_jumps) C++17
31 / 100
 4000 ms 62372 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;
vv largestLifting;
v rightHeight;
ll logN;
v nextLargest;

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]);
    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);
    }
}

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;
                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:164:1: warning: "/*" within comment [-Wcomment]
  164 | /**/
      |

Subtask #1
0 / 4.0

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

Subtask #2
8.0 / 8.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 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 10 ms 344 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 14 ms 344 KB Output is correct
13 Correct 11 ms 344 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Correct 9 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 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 2 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 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct

Subtask #3
0 / 13.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 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 10 ms 344 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 14 ms 344 KB Output is correct
13 Correct 11 ms 344 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Correct 9 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 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 2 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 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 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 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 344 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 17 ms 344 KB Output is correct
51 Correct 15 ms 344 KB Output is correct
52 Correct 11 ms 344 KB Output is correct
53 Correct 11 ms 596 KB Output is correct
54 Correct 14 ms 344 KB Output is correct
55 Correct 9 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 4073 ms 600 KB Time limit exceeded
59 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 4046 ms 47772 KB Time limit exceeded
6 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 170 ms 25476 KB Output is correct
5 Correct 686 ms 58140 KB Output is correct
6 Correct 425 ms 9656 KB Output is correct
7 Correct 665 ms 58152 KB Output is correct
8 Correct 401 ms 19772 KB Output is correct
9 Correct 650 ms 58348 KB Output is correct
10 Correct 810 ms 60708 KB Output is correct
11 Correct 699 ms 60668 KB Output is correct
12 Correct 739 ms 60820 KB Output is correct
13 Correct 681 ms 58612 KB Output is correct
14 Correct 729 ms 59912 KB Output is correct
15 Correct 643 ms 62132 KB Output is correct
16 Correct 675 ms 62280 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 2 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 0 ms 344 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 11 ms 856 KB Output is correct
28 Correct 11 ms 1108 KB Output is correct
29 Correct 9 ms 856 KB Output is correct
30 Correct 8 ms 856 KB Output is correct
31 Correct 11 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 47 ms 31712 KB Output is correct
34 Correct 97 ms 58156 KB Output is correct
35 Correct 98 ms 60704 KB Output is correct
36 Correct 91 ms 58608 KB Output is correct
37 Correct 97 ms 59948 KB Output is correct
38 Correct 80 ms 61608 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 170 ms 25476 KB Output is correct
5 Correct 686 ms 58140 KB Output is correct
6 Correct 425 ms 9656 KB Output is correct
7 Correct 665 ms 58152 KB Output is correct
8 Correct 401 ms 19772 KB Output is correct
9 Correct 650 ms 58348 KB Output is correct
10 Correct 810 ms 60708 KB Output is correct
11 Correct 699 ms 60668 KB Output is correct
12 Correct 739 ms 60820 KB Output is correct
13 Correct 681 ms 58612 KB Output is correct
14 Correct 729 ms 59912 KB Output is correct
15 Correct 643 ms 62132 KB Output is correct
16 Correct 675 ms 62280 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 2 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 0 ms 344 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 11 ms 856 KB Output is correct
28 Correct 11 ms 1108 KB Output is correct
29 Correct 9 ms 856 KB Output is correct
30 Correct 8 ms 856 KB Output is correct
31 Correct 11 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 47 ms 31712 KB Output is correct
34 Correct 97 ms 58156 KB Output is correct
35 Correct 98 ms 60704 KB Output is correct
36 Correct 91 ms 58608 KB Output is correct
37 Correct 97 ms 59948 KB Output is correct
38 Correct 80 ms 61608 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 178 ms 25452 KB Output is correct
43 Correct 656 ms 58152 KB Output is correct
44 Correct 413 ms 9680 KB Output is correct
45 Correct 650 ms 58136 KB Output is correct
46 Correct 381 ms 19764 KB Output is correct
47 Correct 662 ms 58156 KB Output is correct
48 Correct 825 ms 60668 KB Output is correct
49 Correct 703 ms 60716 KB Output is correct
50 Correct 786 ms 60864 KB Output is correct
51 Correct 663 ms 58660 KB Output is correct
52 Correct 805 ms 59932 KB Output is correct
53 Correct 681 ms 62272 KB Output is correct
54 Correct 682 ms 62372 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Execution timed out 4024 ms 57932 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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