oj.uz

답안 #979266

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979266 2024-05-10T12:42:16 Z sleepntsheep 밀림 점프 (APIO21_jumps) C++17
44 / 100
 4000 ms 21956 KB 
#pragma GCC optimize("O2,unroll-loops")
#include "jumps.h"

#include<assert.h>
#include <vector>

int min(int i,int j){return i<j?i:j;}
int subtask = -1;

#define MAX_N 200000
#define MAX_M (2*MAX_N)

int N, head[MAX_N], nxt[MAX_M], vv[MAX_M], ng[MAX_N], pg[MAX_N], HI[MAX_N], H[MAX_N];
int dd[MAX_N], pp[MAX_N], jj[MAX_N], dd_[MAX_N], pp_[MAX_N], jj_[MAX_N];
int dd1[MAX_N],pp1[MAX_N],jj1[MAX_N],ee1[MAX_N];
int dd2[MAX_N],pp2[MAX_N],jj2[MAX_N],ee2[MAX_N];

/*
 * dd - high link
 * dd_ - low link
 * dd1 - left link
 * dd2 - right link */

void link(int u, int v)
{
    static int i = 1;
    nxt[i] = head[u];
    vv[i] = v;
    head[u] = i++;
}

void binlift_connect(int*dd,int*pp,int*jj,int p,int u)
{
    dd[u] = dd[p] + 1;
    pp[u] = p;
    jj[u] = dd[p] - dd[jj[p]] == dd[jj[p]] - dd[jj[jj[p]]] ? jj[jj[p]] : p;
}

void init(int N, std::vector<int> H) {
    for(auto&x:H)--x;
    ::N = N;
    if (N <= 200) subtask = 2;
    else if (N <= 2000) subtask = 3;
    int flag = 1;
    for (int i = 1; i < N; ++i) if (H[i] != H[i-1] + 1) flag = 0;
    if(flag) subtask = 1;

    static int stk[MAX_N], so;
    so = 0;

    for (int i = 0; i < N; stk[so++] = i++) while (so && H[stk[so-1]] < H[i]) ng[stk[so-1]]=i, link(stk[--so], i);
    while(so)ng[stk[--so]]=-1;
    for (int i = N - 1; i >= 0; stk[so++] = i--) while (so && H[stk[so-1]] < H[i]) pg[stk[so-1]]=i, link(stk[--so], i);
    while(so)pg[stk[--so]]=-1;

    for (int i = 0; i < N; ++i) HI[::H[i]=H[i]] = i;

    for (int j = N; j--;)
    {
        int i = HI[j];
        int high = (pg[i] == -1) ? ng[i] : (ng[i] == -1 ? pg[i] : (H[ng[i]] > H[pg[i]] ? ng[i] : pg[i]));
        int low = pg[i] + ng[i] - high;
        if (high != -1) binlift_connect(dd, pp, jj, high, i);
        else pp[i] = jj[i] = i;
        if (low != -1) binlift_connect(dd_, pp_, jj_, low, i);
        else pp_[i] = jj_[i] = i;
    }

    if (subtask == -1) subtask = 4;

    for(int i=0;i<N;++i)
    {
        /* left */
        if(pg[i]==-1) { pp1[i]=jj1[i]=i,dd1[i]=0; }
        else{
            binlift_connect(dd1,pp1,jj1,pg[i],i);
            if(jj1[i]==pp1[i])ee1[i]=H[pp1[i]];
            else ee1[i]=ee1[jj1[pp1[i]]];
        }

        /* right */
        if(ng[i]==-1) { pp2[i]=jj2[i]=i,dd2[i]=0; }
        else {
            binlift_connect(dd2,pp2,jj2,ng[i],i);
            if(jj2[i]==pp2[i])ee2[i]=H[pp2[i]];
            else ee2[i]=ee2[jj2[pp2[i]]];
        }
    }
    subtask = 7;
}

int Q_COUNTER = 0;

int minimum_jumps(int A, int B, int C, int D) {
    ++Q_COUNTER;

    if (subtask == 1) return (A>D)?-1:(B>=C?0:C-B);

    if (subtask == 4 && Q_COUNTER > 5) subtask = 5;

    if(subtask <= 4)
    {
        static int d[MAX_N], qu[MAX_N], qh=0, qt=0,z=1e9;
        qh=qt=0,z=1e9;
        for(int j=0;j<N;++j)d[j]=1e9;
        for (int i = A; i <= B; ++i) d[qu[qh++]=i]=0;
        while(qh-qt) for(int u=qu[qt++],j=head[u];j;j=nxt[j]) if(d[vv[j]]>d[u]+1)d[vv[j]]=d[u]+1,qu[qh++]=vv[j];
        for (int j = C; j <= D; ++j)if(d[j]!=1e9&&d[j]<z)z=d[j];
        return(z<1e9?z:-1);
    }

    if (subtask == 5 && A != B) subtask = 6;
    if (subtask == 6 && C != D) subtask = 7;

    if (subtask >= 5)
    {
        int highest_left;
        {
            int u=B;
            for(;pp1[u] != u;)
            {
                if(jj1[u]>=A)u=jj1[u];
                else if(pp1[u]>=A)u=pp1[u];
                else break;
            }
            highest_left=u;
        }

        int orig_C = C;
        // the right endpoint is a position that is at lower_bound(highest_left) 
        {
            int u=C;
            for(;pp2[u]!=u;)
            {
                if(jj2[u]<=D&&ee2[u]<H[highest_left])u=jj2[u];
                else if(pp2[u]<=D&&H[pp2[u]]<H[highest_left])u=pp2[u];
                else break;
            }
            if (u!=pp2[u]&&H[u]<H[highest_left]&&pp2[u]<=D)u=pp2[u];
            C=u;
        }

        /* select highest left endpoint possible */
        {
            int u=B;
            for(;pp1[u]!=u;)
            {
                if(jj1[u]>=A&&ee1[u]<H[C])u=jj1[u];
                else if(pp1[u]>=A&&H[pp1[u]]<H[C])u=pp1[u];
                else break;
            }
            A=u;
        }
        if(H[A]>H[C])return -1;

        int zz;
        {
            int u=A,u1;
            for(;pp[u]!=u;)
            {
                if (H[jj[u]]<=H[C])u=jj[u];
                else if(H[pp[u]]<=H[C])u=pp[u];
                else break;
            }
            u1=u;
            for(;pp_[u]!=u;)
            {
                if(H[jj_[u]]<=H[C])u=jj_[u];
                else if(H[pp_[u]]<=H[C])u=pp_[u];
                else break;
            }
            if(u!=C)return -1;
            zz= dd_[u1]-dd_[u]+dd[A]-dd[u1];
        }

        C = orig_C;
        {
            /* replace D with highest in incseq */
            int u=orig_C;
            for(;pp2[u]!=u;)
            {
                if(jj2[u]<=D)u=jj2[u];
                else if(pp2[u]<=D)u=pp2[u];
                else break;
            }
            D=u;
        }

        /*
         * another case or something -> idk  */
        {
            int u=A,u1;
            for(;pp[u]!=u;)
            {
                if(pp_[u]>=C&&D>=pp_[u])zz=min(zz,dd[A]-dd[u]+1);

                if (H[jj[u]]<=H[D])u=jj[u];
                else if(H[pp[u]]<=H[D])u=pp[u];
                else break;
            }
            u1=u;
            for(;pp_[u]!=u&&u<C;)
            {
                if(C>jj_[u])u=jj_[u];
                else u=pp_[u];
            }
            zz= min(zz,dd_[u1]-dd_[u]+dd[A]-dd[u1]);
        }
        return zz;
    }

    return -1;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 504 ms 20184 KB Output is correct
4 Execution timed out 4003 ms 21164 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 16728 KB Output is correct
4 Correct 2 ms 16980 KB Output is correct
5 Correct 31 ms 19832 KB Output is correct
6 Correct 31 ms 21448 KB Output is correct
7 Correct 16 ms 18008 KB Output is correct
8 Correct 33 ms 21296 KB Output is correct
9 Correct 6 ms 15704 KB Output is correct
10 Correct 31 ms 21484 KB Output is correct
11 Correct 25 ms 20936 KB Output is correct
12 Incorrect 25 ms 21440 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14932 KB Output is correct
2 Correct 2 ms 16728 KB Output is correct
3 Correct 2 ms 16728 KB Output is correct
4 Correct 127 ms 17752 KB Output is correct
5 Correct 608 ms 21440 KB Output is correct
6 Correct 419 ms 15960 KB Output is correct
7 Correct 615 ms 21328 KB Output is correct
8 Correct 324 ms 17096 KB Output is correct
9 Correct 617 ms 21448 KB Output is correct
10 Correct 663 ms 21188 KB Output is correct
11 Correct 654 ms 21692 KB Output is correct
12 Correct 613 ms 21440 KB Output is correct
13 Correct 624 ms 21336 KB Output is correct
14 Correct 637 ms 21688 KB Output is correct
15 Correct 562 ms 21448 KB Output is correct
16 Correct 586 ms 21444 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14680 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14756 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 3 ms 16732 KB Output is correct
25 Correct 2 ms 14680 KB Output is correct
26 Correct 2 ms 14680 KB Output is correct
27 Correct 11 ms 14864 KB Output is correct
28 Correct 16 ms 14680 KB Output is correct
29 Correct 9 ms 14680 KB Output is correct
30 Correct 12 ms 14680 KB Output is correct
31 Correct 17 ms 16728 KB Output is correct
32 Correct 2 ms 14680 KB Output is correct
33 Correct 23 ms 18632 KB Output is correct
34 Correct 41 ms 21212 KB Output is correct
35 Correct 22 ms 21184 KB Output is correct
36 Correct 29 ms 21440 KB Output is correct
37 Correct 24 ms 21692 KB Output is correct
38 Correct 22 ms 21692 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14932 KB Output is correct
2 Correct 2 ms 16728 KB Output is correct
3 Correct 2 ms 16728 KB Output is correct
4 Correct 127 ms 17752 KB Output is correct
5 Correct 608 ms 21440 KB Output is correct
6 Correct 419 ms 15960 KB Output is correct
7 Correct 615 ms 21328 KB Output is correct
8 Correct 324 ms 17096 KB Output is correct
9 Correct 617 ms 21448 KB Output is correct
10 Correct 663 ms 21188 KB Output is correct
11 Correct 654 ms 21692 KB Output is correct
12 Correct 613 ms 21440 KB Output is correct
13 Correct 624 ms 21336 KB Output is correct
14 Correct 637 ms 21688 KB Output is correct
15 Correct 562 ms 21448 KB Output is correct
16 Correct 586 ms 21444 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14680 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14756 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 3 ms 16732 KB Output is correct
25 Correct 2 ms 14680 KB Output is correct
26 Correct 2 ms 14680 KB Output is correct
27 Correct 11 ms 14864 KB Output is correct
28 Correct 16 ms 14680 KB Output is correct
29 Correct 9 ms 14680 KB Output is correct
30 Correct 12 ms 14680 KB Output is correct
31 Correct 17 ms 16728 KB Output is correct
32 Correct 2 ms 14680 KB Output is correct
33 Correct 23 ms 18632 KB Output is correct
34 Correct 41 ms 21212 KB Output is correct
35 Correct 22 ms 21184 KB Output is correct
36 Correct 29 ms 21440 KB Output is correct
37 Correct 24 ms 21692 KB Output is correct
38 Correct 22 ms 21692 KB Output is correct
39 Correct 2 ms 14680 KB Output is correct
40 Correct 2 ms 16728 KB Output is correct
41 Correct 2 ms 16728 KB Output is correct
42 Correct 145 ms 17696 KB Output is correct
43 Correct 593 ms 21432 KB Output is correct
44 Correct 445 ms 15960 KB Output is correct
45 Correct 664 ms 21428 KB Output is correct
46 Correct 365 ms 17132 KB Output is correct
47 Correct 619 ms 21416 KB Output is correct
48 Correct 682 ms 21192 KB Output is correct
49 Correct 605 ms 21956 KB Output is correct
50 Correct 689 ms 21180 KB Output is correct
51 Correct 593 ms 21444 KB Output is correct
52 Correct 641 ms 21692 KB Output is correct
53 Correct 572 ms 21424 KB Output is correct
54 Correct 570 ms 21420 KB Output is correct
55 Correct 2 ms 16728 KB Output is correct
56 Correct 78 ms 21252 KB Output is correct
57 Correct 585 ms 21448 KB Output is correct
58 Correct 301 ms 15960 KB Output is correct
59 Correct 624 ms 21436 KB Output is correct
60 Correct 250 ms 17104 KB Output is correct
61 Correct 604 ms 21436 KB Output is correct
62 Correct 614 ms 21188 KB Output is correct
63 Correct 625 ms 21420 KB Output is correct
64 Correct 624 ms 21272 KB Output is correct
65 Correct 606 ms 21436 KB Output is correct
66 Correct 645 ms 21700 KB Output is correct
67 Correct 648 ms 21716 KB Output is correct
68 Correct 551 ms 21424 KB Output is correct
69 Correct 2 ms 14680 KB Output is correct
70 Correct 2 ms 14680 KB Output is correct
71 Correct 3 ms 14680 KB Output is correct
72 Correct 2 ms 14680 KB Output is correct
73 Correct 2 ms 14680 KB Output is correct
74 Correct 2 ms 14676 KB Output is correct
75 Correct 3 ms 16724 KB Output is correct
76 Correct 2 ms 14680 KB Output is correct
77 Correct 2 ms 14680 KB Output is correct
78 Correct 2 ms 14680 KB Output is correct
79 Correct 3 ms 14680 KB Output is correct
80 Correct 3 ms 14680 KB Output is correct
81 Correct 2 ms 14680 KB Output is correct
82 Correct 2 ms 14680 KB Output is correct
83 Correct 3 ms 16728 KB Output is correct
84 Correct 2 ms 14680 KB Output is correct
85 Correct 3 ms 14680 KB Output is correct
86 Correct 9 ms 14680 KB Output is correct
87 Correct 11 ms 14680 KB Output is correct
88 Correct 10 ms 14680 KB Output is correct
89 Correct 10 ms 14680 KB Output is correct
90 Correct 11 ms 16728 KB Output is correct
91 Correct 2 ms 14680 KB Output is correct
92 Correct 2 ms 14680 KB Output is correct
93 Correct 12 ms 14680 KB Output is correct
94 Correct 11 ms 14680 KB Output is correct
95 Correct 9 ms 14680 KB Output is correct
96 Correct 10 ms 14680 KB Output is correct
97 Correct 12 ms 16728 KB Output is correct
98 Correct 2 ms 14680 KB Output is correct
99 Correct 36 ms 21440 KB Output is correct
100 Correct 37 ms 21376 KB Output is correct
101 Correct 22 ms 21184 KB Output is correct
102 Correct 32 ms 21432 KB Output is correct
103 Correct 26 ms 21700 KB Output is correct
104 Correct 22 ms 21440 KB Output is correct
105 Correct 2 ms 14680 KB Output is correct
106 Correct 19 ms 18520 KB Output is correct
107 Correct 35 ms 21620 KB Output is correct
108 Correct 27 ms 21176 KB Output is correct
109 Correct 39 ms 21440 KB Output is correct
110 Correct 28 ms 21684 KB Output is correct
111 Correct 23 ms 21676 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 504 ms 20184 KB Output is correct
4 Execution timed out 4003 ms 21164 KB Time limit exceeded
5 Halted 0 ms 0 KB -