oj.uz

Submission #887874

# Submission time Handle Problem Language Result Execution time Memory
887874 2023-12-15T11:26:11 Z 1L1YA Rainforest Jumps (APIO21_jumps) C++17
60 / 100
 1550 ms 47552 KB 
//1L1YA
#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
#define ll           long long
#define Pb           push_back
#define dokme(x)     cout << x << endl, exit(0)
#define pii          pair<int,int>
#define F            first
#define S            second
#define endl         '\n'
#define sep          ' '
#define all(x)       x.begin(),x.end()
#define FastIO       ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define lc           id<<1
#define rc           lc|1

const int N=2e5+5;
const int lg=23;

int n,a[N],lst[N],nxt[N],sp1[lg][N],sp2[lg][N];
pii seg[N<<2];

void modify(int pos,int val,int id=1,int l=1,int r=n+1){
    if(r-l==1){
        seg[id]={val,pos};
        return;
    }
    int mid=l+r>>1;
    if(pos<mid)    modify(pos,val,lc,l,mid);
    else    modify(pos,val,rc,mid,r);
    if(seg[lc].F>seg[rc].F)    seg[id]=seg[lc];
    else    seg[id]=seg[rc];
}

pii get(int ql,int qr,int id=1,int l=1,int r=n+1){
    if(qr<=l || ql>=r)    return {0,0};
    if(ql<=l && r<=qr)    return seg[id];
    int mid=l+r>>1;
    pii p1=get(ql,qr,lc,l,mid),p2=get(ql,qr,rc,mid,r);
    if(p1.F>p2.F)     return p1;
    else    return p2;
}

void init(int m, std::vector<int> h) {
    n=m;
    for(int i=1;i<=n;i++)
        a[i]=h[i-1];
    a[0]=a[n+1]=n+1;
    vector<int> st;
    st.Pb(0);
    for(int i=1;i<=n;i++){
        while(a[st.back()]<a[i])
            st.pop_back();
        lst[i]=st.back();
        st.Pb(i);
    }
    st.clear();
    st.Pb(n+1);
    for(int i=n;i;i--){
        while(a[st.back()]<a[i])
            st.pop_back();
        nxt[i]=st.back();
        st.Pb(i);
    }
    for(int i=1;i<=n;i++){
        sp1[0][a[i]]=min(a[lst[i]],a[nxt[i]]);
        sp2[0][a[i]]=max(a[lst[i]],a[nxt[i]]);
    }
    sp1[0][n+1]=sp2[0][n+1]=n+1;
    for(int i=n+1;i;i--)
        for(int j=1;j<lg;j++){
            sp1[j][i]=sp1[j-1][sp1[j-1][i]];
            sp2[j][i]=sp2[j-1][sp2[j-1][i]];
        }
    for(int i=1;i<=n;i++)
        modify(i,a[i]);
}

int dist(int s,int e){
    int ans=0;
    for(int i=lg-1;~i;i--)
        if(sp2[i][s]<e)
            s=sp2[i][s],ans+=1<<i;
    if(sp2[0][s]==e)
        return ans+1;
    for(int i=lg-1;~i;i--)
        if(sp1[i][s]<e)
            s=sp1[i][s],ans+=1<<i;
    return ans+1;
}

int minimum_jumps(int l1, int r1, int l2, int r2){
    l1++;r1++;l2++;r2++;
    int mx=get(l2,r2+1).F;
    if(get(r1,l2).F>mx)
        return -1;
    int l=0,r=r1;
    while(r-l>1){
        int mid=l+r>>1;
        if(get(mid,r1+1).F<mx)    r=mid;
        else    l=mid;
    }
    int k=r,x=get(max(l1,k),r1+1).S,mxx=mx;
    mx=get(max(l1,k),l2).F;
    l=l2-1,r=r2;
    while(r-l>1){
        int mid=l+r>>1;
        if(get(l2,mid+1).F<mx)    l=mid;
        else    r=mid;
    }
    int ans=dist(a[x],a[r]);
    if(k<l1 && get(1,l1).F>mx){
        l=1,r=l1;
        while(r-l>1){
            int mid=l+r>>1;
            if(get(mid,l1).F<mx)    r=mid;
            else    l=mid;
        }
        if(l>k)
            ans=min(ans,dist(a[x],a[l])+1);
    }
    return ans;
}
/*
int main() {
  int N, Q;
  assert(2 == scanf("%d %d", &N, &Q));
  std::vector<int> H(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &H[i]));
  }
  init(N, H);

  for (int i = 0; i < Q; ++i) {
    int A, B, C, D;
    assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
    printf("%d\n", minimum_jumps(A, B, C, D));
  }
  return 0;
}*/

Compilation message

jumps.cpp: In function 'void modify(int, int, int, int, int)':
jumps.cpp:29:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |     int mid=l+r>>1;
      |             ~^~
jumps.cpp: In function 'std::pair<int, int> get(int, int, int, int, int)':
jumps.cpp:39:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |     int mid=l+r>>1;
      |             ~^~
jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:100:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  100 |         int mid=l+r>>1;
      |                 ~^~
jumps.cpp:108:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  108 |         int mid=l+r>>1;
      |                 ~^~
jumps.cpp:116:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  116 |             int mid=l+r>>1;
      |                     ~^~
jumps.cpp:104:37: warning: unused variable 'mxx' [-Wunused-variable]
  104 |     int k=r,x=get(max(l1,k),r1+1).S,mxx=mx;
      |                                     ^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 39256 KB Output is correct
2 Correct 4 ms 39388 KB Output is correct
3 Correct 182 ms 46472 KB Output is correct
4 Correct 1507 ms 47432 KB Output is correct
5 Correct 1196 ms 43380 KB Output is correct
6 Correct 1470 ms 47368 KB Output is correct
7 Correct 1095 ms 46152 KB Output is correct
8 Correct 1550 ms 47348 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 39256 KB Output is correct
2 Correct 4 ms 39256 KB Output is correct
3 Correct 4 ms 39256 KB Output is correct
4 Correct 4 ms 39256 KB Output is correct
5 Correct 5 ms 39256 KB Output is correct
6 Correct 5 ms 39252 KB Output is correct
7 Correct 5 ms 39256 KB Output is correct
8 Correct 5 ms 39256 KB Output is correct
9 Correct 4 ms 39256 KB Output is correct
10 Correct 6 ms 39256 KB Output is correct
11 Correct 5 ms 39256 KB Output is correct
12 Correct 5 ms 39256 KB Output is correct
13 Correct 5 ms 39256 KB Output is correct
14 Correct 5 ms 39256 KB Output is correct
15 Correct 6 ms 39256 KB Output is correct
16 Incorrect 5 ms 39508 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 39256 KB Output is correct
2 Correct 4 ms 39256 KB Output is correct
3 Correct 4 ms 39256 KB Output is correct
4 Correct 4 ms 39256 KB Output is correct
5 Correct 5 ms 39256 KB Output is correct
6 Correct 5 ms 39252 KB Output is correct
7 Correct 5 ms 39256 KB Output is correct
8 Correct 5 ms 39256 KB Output is correct
9 Correct 4 ms 39256 KB Output is correct
10 Correct 6 ms 39256 KB Output is correct
11 Correct 5 ms 39256 KB Output is correct
12 Correct 5 ms 39256 KB Output is correct
13 Correct 5 ms 39256 KB Output is correct
14 Correct 5 ms 39256 KB Output is correct
15 Correct 6 ms 39256 KB Output is correct
16 Incorrect 5 ms 39508 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 39256 KB Output is correct
2 Correct 4 ms 39256 KB Output is correct
3 Correct 5 ms 39256 KB Output is correct
4 Correct 5 ms 39256 KB Output is correct
5 Correct 54 ms 45824 KB Output is correct
6 Correct 67 ms 46436 KB Output is correct
7 Correct 34 ms 42824 KB Output is correct
8 Correct 69 ms 46428 KB Output is correct
9 Correct 15 ms 41924 KB Output is correct
10 Correct 67 ms 46708 KB Output is correct
11 Correct 55 ms 47424 KB Output is correct
12 Correct 63 ms 47148 KB Output is correct
13 Correct 57 ms 47056 KB Output is correct
14 Correct 64 ms 46536 KB Output is correct
15 Correct 48 ms 46928 KB Output is correct
16 Correct 55 ms 47300 KB Output is correct
17 Correct 51 ms 47424 KB Output is correct
18 Correct 4 ms 39256 KB Output is correct
19 Correct 4 ms 39256 KB Output is correct
20 Correct 4 ms 39256 KB Output is correct
21 Correct 4 ms 39256 KB Output is correct
22 Correct 4 ms 39256 KB Output is correct
23 Correct 4 ms 39256 KB Output is correct
24 Correct 4 ms 39368 KB Output is correct
25 Correct 4 ms 39256 KB Output is correct
26 Correct 4 ms 39256 KB Output is correct
27 Correct 5 ms 39436 KB Output is correct
28 Correct 5 ms 39252 KB Output is correct
29 Correct 5 ms 39256 KB Output is correct
30 Correct 5 ms 39256 KB Output is correct
31 Correct 5 ms 39256 KB Output is correct
32 Correct 4 ms 39256 KB Output is correct
33 Correct 70 ms 46516 KB Output is correct
34 Correct 69 ms 46516 KB Output is correct
35 Correct 55 ms 47168 KB Output is correct
36 Correct 66 ms 46560 KB Output is correct
37 Correct 49 ms 46972 KB Output is correct
38 Correct 54 ms 47552 KB Output is correct
39 Correct 4 ms 39256 KB Output is correct
40 Correct 38 ms 43256 KB Output is correct
41 Correct 66 ms 46448 KB Output is correct
42 Correct 54 ms 47352 KB Output is correct
43 Correct 80 ms 46444 KB Output is correct
44 Correct 49 ms 47096 KB Output is correct
45 Correct 62 ms 47296 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 39256 KB Output is correct
2 Correct 4 ms 39256 KB Output is correct
3 Correct 4 ms 39412 KB Output is correct
4 Correct 165 ms 42784 KB Output is correct
5 Correct 658 ms 46596 KB Output is correct
6 Correct 420 ms 42024 KB Output is correct
7 Correct 676 ms 46536 KB Output is correct
8 Correct 377 ms 42296 KB Output is correct
9 Correct 666 ms 46520 KB Output is correct
10 Correct 1235 ms 47404 KB Output is correct
11 Correct 1451 ms 47416 KB Output is correct
12 Correct 1163 ms 47416 KB Output is correct
13 Correct 652 ms 46540 KB Output is correct
14 Correct 1352 ms 46916 KB Output is correct
15 Correct 751 ms 47420 KB Output is correct
16 Correct 693 ms 47428 KB Output is correct
17 Correct 5 ms 39256 KB Output is correct
18 Correct 5 ms 39256 KB Output is correct
19 Correct 5 ms 39256 KB Output is correct
20 Correct 5 ms 39256 KB Output is correct
21 Correct 5 ms 39256 KB Output is correct
22 Correct 5 ms 39256 KB Output is correct
23 Correct 5 ms 39256 KB Output is correct
24 Correct 5 ms 39392 KB Output is correct
25 Correct 5 ms 39256 KB Output is correct
26 Correct 4 ms 39380 KB Output is correct
27 Correct 14 ms 39256 KB Output is correct
28 Correct 20 ms 39256 KB Output is correct
29 Correct 13 ms 39256 KB Output is correct
30 Correct 19 ms 39256 KB Output is correct
31 Correct 16 ms 39256 KB Output is correct
32 Correct 4 ms 39256 KB Output is correct
33 Correct 39 ms 43072 KB Output is correct
34 Correct 72 ms 46520 KB Output is correct
35 Correct 55 ms 47164 KB Output is correct
36 Correct 69 ms 46416 KB Output is correct
37 Correct 55 ms 46892 KB Output is correct
38 Correct 54 ms 47416 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 39256 KB Output is correct
2 Correct 4 ms 39256 KB Output is correct
3 Correct 4 ms 39412 KB Output is correct
4 Correct 165 ms 42784 KB Output is correct
5 Correct 658 ms 46596 KB Output is correct
6 Correct 420 ms 42024 KB Output is correct
7 Correct 676 ms 46536 KB Output is correct
8 Correct 377 ms 42296 KB Output is correct
9 Correct 666 ms 46520 KB Output is correct
10 Correct 1235 ms 47404 KB Output is correct
11 Correct 1451 ms 47416 KB Output is correct
12 Correct 1163 ms 47416 KB Output is correct
13 Correct 652 ms 46540 KB Output is correct
14 Correct 1352 ms 46916 KB Output is correct
15 Correct 751 ms 47420 KB Output is correct
16 Correct 693 ms 47428 KB Output is correct
17 Correct 5 ms 39256 KB Output is correct
18 Correct 5 ms 39256 KB Output is correct
19 Correct 5 ms 39256 KB Output is correct
20 Correct 5 ms 39256 KB Output is correct
21 Correct 5 ms 39256 KB Output is correct
22 Correct 5 ms 39256 KB Output is correct
23 Correct 5 ms 39256 KB Output is correct
24 Correct 5 ms 39392 KB Output is correct
25 Correct 5 ms 39256 KB Output is correct
26 Correct 4 ms 39380 KB Output is correct
27 Correct 14 ms 39256 KB Output is correct
28 Correct 20 ms 39256 KB Output is correct
29 Correct 13 ms 39256 KB Output is correct
30 Correct 19 ms 39256 KB Output is correct
31 Correct 16 ms 39256 KB Output is correct
32 Correct 4 ms 39256 KB Output is correct
33 Correct 39 ms 43072 KB Output is correct
34 Correct 72 ms 46520 KB Output is correct
35 Correct 55 ms 47164 KB Output is correct
36 Correct 69 ms 46416 KB Output is correct
37 Correct 55 ms 46892 KB Output is correct
38 Correct 54 ms 47416 KB Output is correct
39 Correct 4 ms 39256 KB Output is correct
40 Correct 4 ms 39256 KB Output is correct
41 Correct 4 ms 39400 KB Output is correct
42 Correct 152 ms 42796 KB Output is correct
43 Correct 640 ms 46520 KB Output is correct
44 Correct 425 ms 41816 KB Output is correct
45 Correct 683 ms 46524 KB Output is correct
46 Correct 384 ms 42400 KB Output is correct
47 Correct 700 ms 46536 KB Output is correct
48 Correct 1255 ms 47364 KB Output is correct
49 Correct 1486 ms 47436 KB Output is correct
50 Correct 1148 ms 47404 KB Output is correct
51 Correct 666 ms 46444 KB Output is correct
52 Correct 1380 ms 47144 KB Output is correct
53 Correct 766 ms 47360 KB Output is correct
54 Correct 674 ms 47364 KB Output is correct
55 Correct 4 ms 39256 KB Output is correct
56 Correct 100 ms 46428 KB Output is correct
57 Correct 672 ms 46416 KB Output is correct
58 Correct 317 ms 42060 KB Output is correct
59 Correct 679 ms 46536 KB Output is correct
60 Correct 272 ms 42432 KB Output is correct
61 Correct 665 ms 46612 KB Output is correct
62 Correct 1253 ms 47404 KB Output is correct
63 Correct 1179 ms 47324 KB Output is correct
64 Correct 1112 ms 47428 KB Output is correct
65 Correct 687 ms 46536 KB Output is correct
66 Correct 1270 ms 47112 KB Output is correct
67 Correct 992 ms 47524 KB Output is correct
68 Correct 678 ms 47340 KB Output is correct
69 Correct 4 ms 39256 KB Output is correct
70 Correct 4 ms 39256 KB Output is correct
71 Correct 5 ms 39256 KB Output is correct
72 Correct 5 ms 39256 KB Output is correct
73 Correct 6 ms 39256 KB Output is correct
74 Correct 5 ms 39256 KB Output is correct
75 Correct 5 ms 39256 KB Output is correct
76 Correct 4 ms 39256 KB Output is correct
77 Correct 4 ms 39380 KB Output is correct
78 Correct 5 ms 39256 KB Output is correct
79 Correct 5 ms 39256 KB Output is correct
80 Correct 5 ms 39256 KB Output is correct
81 Correct 5 ms 39256 KB Output is correct
82 Correct 5 ms 39256 KB Output is correct
83 Correct 5 ms 39256 KB Output is correct
84 Correct 4 ms 39256 KB Output is correct
85 Correct 6 ms 39256 KB Output is correct
86 Correct 14 ms 39256 KB Output is correct
87 Correct 16 ms 39256 KB Output is correct
88 Correct 15 ms 39256 KB Output is correct
89 Correct 21 ms 39256 KB Output is correct
90 Correct 14 ms 39256 KB Output is correct
91 Correct 4 ms 39256 KB Output is correct
92 Correct 5 ms 39256 KB Output is correct
93 Correct 13 ms 39256 KB Output is correct
94 Correct 17 ms 39256 KB Output is correct
95 Correct 15 ms 39256 KB Output is correct
96 Correct 21 ms 39256 KB Output is correct
97 Correct 15 ms 39256 KB Output is correct
98 Correct 4 ms 39256 KB Output is correct
99 Correct 77 ms 46420 KB Output is correct
100 Correct 66 ms 46572 KB Output is correct
101 Correct 59 ms 47148 KB Output is correct
102 Correct 65 ms 46536 KB Output is correct
103 Correct 47 ms 47004 KB Output is correct
104 Correct 52 ms 47408 KB Output is correct
105 Correct 4 ms 39256 KB Output is correct
106 Correct 38 ms 43132 KB Output is correct
107 Correct 66 ms 46424 KB Output is correct
108 Correct 61 ms 47400 KB Output is correct
109 Correct 65 ms 46568 KB Output is correct
110 Correct 48 ms 46900 KB Output is correct
111 Correct 61 ms 47420 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 39256 KB Output is correct
2 Correct 4 ms 39388 KB Output is correct
3 Correct 182 ms 46472 KB Output is correct
4 Correct 1507 ms 47432 KB Output is correct
5 Correct 1196 ms 43380 KB Output is correct
6 Correct 1470 ms 47368 KB Output is correct
7 Correct 1095 ms 46152 KB Output is correct
8 Correct 1550 ms 47348 KB Output is correct
9 Correct 5 ms 39256 KB Output is correct
10 Correct 4 ms 39256 KB Output is correct
11 Correct 4 ms 39256 KB Output is correct
12 Correct 4 ms 39256 KB Output is correct
13 Correct 5 ms 39256 KB Output is correct
14 Correct 5 ms 39252 KB Output is correct
15 Correct 5 ms 39256 KB Output is correct
16 Correct 5 ms 39256 KB Output is correct
17 Correct 4 ms 39256 KB Output is correct
18 Correct 6 ms 39256 KB Output is correct
19 Correct 5 ms 39256 KB Output is correct
20 Correct 5 ms 39256 KB Output is correct
21 Correct 5 ms 39256 KB Output is correct
22 Correct 5 ms 39256 KB Output is correct
23 Correct 6 ms 39256 KB Output is correct
24 Incorrect 5 ms 39508 KB Output isn't correct
25 Halted 0 ms 0 KB -