oj.uz

답안 #489561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489561 2021-11-23T08:53:02 Z dung11112003 밀림 점프 (APIO21_jumps) C++11
48 / 100
 1572 ms 75624 KB 
#include "jumps.h"

#include <bits/stdc++.h>

using namespace std;

int n;
vector <int> a, L, R, nxt;
vector <vector <int>> jumpL, jumpR, jumpbest;

void init(int N, vector<int> H)
{
    n = N;
    a = H;
    for (auto &x: a)
    {
        x--;
    }
    L.assign(n, 0);
    R.assign(n, 0);
    stack <int> st;
    for (int i = 0; i < n; i++)
    {
        while (!st.empty() && a[st.top()] < a[i])
        {
            st.pop();
        }
        L[i] = (st.empty() ? -1 : st.top());
        st.push(i);
    }
    st = stack <int>();
    for (int i = n - 1; i >= 0; i--)
    {
        while (!st.empty() && a[st.top()] < a[i])
        {
            st.pop();
        }
        R[i] = (st.empty() ? n : st.top());
        st.push(i);
    }
    jumpL.assign(n, vector <int> (20));
    for (int i = 0; i < n; i++)
    {
        jumpL[i][0] = L[i];
    }
    for (int j = 1; j < 20; j++)
    {
        for (int i = 0; i < n; i++)
        {
            jumpL[i][j] = (jumpL[i][j - 1] == -1 ? -1 : jumpL[jumpL[i][j - 1]][j - 1]);
        }
    }
    jumpR.assign(n, vector <int> (20));
    for (int i = 0; i < n; i++)
    {
        jumpR[i][0] = R[i];
    }
    for (int j = 1; j < 20; j++)
    {
        for (int i = 0; i < n; i++)
        {
            jumpR[i][j] = (jumpR[i][j - 1] == n ? n : jumpR[jumpR[i][j - 1]][j - 1]);
        }
    }
    jumpbest.assign(n, vector <int> (20));
    for (int i = 0; i < n; i++)
    {
        if (L[i] == -1)
        {
            jumpbest[i][0] = (R[i] == n ? -1 : R[i]);
        }
        else if (R[i] == n)
        {
            jumpbest[i][0] = L[i];
        }
        else
        {
            jumpbest[i][0] = (a[L[i]] < a[R[i]] ? R[i] : L[i]);
        }
    }
    for (int j = 1; j < 20; j++)
    {
        for (int i = 0; i < n; i++)
        {
            jumpbest[i][j] = (jumpbest[i][j - 1] == -1 ? -1 : jumpbest[jumpbest[i][j - 1]][j - 1]);
        }
    }
}

int minimum_jumps(int A, int B, int C, int D)
{
    int cur = B;
    for (int i = 19; i >= 0; i--)
    {
        if (jumpR[cur][i] < C)
        {
            cur = jumpR[cur][i];
        }
    }
    if (R[cur] > D)
    {
        return -1;
    }
    int target = R[cur];
    cur = B;
    for (int i = 19; i >= 0; i--)
    {
        if (jumpL[cur][i] >= A && a[jumpL[cur][i]] < a[target])
        {
            cur = jumpL[cur][i];
        }
    }
    if (R[target] <= D && L[cur] >= A)
    {
        return 1;
    }
    int ans = 0;
    for (int i = 19; i >= 0; i--)
    {
        if (jumpbest[cur][i] != -1 && a[jumpbest[cur][i]] <= a[target])
        {
            cur = jumpbest[cur][i];
            ans += 1 << i;
        }
    }
    for (int i = 19; i >= 0; i--)
    {
        if (jumpR[cur][i] <= target)
        {
            cur = jumpR[cur][i];
            ans += 1 << i;
        }
    }
    return ans;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 277 ms 60128 KB Output is correct
4 Correct 1572 ms 75540 KB Output is correct
5 Correct 882 ms 38144 KB Output is correct
6 Correct 1312 ms 75416 KB Output is correct
7 Correct 1146 ms 51656 KB Output is correct
8 Correct 1311 ms 75624 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Incorrect 4 ms 328 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Incorrect 4 ms 328 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 172 ms 60096 KB Output is correct
6 Correct 207 ms 74648 KB Output is correct
7 Correct 94 ms 38336 KB Output is correct
8 Correct 205 ms 74644 KB Output is correct
9 Correct 18 ms 11464 KB Output is correct
10 Correct 211 ms 74636 KB Output is correct
11 Correct 190 ms 75484 KB Output is correct
12 Incorrect 210 ms 74888 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 283 ms 34236 KB Output is correct
5 Correct 1156 ms 74704 KB Output is correct
6 Correct 608 ms 12488 KB Output is correct
7 Correct 1112 ms 74600 KB Output is correct
8 Correct 479 ms 25776 KB Output is correct
9 Correct 1074 ms 74688 KB Output is correct
10 Correct 1403 ms 75432 KB Output is correct
11 Correct 1209 ms 74808 KB Output is correct
12 Correct 1500 ms 75308 KB Output is correct
13 Correct 1010 ms 74660 KB Output is correct
14 Correct 1250 ms 74604 KB Output is correct
15 Correct 1074 ms 74536 KB Output is correct
16 Correct 962 ms 74604 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 22 ms 968 KB Output is correct
28 Correct 21 ms 968 KB Output is correct
29 Correct 20 ms 968 KB Output is correct
30 Correct 21 ms 968 KB Output is correct
31 Correct 19 ms 968 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 115 ms 43668 KB Output is correct
34 Correct 197 ms 74656 KB Output is correct
35 Correct 190 ms 75304 KB Output is correct
36 Correct 208 ms 74536 KB Output is correct
37 Correct 197 ms 74560 KB Output is correct
38 Correct 189 ms 74668 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 283 ms 34236 KB Output is correct
5 Correct 1156 ms 74704 KB Output is correct
6 Correct 608 ms 12488 KB Output is correct
7 Correct 1112 ms 74600 KB Output is correct
8 Correct 479 ms 25776 KB Output is correct
9 Correct 1074 ms 74688 KB Output is correct
10 Correct 1403 ms 75432 KB Output is correct
11 Correct 1209 ms 74808 KB Output is correct
12 Correct 1500 ms 75308 KB Output is correct
13 Correct 1010 ms 74660 KB Output is correct
14 Correct 1250 ms 74604 KB Output is correct
15 Correct 1074 ms 74536 KB Output is correct
16 Correct 962 ms 74604 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 22 ms 968 KB Output is correct
28 Correct 21 ms 968 KB Output is correct
29 Correct 20 ms 968 KB Output is correct
30 Correct 21 ms 968 KB Output is correct
31 Correct 19 ms 968 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 115 ms 43668 KB Output is correct
34 Correct 197 ms 74656 KB Output is correct
35 Correct 190 ms 75304 KB Output is correct
36 Correct 208 ms 74536 KB Output is correct
37 Correct 197 ms 74560 KB Output is correct
38 Correct 189 ms 74668 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 0 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 267 ms 34296 KB Output is correct
43 Correct 1176 ms 74596 KB Output is correct
44 Correct 669 ms 12436 KB Output is correct
45 Correct 1111 ms 74656 KB Output is correct
46 Correct 597 ms 26048 KB Output is correct
47 Correct 1151 ms 74656 KB Output is correct
48 Correct 1455 ms 75408 KB Output is correct
49 Correct 1266 ms 74748 KB Output is correct
50 Correct 1395 ms 75308 KB Output is correct
51 Correct 1090 ms 74660 KB Output is correct
52 Correct 1342 ms 74560 KB Output is correct
53 Correct 1162 ms 74544 KB Output is correct
54 Correct 1008 ms 74648 KB Output is correct
55 Correct 0 ms 200 KB Output is correct
56 Correct 251 ms 74312 KB Output is correct
57 Correct 1158 ms 74644 KB Output is correct
58 Correct 523 ms 13256 KB Output is correct
59 Correct 1164 ms 74560 KB Output is correct
60 Correct 442 ms 26688 KB Output is correct
61 Correct 1033 ms 74624 KB Output is correct
62 Correct 1417 ms 75480 KB Output is correct
63 Correct 1309 ms 74912 KB Output is correct
64 Correct 1300 ms 74944 KB Output is correct
65 Correct 967 ms 74648 KB Output is correct
66 Correct 1400 ms 74560 KB Output is correct
67 Correct 1145 ms 74736 KB Output is correct
68 Correct 1109 ms 74596 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 4 ms 328 KB Output is correct
72 Correct 3 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 2 ms 328 KB Output is correct
75 Correct 2 ms 328 KB Output is correct
76 Correct 0 ms 200 KB Output is correct
77 Correct 0 ms 200 KB Output is correct
78 Correct 2 ms 200 KB Output is correct
79 Correct 3 ms 328 KB Output is correct
80 Correct 3 ms 328 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 2 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 0 ms 328 KB Output is correct
85 Correct 4 ms 328 KB Output is correct
86 Correct 9 ms 968 KB Output is correct
87 Correct 23 ms 968 KB Output is correct
88 Correct 22 ms 968 KB Output is correct
89 Correct 22 ms 968 KB Output is correct
90 Correct 24 ms 968 KB Output is correct
91 Correct 0 ms 328 KB Output is correct
92 Correct 2 ms 456 KB Output is correct
93 Correct 23 ms 968 KB Output is correct
94 Correct 25 ms 968 KB Output is correct
95 Correct 18 ms 968 KB Output is correct
96 Correct 31 ms 968 KB Output is correct
97 Correct 22 ms 968 KB Output is correct
98 Correct 0 ms 200 KB Output is correct
99 Correct 209 ms 74500 KB Output is correct
100 Correct 217 ms 74648 KB Output is correct
101 Correct 203 ms 75284 KB Output is correct
102 Correct 198 ms 74604 KB Output is correct
103 Correct 199 ms 74772 KB Output is correct
104 Correct 188 ms 74548 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 114 ms 43444 KB Output is correct
107 Correct 208 ms 74644 KB Output is correct
108 Correct 190 ms 75288 KB Output is correct
109 Correct 213 ms 74560 KB Output is correct
110 Correct 202 ms 74768 KB Output is correct
111 Correct 203 ms 74548 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 277 ms 60128 KB Output is correct
4 Correct 1572 ms 75540 KB Output is correct
5 Correct 882 ms 38144 KB Output is correct
6 Correct 1312 ms 75416 KB Output is correct
7 Correct 1146 ms 51656 KB Output is correct
8 Correct 1311 ms 75624 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 0 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Incorrect 4 ms 328 KB Output isn't correct
15 Halted 0 ms 0 KB -