oj.uz

Submission #979262

# Submission time Handle Problem Language Result Execution time Memory
979262 2024-05-10T12:35:28 Z sleepntsheep Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 800 ms 21960 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;
        /*
         * 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;)
            {
                if(H[jj_[u]]<=H[D])u=jj_[u];
                else if(H[pp_[u]]<=H[D])u=pp_[u];
                else break;
            }
        }
        return zz;
    }

    return -1;
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:180:21: warning: variable 'u1' set but not used [-Wunused-but-set-variable]
  180 |             int u=A,u1;
      |                     ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14844 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 95 ms 19900 KB Output is correct
4 Correct 774 ms 21184 KB Output is correct
5 Correct 715 ms 17984 KB Output is correct
6 Correct 756 ms 21168 KB Output is correct
7 Correct 624 ms 19148 KB Output is correct
8 Correct 772 ms 21188 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory 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 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

# Verdict Execution time Memory 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 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14680 KB Output is correct
3 Correct 2 ms 16884 KB Output is correct
4 Correct 2 ms 16728 KB Output is correct
5 Correct 31 ms 19900 KB Output is correct
6 Correct 39 ms 21212 KB Output is correct
7 Correct 22 ms 18012 KB Output is correct
8 Correct 33 ms 21448 KB Output is correct
9 Correct 7 ms 15704 KB Output is correct
10 Correct 41 ms 21212 KB Output is correct
11 Correct 28 ms 21180 KB Output is correct
12 Incorrect 28 ms 21444 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 16724 KB Output is correct
3 Correct 3 ms 16884 KB Output is correct
4 Correct 167 ms 17992 KB Output is correct
5 Correct 566 ms 21280 KB Output is correct
6 Correct 399 ms 15960 KB Output is correct
7 Correct 569 ms 21328 KB Output is correct
8 Correct 434 ms 17084 KB Output is correct
9 Correct 689 ms 21232 KB Output is correct
10 Correct 745 ms 21184 KB Output is correct
11 Correct 779 ms 21836 KB Output is correct
12 Correct 747 ms 21188 KB Output is correct
13 Correct 697 ms 21444 KB Output is correct
14 Correct 722 ms 21700 KB Output is correct
15 Correct 655 ms 21492 KB Output is correct
16 Correct 661 ms 21440 KB Output is correct
17 Correct 3 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 3 ms 14680 KB Output is correct
20 Correct 3 ms 14680 KB Output is correct
21 Correct 3 ms 14680 KB Output is correct
22 Correct 3 ms 14680 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 3 ms 16728 KB Output is correct
25 Correct 2 ms 14800 KB Output is correct
26 Correct 2 ms 14680 KB Output is correct
27 Correct 12 ms 14680 KB Output is correct
28 Correct 13 ms 14840 KB Output is correct
29 Correct 16 ms 14680 KB Output is correct
30 Correct 13 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 21 ms 18560 KB Output is correct
34 Correct 37 ms 21416 KB Output is correct
35 Correct 22 ms 21164 KB Output is correct
36 Correct 33 ms 21440 KB Output is correct
37 Correct 29 ms 21692 KB Output is correct
38 Correct 27 ms 21700 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 16724 KB Output is correct
3 Correct 3 ms 16884 KB Output is correct
4 Correct 167 ms 17992 KB Output is correct
5 Correct 566 ms 21280 KB Output is correct
6 Correct 399 ms 15960 KB Output is correct
7 Correct 569 ms 21328 KB Output is correct
8 Correct 434 ms 17084 KB Output is correct
9 Correct 689 ms 21232 KB Output is correct
10 Correct 745 ms 21184 KB Output is correct
11 Correct 779 ms 21836 KB Output is correct
12 Correct 747 ms 21188 KB Output is correct
13 Correct 697 ms 21444 KB Output is correct
14 Correct 722 ms 21700 KB Output is correct
15 Correct 655 ms 21492 KB Output is correct
16 Correct 661 ms 21440 KB Output is correct
17 Correct 3 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 3 ms 14680 KB Output is correct
20 Correct 3 ms 14680 KB Output is correct
21 Correct 3 ms 14680 KB Output is correct
22 Correct 3 ms 14680 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 3 ms 16728 KB Output is correct
25 Correct 2 ms 14800 KB Output is correct
26 Correct 2 ms 14680 KB Output is correct
27 Correct 12 ms 14680 KB Output is correct
28 Correct 13 ms 14840 KB Output is correct
29 Correct 16 ms 14680 KB Output is correct
30 Correct 13 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 21 ms 18560 KB Output is correct
34 Correct 37 ms 21416 KB Output is correct
35 Correct 22 ms 21164 KB Output is correct
36 Correct 33 ms 21440 KB Output is correct
37 Correct 29 ms 21692 KB Output is correct
38 Correct 27 ms 21700 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 16748 KB Output is correct
42 Correct 143 ms 17948 KB Output is correct
43 Correct 702 ms 21436 KB Output is correct
44 Correct 484 ms 15928 KB Output is correct
45 Correct 726 ms 21404 KB Output is correct
46 Correct 410 ms 17124 KB Output is correct
47 Correct 687 ms 21436 KB Output is correct
48 Correct 771 ms 21192 KB Output is correct
49 Correct 756 ms 21960 KB Output is correct
50 Correct 756 ms 21188 KB Output is correct
51 Correct 725 ms 21424 KB Output is correct
52 Correct 800 ms 21692 KB Output is correct
53 Correct 707 ms 21436 KB Output is correct
54 Correct 662 ms 21440 KB Output is correct
55 Correct 2 ms 16844 KB Output is correct
56 Correct 63 ms 21420 KB Output is correct
57 Correct 586 ms 21448 KB Output is correct
58 Correct 292 ms 15960 KB Output is correct
59 Correct 578 ms 21420 KB Output is correct
60 Correct 241 ms 17112 KB Output is correct
61 Correct 578 ms 21216 KB Output is correct
62 Correct 767 ms 21184 KB Output is correct
63 Correct 709 ms 21444 KB Output is correct
64 Correct 774 ms 21184 KB Output is correct
65 Correct 648 ms 21436 KB Output is correct
66 Correct 690 ms 21692 KB Output is correct
67 Correct 591 ms 21700 KB Output is correct
68 Correct 593 ms 21440 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 3 ms 14680 KB Output is correct
74 Correct 2 ms 14764 KB Output is correct
75 Correct 3 ms 16984 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 2 ms 14680 KB Output is correct
80 Correct 3 ms 14680 KB Output is correct
81 Correct 3 ms 14680 KB Output is correct
82 Correct 3 ms 14804 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 14 ms 14680 KB Output is correct
87 Correct 9 ms 14932 KB Output is correct
88 Correct 10 ms 14680 KB Output is correct
89 Correct 11 ms 14680 KB Output is correct
90 Correct 13 ms 16880 KB Output is correct
91 Correct 2 ms 14680 KB Output is correct
92 Correct 2 ms 14680 KB Output is correct
93 Correct 10 ms 14680 KB Output is correct
94 Correct 11 ms 14680 KB Output is correct
95 Correct 12 ms 14680 KB Output is correct
96 Correct 13 ms 14680 KB Output is correct
97 Correct 10 ms 16728 KB Output is correct
98 Correct 2 ms 14680 KB Output is correct
99 Correct 31 ms 21444 KB Output is correct
100 Correct 51 ms 21216 KB Output is correct
101 Correct 28 ms 21196 KB Output is correct
102 Correct 38 ms 21432 KB Output is correct
103 Correct 35 ms 21688 KB Output is correct
104 Correct 24 ms 21444 KB Output is correct
105 Correct 2 ms 15188 KB Output is correct
106 Correct 20 ms 18544 KB Output is correct
107 Correct 36 ms 21424 KB Output is correct
108 Correct 26 ms 21164 KB Output is correct
109 Correct 32 ms 21436 KB Output is correct
110 Correct 26 ms 21708 KB Output is correct
111 Correct 23 ms 21700 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14844 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 95 ms 19900 KB Output is correct
4 Correct 774 ms 21184 KB Output is correct
5 Correct 715 ms 17984 KB Output is correct
6 Correct 756 ms 21168 KB Output is correct
7 Correct 624 ms 19148 KB Output is correct
8 Correct 772 ms 21188 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 16728 KB Output is correct
12 Correct 2 ms 16728 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Incorrect 3 ms 14680 KB Output isn't correct
15 Halted 0 ms 0 KB -