oj.uz

답안 #501277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501277 2022-01-02T17:37:07 Z Newtech66 밀림 점프 (APIO21_jumps) C++17
48 / 100
 2778 ms 66192 KB 
#include "jumps.h"

#include <bits/stdc++.h>
using namespace std;
int n;
vector<array<int,20> > pg,ng,hh,mxhh; //prev greater,next greater,highest height,max index reached while taking highest height jumps
//note: mxhh is -1 is jump is invalid, and answer otherwise
vector<int> Hq;

int pgq(int st,int x)
{
    while(x>0 && st>-1)
    {
        st=pg[st][__builtin_ctz(x)];
        x^=x&(-x);
    }
    return st;
}

int ngq(int st,int x)
{
    while(x>0 && st>-1)
    {
        st=ng[st][__builtin_ctz(x)];
        x^=x&(-x);
    }
    return st;
}

int hhq(int st,int x)
{
    while(x>0 && st>-1)
    {
        st=hh[st][__builtin_ctz(x)];
        x^=x&(-x);
    }
    return st;
}

int mxhhq(int st,int x)
{
    if(hhq(st,x)==-1)   return -1;
    int res=st;
    while(x>0)
    {
        res=max(res,mxhh[st][__builtin_ctz(x)]);
        st=hh[st][__builtin_ctz(x)];
        x^=x&(-x);
    }
    return res;
}

void init(int N, std::vector<int> H) {
    n=N;
    Hq=H;
    pg.resize(N),ng.resize(N),hh.resize(N),mxhh.resize(N);
    stack<int> st;
    pg[0][0]=-1;
    st.push(0);
    for(int i=1;i<N;i++)
    {
        while(!st.empty() && H[st.top()]<H[i])  st.pop();
        if(st.empty())  pg[i][0]=-1;
        else    pg[i][0]=st.top();
        st.push(i);
    }
    while(!st.empty())  st.pop();
    ng[N-1][0]=-1;
    st.push(N-1);
    for(int i=N-2;i>=0;i--)
    {
        while(!st.empty() && H[st.top()]<H[i])  st.pop();
        if(st.empty())  ng[i][0]=-1;
        else    ng[i][0]=st.top();
        st.push(i);
    }
    for(int i=0;i<N;i++)
    {
        int mx=-1,posmx=-1;
        if(pg[i][0]>-1 && H[pg[i][0]]>mx)   mx=H[pg[i][0]],posmx=pg[i][0];
        if(ng[i][0]>-1 && H[ng[i][0]]>mx)   mx=H[ng[i][0]],posmx=ng[i][0];
        hh[i][0]=mxhh[i][0]=posmx;
        if(posmx>-1)    mxhh[i][0]=max(i,posmx);
    }
    for(int j=1;j<20;j++)
    {
        for(int i=0;i<N;i++)
        {
            pg[i][j]=ng[i][j]=hh[i][j]=mxhh[i][j]=-1;
            if(pg[i][j-1]>-1)   pg[i][j]=pg[pg[i][j-1]][j-1];
            if(ng[i][j-1]>-1)   ng[i][j]=ng[ng[i][j-1]][j-1];
            if(hh[i][j-1]>-1)   hh[i][j]=hh[hh[i][j-1]][j-1];
            if(hh[i][j]>-1) mxhh[i][j]=max(mxhh[i][j-1],mxhh[mxhh[i][j-1]][j-1]);
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    int l,r,mid,ans; //remember to reset this before each binary search
    int cnt=n;
    //there are two cases
    //Case 1: if i use some go to right only moves, that means i want to reach C
    l=0,r=n-1,ans=-1;
    while(l<=r)
    {
        mid=l+(r-l)/2;
        int pos=pgq(B,mid);
        if(pos==-1 || pos<A || Hq[pos]>Hq[C])    r=mid-1;
        else
        {
            ans=mid;
            l=mid+1;
        }
    }
    if(ans>-1)
    {
        //cout<<"Case 1: ";
        int posAB=pgq(B,ans);
        int tmp=0;
        l=0,r=n-1,ans=-1;
        while(l<=r)
        {
            mid=l+(r-l)/2;
            int pos=hhq(posAB,mid);
            if(pos==-1 || Hq[pos]>Hq[C])    r=mid-1;
            else
            {
                ans=mid;
                l=mid+1;
            }
        }
        tmp+=ans;
        int cpos=hhq(posAB,ans);
        l=0,r=n-1,ans=-1;
        while(l<=r)
        {
            mid=l+(r-l)/2;
            int pos=ngq(cpos,mid);
            if(pos==-1 || Hq[pos]>Hq[C])    r=mid-1;
            else
            {
                ans=mid;
                l=mid+1;
            }
        }
        tmp+=ans;
        int fpos=ngq(cpos,ans);
        //cout<<posAB<<" "<<cpos<<" "<<fpos<<" "<<tmp<<endl;
        if(fpos==C) cnt=min(cnt,tmp);
    }
    //Case 2: i only take hh jumps until i reach something in [C,D]
    l=0,r=n-1,ans=-1;
    while(l<=r)
    {
        mid=l+(r-l)/2;
        int pos=ngq(C,mid);
        if(pos==-1 || pos>D)    r=mid-1;
        else
        {
            ans=mid;
            l=mid+1;
        }
    }
    int mxCD=Hq[ngq(C,ans)];
    //cout<<mxCD<<endl;
    l=0,r=n-1,ans=-1;
    while(l<=r)
    {
        mid=l+(r-l)/2;
        int pos=pgq(B,mid);
        if(pos==-1 || pos<A || Hq[pos]>mxCD)    r=mid-1;
        else
        {
            ans=mid;
            l=mid+1;
        }
    }
    if(ans>-1)
    {
        //cout<<"Case 2: ";
        int tmp=0;
        int posAB=pgq(B,ans);
        l=0,r=n-1,ans=-1;
        while(l<=r)
        {
            mid=l+(r-l)/2;
            int mxpos=mxhhq(posAB,mid),pos=hhq(posAB,mid);
            if(mxpos==-1 || mxpos>D || Hq[pos]>mxCD)    r=mid-1;
            else
            {
                if(mxpos<C) ans=mid,l=mid+1;
                else
                {
                    ans=mid;
                    r=mid-1;
                }
            }
        }
        tmp+=ans;
        int cpos=hhq(posAB,ans);
        l=0,r=n-1,ans=0;
        while(l<=r)
        {
            mid=l+(r-l)/2;
            int pos=ngq(cpos,mid);
            if(pos==-1 || pos>D)    r=mid-1;
            else
            {
                if(pos<C)   l=mid+1;
                else
                {
                    ans=mid;
                    r=mid-1;
                }
            }
        }
        tmp+=ans;
        int fpos=ngq(cpos,ans);
        //cout<<posAB<<" "<<cpos<<" "<<fpos<<" "<<tmp<<endl;
        if(fpos>=C && fpos<=D)    cnt=min(tmp,cnt);
    }
    return ((cnt==n)?-1:cnt);
}

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 353 ms 52612 KB Output is correct
4 Correct 2585 ms 66072 KB Output is correct
5 Correct 2131 ms 33312 KB Output is correct
6 Correct 2778 ms 66044 KB Output is correct
7 Correct 2041 ms 45228 KB Output is correct
8 Correct 2653 ms 66100 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 276 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 137 ms 52440 KB Output is correct
6 Correct 168 ms 65272 KB Output is correct
7 Correct 76 ms 33456 KB Output is correct
8 Correct 135 ms 65268 KB Output is correct
9 Correct 24 ms 10056 KB Output is correct
10 Correct 138 ms 65200 KB Output is correct
11 Correct 153 ms 66100 KB Output is correct
12 Correct 160 ms 65784 KB Output is correct
13 Incorrect 152 ms 65804 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 341 ms 29944 KB Output is correct
5 Correct 1177 ms 65156 KB Output is correct
6 Correct 842 ms 11016 KB Output is correct
7 Correct 1306 ms 65272 KB Output is correct
8 Correct 617 ms 22600 KB Output is correct
9 Correct 1169 ms 65156 KB Output is correct
10 Correct 2373 ms 66100 KB Output is correct
11 Correct 1875 ms 66024 KB Output is correct
12 Correct 2385 ms 65932 KB Output is correct
13 Correct 1378 ms 65160 KB Output is correct
14 Correct 2158 ms 65672 KB Output is correct
15 Correct 1156 ms 66064 KB Output is correct
16 Correct 1321 ms 66064 KB Output is correct
17 Correct 0 ms 284 KB Output is correct
18 Correct 0 ms 280 KB Output is correct
19 Correct 2 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 276 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 22 ms 944 KB Output is correct
28 Correct 25 ms 968 KB Output is correct
29 Correct 18 ms 948 KB Output is correct
30 Correct 24 ms 948 KB Output is correct
31 Correct 21 ms 968 KB Output is correct
32 Correct 0 ms 288 KB Output is correct
33 Correct 82 ms 37764 KB Output is correct
34 Correct 151 ms 65168 KB Output is correct
35 Correct 141 ms 65972 KB Output is correct
36 Correct 140 ms 65264 KB Output is correct
37 Correct 180 ms 65688 KB Output is correct
38 Correct 149 ms 66192 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 341 ms 29944 KB Output is correct
5 Correct 1177 ms 65156 KB Output is correct
6 Correct 842 ms 11016 KB Output is correct
7 Correct 1306 ms 65272 KB Output is correct
8 Correct 617 ms 22600 KB Output is correct
9 Correct 1169 ms 65156 KB Output is correct
10 Correct 2373 ms 66100 KB Output is correct
11 Correct 1875 ms 66024 KB Output is correct
12 Correct 2385 ms 65932 KB Output is correct
13 Correct 1378 ms 65160 KB Output is correct
14 Correct 2158 ms 65672 KB Output is correct
15 Correct 1156 ms 66064 KB Output is correct
16 Correct 1321 ms 66064 KB Output is correct
17 Correct 0 ms 284 KB Output is correct
18 Correct 0 ms 280 KB Output is correct
19 Correct 2 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 276 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 22 ms 944 KB Output is correct
28 Correct 25 ms 968 KB Output is correct
29 Correct 18 ms 948 KB Output is correct
30 Correct 24 ms 948 KB Output is correct
31 Correct 21 ms 968 KB Output is correct
32 Correct 0 ms 288 KB Output is correct
33 Correct 82 ms 37764 KB Output is correct
34 Correct 151 ms 65168 KB Output is correct
35 Correct 141 ms 65972 KB Output is correct
36 Correct 140 ms 65264 KB Output is correct
37 Correct 180 ms 65688 KB Output is correct
38 Correct 149 ms 66192 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 284 KB Output is correct
42 Correct 329 ms 30000 KB Output is correct
43 Correct 1343 ms 65168 KB Output is correct
44 Correct 806 ms 10900 KB Output is correct
45 Correct 1328 ms 65268 KB Output is correct
46 Correct 598 ms 22548 KB Output is correct
47 Correct 1127 ms 65288 KB Output is correct
48 Correct 2528 ms 65984 KB Output is correct
49 Correct 1750 ms 65928 KB Output is correct
50 Correct 2063 ms 66100 KB Output is correct
51 Correct 1090 ms 65168 KB Output is correct
52 Correct 2161 ms 65632 KB Output is correct
53 Correct 1503 ms 66056 KB Output is correct
54 Correct 1177 ms 66056 KB Output is correct
55 Correct 0 ms 280 KB Output is correct
56 Correct 199 ms 64996 KB Output is correct
57 Correct 1210 ms 65172 KB Output is correct
58 Correct 607 ms 11668 KB Output is correct
59 Correct 1384 ms 65268 KB Output is correct
60 Correct 497 ms 23320 KB Output is correct
61 Correct 1374 ms 65172 KB Output is correct
62 Correct 2416 ms 66068 KB Output is correct
63 Correct 1815 ms 65804 KB Output is correct
64 Correct 1978 ms 65688 KB Output is correct
65 Correct 1208 ms 65172 KB Output is correct
66 Correct 1964 ms 65672 KB Output is correct
67 Correct 1703 ms 66052 KB Output is correct
68 Correct 1349 ms 66096 KB Output is correct
69 Correct 0 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 2 ms 328 KB Output is correct
72 Correct 1 ms 284 KB Output is correct
73 Correct 2 ms 328 KB Output is correct
74 Correct 3 ms 328 KB Output is correct
75 Correct 3 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 1 ms 284 KB Output is correct
81 Correct 2 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 5 ms 328 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 2 ms 328 KB Output is correct
86 Correct 20 ms 928 KB Output is correct
87 Correct 22 ms 948 KB Output is correct
88 Correct 22 ms 968 KB Output is correct
89 Correct 22 ms 968 KB Output is correct
90 Correct 19 ms 968 KB Output is correct
91 Correct 0 ms 328 KB Output is correct
92 Correct 1 ms 412 KB Output is correct
93 Correct 17 ms 944 KB Output is correct
94 Correct 50 ms 968 KB Output is correct
95 Correct 22 ms 968 KB Output is correct
96 Correct 18 ms 968 KB Output is correct
97 Correct 21 ms 968 KB Output is correct
98 Correct 0 ms 200 KB Output is correct
99 Correct 137 ms 65044 KB Output is correct
100 Correct 141 ms 65168 KB Output is correct
101 Correct 139 ms 65836 KB Output is correct
102 Correct 151 ms 65216 KB Output is correct
103 Correct 192 ms 65688 KB Output is correct
104 Correct 132 ms 66060 KB Output is correct
105 Correct 0 ms 200 KB Output is correct
106 Correct 82 ms 37892 KB Output is correct
107 Correct 153 ms 65172 KB Output is correct
108 Correct 143 ms 65972 KB Output is correct
109 Correct 142 ms 65176 KB Output is correct
110 Correct 192 ms 65668 KB Output is correct
111 Correct 136 ms 66068 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 353 ms 52612 KB Output is correct
4 Correct 2585 ms 66072 KB Output is correct
5 Correct 2131 ms 33312 KB Output is correct
6 Correct 2778 ms 66044 KB Output is correct
7 Correct 2041 ms 45228 KB Output is correct
8 Correct 2653 ms 66100 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 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 3 ms 200 KB Output is correct
14 Incorrect 3 ms 328 KB Output isn't correct
15 Halted 0 ms 0 KB -