oj.uz

답안 #501339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501339 2022-01-02T20:13:07 Z Newtech66 밀림 점프 (APIO21_jumps) C++17
16 / 100
 2446 ms 66240 KB 
#include "jumps.h"

#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
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;
    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,r=mid-1;
                else
                {
                    int nxtpos=ng[pos][0];
                    if(nxtpos>=C && nxtpos<=D)  ans=mid,r=mid-1;
                    else
                    {
                        if(nxtpos==-1)  r=mid-1;
                        else
                        {
                            if(nxtpos<C)    ans=mid,l=mid+1;
                            else    r=mid-1;
                        }
                    }
                }
            }
        }
        tmp+=ans;
        //cout<<tmp<<endl;
        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 333 ms 52764 KB Output is correct
4 Correct 2446 ms 66100 KB Output is correct
5 Correct 1848 ms 33332 KB Output is correct
6 Correct 2339 ms 65988 KB Output is correct
7 Correct 1803 ms 45216 KB Output is correct
8 Correct 2180 ms 66096 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 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 328 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 2 ms 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 2 ms 328 KB Output is correct
15 Incorrect 2 ms 328 KB Output isn't correct
16 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 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 328 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 2 ms 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 2 ms 328 KB Output is correct
15 Incorrect 2 ms 328 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
12.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 1 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 113 ms 52548 KB Output is correct
6 Correct 134 ms 65272 KB Output is correct
7 Correct 69 ms 33472 KB Output is correct
8 Correct 132 ms 65304 KB Output is correct
9 Correct 17 ms 10092 KB Output is correct
10 Correct 140 ms 65176 KB Output is correct
11 Correct 130 ms 66092 KB Output is correct
12 Correct 136 ms 65812 KB Output is correct
13 Correct 131 ms 65776 KB Output is correct
14 Correct 137 ms 65276 KB Output is correct
15 Correct 174 ms 65652 KB Output is correct
16 Correct 153 ms 65940 KB Output is correct
17 Correct 132 ms 65964 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 0 ms 328 KB Output is correct
22 Correct 0 ms 328 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 0 ms 328 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 1 ms 968 KB Output is correct
28 Correct 1 ms 968 KB Output is correct
29 Correct 1 ms 968 KB Output is correct
30 Correct 1 ms 968 KB Output is correct
31 Correct 1 ms 968 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 151 ms 65176 KB Output is correct
34 Correct 138 ms 65300 KB Output is correct
35 Correct 133 ms 65856 KB Output is correct
36 Correct 135 ms 65204 KB Output is correct
37 Correct 171 ms 65644 KB Output is correct
38 Correct 138 ms 66240 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 87 ms 37900 KB Output is correct
41 Correct 146 ms 65216 KB Output is correct
42 Correct 131 ms 65988 KB Output is correct
43 Correct 140 ms 65164 KB Output is correct
44 Correct 160 ms 65644 KB Output is correct
45 Correct 142 ms 66060 KB Output is correct

Subtask #5
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 Incorrect 293 ms 30104 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
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 Incorrect 293 ms 30104 KB Output isn't correct
5 Halted 0 ms 0 KB -

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 333 ms 52764 KB Output is correct
4 Correct 2446 ms 66100 KB Output is correct
5 Correct 1848 ms 33332 KB Output is correct
6 Correct 2339 ms 65988 KB Output is correct
7 Correct 1803 ms 45216 KB Output is correct
8 Correct 2180 ms 66096 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 Correct 2 ms 328 KB Output is correct
15 Correct 2 ms 328 KB Output is correct
16 Correct 2 ms 328 KB Output is correct
17 Correct 2 ms 328 KB Output is correct
18 Correct 2 ms 328 KB Output is correct
19 Correct 3 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Incorrect 2 ms 328 KB Output isn't correct
24 Halted 0 ms 0 KB -