oj.uz

Submission #413366

# Submission time Handle Problem Language Result Execution time Memory
413366 2021-05-28T14:57:26 Z mat_v Rainforest Jumps (APIO21_jumps) C++14
33 / 100
 4000 ms 51144 KB 
#include "jumps.h"
#include <bits/stdc++.h>
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))

using namespace std;

int n;
int niz[200005];
int levo[200005][20];
int desno[200005][20];
int pravi[200005][20];
int poz[200005];

void init(int N, std::vector<int> H) {
    n = N;
    ff(i,0,n - 1){
        niz[i + 1] = H[i];
        poz[niz[i + 1]] = i+1;
    }
    stack<int> s;
    ff(i,1,n){
        while(!s.empty() && niz[s.top()] < niz[i])s.pop();
        if(!s.empty())levo[i][0] = s.top();
        s.push(i);
    }
    while(!s.empty())s.pop();
    fb(i,n,1){
        while(!s.empty() && niz[s.top()] < niz[i])s.pop();
        if(!s.empty())desno[i][0] = s.top();
        s.push(i);
    }
    fb(i,n,1){
        ff(j,1,18)desno[i][j] = desno[desno[i][j - 1]][j - 1];
    }
    ff(i,1,n){
        ff(j,1,18)levo[i][j] = levo[levo[i][j - 1]][j - 1];
    }
    fb(i,n - 1,1){
        int sta = poz[i];
        int lv = levo[sta][0], rv = desno[sta][0];
        if(niz[lv] > niz[rv])pravi[sta][0] = lv;
        else pravi[sta][0] = rv;
        ff(j,1,18)pravi[sta][j] = pravi[pravi[sta][j - 1]][j - 1];
    }

}

int dist(int x, int y){
    if(niz[y] < niz[x])return -1;
    int ans = 0;
    int lv = x;
    int poc = y;
    fb(j,18,0){
        if(pravi[lv][j] && niz[pravi[lv][j]] < niz[poc]){
            ans += (1<<j);
            lv = pravi[lv][j];
        }
    }
    fb(j,18,0){
        if(desno[lv][j] && niz[desno[lv][j]] < niz[poc]){
            ans += (1<<j);
            lv = desno[lv][j];
        }
    }
    if(desno[lv][0] == poc)return ans+1;
    return -1;
}

int minimum_jumps(int A, int B, int C, int D) {
    A++;
    B++;
    C++;
    D++;
    int l1,r1,l2,r2;
    l1 = A, r1 = B, l2 = C, r2 = D;
    int tr = l2;
    fb(j,18,0){
        if(desno[tr][j] && desno[tr][j] <= r2)tr = desno[tr][j];
    }
    int val = niz[tr];

    int lv = r1;
    fb(j,18,0){
        if(levo[lv][j] && levo[lv][j] >= l1 && niz[levo[lv][j]] < val)lv = levo[lv][j];
    }
    if(niz[lv] > val)return -1;

    int ans = 1e9;

    ff(j,l2,r2){
        if(dist(lv,j) > 0)ans = min(ans, dist(lv,j));
    }
    if(ans == 1e9)return -1;

    int mks = 0;
    int idx = 0;

    idx = r1;
    fb(j,18,0){
        if(desno[idx][j] && desno[idx][j] <= l2-1)idx = desno[idx][j];
    }
    mks = niz[idx];
    ff(j,r1,l2-1){
        if(niz[j] > niz[idx])idx = j;
    }
    mks = niz[idx];
    if(mks > val)return -1;
    if(mks <= niz[lv])return 1;
    int p1 = dist(lv, idx) + 1;
    int p2 = 0;
    fb(j,18,0){
        if(pravi[lv][j] && niz[pravi[lv][j]] < mks){
            lv = pravi[lv][j];
            p2 += (1<<j);
        }
    }
    if(levo[lv][0] && niz[levo[lv][0]] < val)p1 = min(p1, p2+2);


    return p1;
}
/*
7 3
3 2 1 6 4 5 7
4 4 6 6
1 3 5 6
0 1 2 2

*/

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:17:5: note: in expansion of macro 'ff'
   17 |     ff(i,0,n - 1){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:22:5: note: in expansion of macro 'ff'
   22 |     ff(i,1,n){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:28:5: note: in expansion of macro 'fb'
   28 |     fb(i,n,1){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:33:5: note: in expansion of macro 'fb'
   33 |     fb(i,n,1){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:34:9: note: in expansion of macro 'ff'
   34 |         ff(j,1,18)desno[i][j] = desno[desno[i][j - 1]][j - 1];
      |         ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:36:5: note: in expansion of macro 'ff'
   36 |     ff(i,1,n){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:37:9: note: in expansion of macro 'ff'
   37 |         ff(j,1,18)levo[i][j] = levo[levo[i][j - 1]][j - 1];
      |         ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:39:5: note: in expansion of macro 'fb'
   39 |     fb(i,n - 1,1){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:44:9: note: in expansion of macro 'ff'
   44 |         ff(j,1,18)pravi[sta][j] = pravi[pravi[sta][j - 1]][j - 1];
      |         ^~
jumps.cpp: In function 'int dist(int, int)':
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:54:5: note: in expansion of macro 'fb'
   54 |     fb(j,18,0){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:60:5: note: in expansion of macro 'fb'
   60 |     fb(j,18,0){
      |     ^~
jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:78:5: note: in expansion of macro 'fb'
   78 |     fb(j,18,0){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:84:5: note: in expansion of macro 'fb'
   84 |     fb(j,18,0){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:91:5: note: in expansion of macro 'ff'
   91 |     ff(j,l2,r2){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:100:5: note: in expansion of macro 'fb'
  100 |     fb(j,18,0){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:104:5: note: in expansion of macro 'ff'
  104 |     ff(j,r1,l2-1){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:112:5: note: in expansion of macro 'fb'
  112 |     fb(j,18,0){
      |     ^~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Execution timed out 4088 ms 40744 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 5 ms 328 KB Output is correct
7 Correct 4 ms 328 KB Output is correct
8 Correct 3 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 3 ms 320 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Correct 3 ms 328 KB Output is correct
16 Correct 4 ms 328 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 4 ms 328 KB Output is correct
24 Correct 7 ms 292 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 3 ms 200 KB Output is correct
28 Correct 4 ms 328 KB Output is correct
29 Correct 2 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 2 ms 328 KB Output is correct
32 Correct 3 ms 328 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 5 ms 328 KB Output is correct
7 Correct 4 ms 328 KB Output is correct
8 Correct 3 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 3 ms 320 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Correct 3 ms 328 KB Output is correct
16 Correct 4 ms 328 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 4 ms 328 KB Output is correct
24 Correct 7 ms 292 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 3 ms 200 KB Output is correct
28 Correct 4 ms 328 KB Output is correct
29 Correct 2 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 2 ms 328 KB Output is correct
32 Correct 3 ms 328 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 1 ms 200 KB Output is correct
43 Correct 1 ms 200 KB Output is correct
44 Correct 4 ms 232 KB Output is correct
45 Correct 2 ms 328 KB Output is correct
46 Correct 3 ms 328 KB Output is correct
47 Correct 3 ms 328 KB Output is correct
48 Correct 2 ms 328 KB Output is correct
49 Correct 4 ms 328 KB Output is correct
50 Correct 4 ms 328 KB Output is correct
51 Correct 4 ms 328 KB Output is correct
52 Correct 4 ms 328 KB Output is correct
53 Correct 4 ms 328 KB Output is correct
54 Correct 3 ms 328 KB Output is correct
55 Correct 4 ms 328 KB Output is correct
56 Correct 5 ms 328 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 24 ms 712 KB Output is correct
59 Correct 31 ms 712 KB Output is correct
60 Correct 9 ms 456 KB Output is correct
61 Correct 21 ms 712 KB Output is correct
62 Correct 21 ms 328 KB Output is correct
63 Correct 35 ms 712 KB Output is correct
64 Correct 91 ms 712 KB Output is correct
65 Correct 78 ms 712 KB Output is correct
66 Correct 66 ms 712 KB Output is correct
67 Correct 26 ms 712 KB Output is correct
68 Correct 46 ms 764 KB Output is correct
69 Correct 36 ms 712 KB Output is correct
70 Correct 59 ms 712 KB Output is correct
71 Correct 1 ms 200 KB Output is correct
72 Correct 1 ms 328 KB Output is correct
73 Correct 5 ms 328 KB Output is correct
74 Correct 2 ms 328 KB Output is correct
75 Correct 2 ms 328 KB Output is correct
76 Correct 4 ms 328 KB Output is correct
77 Correct 4 ms 328 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 3 ms 200 KB Output is correct
81 Correct 4 ms 328 KB Output is correct
82 Correct 2 ms 328 KB Output is correct
83 Correct 4 ms 328 KB Output is correct
84 Correct 4 ms 328 KB Output is correct
85 Correct 3 ms 328 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 1 ms 328 KB Output is correct
88 Correct 2 ms 328 KB Output is correct
89 Correct 1 ms 328 KB Output is correct
90 Correct 1 ms 328 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 328 KB Output is correct
93 Correct 1 ms 328 KB Output is correct
94 Correct 4 ms 328 KB Output is correct
95 Correct 28 ms 712 KB Output is correct
96 Correct 39 ms 712 KB Output is correct
97 Correct 19 ms 712 KB Output is correct
98 Correct 22 ms 712 KB Output is correct
99 Correct 20 ms 712 KB Output is correct
100 Correct 1 ms 328 KB Output is correct
101 Correct 2 ms 456 KB Output is correct
102 Correct 29 ms 712 KB Output is correct
103 Correct 31 ms 712 KB Output is correct
104 Correct 20 ms 712 KB Output is correct
105 Correct 34 ms 712 KB Output is correct
106 Correct 17 ms 712 KB Output is correct
107 Correct 1 ms 328 KB Output is correct
108 Correct 2 ms 456 KB Output is correct
109 Correct 2 ms 712 KB Output is correct
110 Correct 2 ms 712 KB Output is correct
111 Correct 2 ms 712 KB Output is correct
112 Correct 2 ms 712 KB Output is correct
113 Correct 2 ms 712 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 122 ms 40604 KB Output is correct
6 Correct 163 ms 50388 KB Output is correct
7 Correct 72 ms 25868 KB Output is correct
8 Correct 144 ms 50384 KB Output is correct
9 Correct 20 ms 7792 KB Output is correct
10 Correct 153 ms 50344 KB Output is correct
11 Correct 107 ms 51116 KB Output is correct
12 Correct 107 ms 50992 KB Output is correct
13 Correct 118 ms 50916 KB Output is correct
14 Correct 127 ms 50380 KB Output is correct
15 Correct 121 ms 50672 KB Output is correct
16 Correct 102 ms 50984 KB Output is correct
17 Correct 122 ms 51008 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 2 ms 712 KB Output is correct
28 Correct 2 ms 712 KB Output is correct
29 Correct 2 ms 712 KB Output is correct
30 Correct 2 ms 712 KB Output is correct
31 Correct 2 ms 816 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 141 ms 50300 KB Output is correct
34 Correct 161 ms 50380 KB Output is correct
35 Correct 115 ms 50984 KB Output is correct
36 Correct 145 ms 50480 KB Output is correct
37 Correct 133 ms 50688 KB Output is correct
38 Correct 98 ms 51088 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 85 ms 29396 KB Output is correct
41 Correct 149 ms 50332 KB Output is correct
42 Correct 110 ms 50992 KB Output is correct
43 Correct 135 ms 50356 KB Output is correct
44 Correct 126 ms 50796 KB Output is correct
45 Correct 97 ms 51116 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 201 ms 23220 KB Output is correct
5 Correct 1237 ms 50344 KB Output is correct
6 Correct 832 ms 8520 KB Output is correct
7 Correct 889 ms 50356 KB Output is correct
8 Correct 708 ms 17528 KB Output is correct
9 Correct 956 ms 50352 KB Output is correct
10 Execution timed out 4054 ms 51144 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 201 ms 23220 KB Output is correct
5 Correct 1237 ms 50344 KB Output is correct
6 Correct 832 ms 8520 KB Output is correct
7 Correct 889 ms 50356 KB Output is correct
8 Correct 708 ms 17528 KB Output is correct
9 Correct 956 ms 50352 KB Output is correct
10 Execution timed out 4054 ms 51144 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Execution timed out 4088 ms 40744 KB Time limit exceeded
4 Halted 0 ms 0 KB -