oj.uz

Submission #413335

# Submission time Handle Problem Language Result Execution time Memory
413335 2021-05-28T13:53:11 Z mat_v Rainforest Jumps (APIO21_jumps) C++14
23 / 100
 4000 ms 51180 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 poc = l2;
    ff(j,l2,r2){
        if(niz[j] > niz[lv]){
            poc = j;
            break;
        }
    }
    if(niz[poc] < niz[lv])poc = desno[poc][0];

    int ans = 1e9;
    ff(i,l1,r1){
        int kurac = l2;
        ff(j,l2,r2){
            if(niz[j] > niz[i]){
                kurac = j;
                break;
            }
        }
        int ppp = dist(i, kurac);
        ans = min(ans, ppp);
    }
    if(ans == 1e9)ans = -1;
    return ans;
    return 0;
}
/*
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:90:5: note: in expansion of macro 'ff'
   90 |     ff(j,l2,r2){
      |     ^~
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:99:5: note: in expansion of macro 'ff'
   99 |     ff(i,l1,r1){
      |     ^~
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:101:9: note: in expansion of macro 'ff'
  101 |         ff(j,l2,r2){
      |         ^~

Subtask #1
0 / 4.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 Execution timed out 4080 ms 40732 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.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 200 KB Output is correct
4 Correct 341 ms 23176 KB Output is correct
5 Correct 1381 ms 50336 KB Output is correct
6 Correct 899 ms 8572 KB Output is correct
7 Correct 1269 ms 50332 KB Output is correct
8 Correct 744 ms 17480 KB Output is correct
9 Correct 1060 ms 50316 KB Output is correct
10 Correct 1276 ms 51124 KB Output is correct
11 Correct 1144 ms 51068 KB Output is correct
12 Correct 1285 ms 50980 KB Output is correct
13 Correct 1052 ms 50324 KB Output is correct
14 Correct 1365 ms 50668 KB Output is correct
15 Correct 1280 ms 51112 KB Output is correct
16 Correct 975 ms 51100 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 6 ms 328 KB Output is correct
23 Correct 4 ms 328 KB Output is correct
24 Correct 6 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 424 KB Output is correct
27 Correct 21 ms 712 KB Output is correct
28 Correct 28 ms 712 KB Output is correct
29 Correct 28 ms 712 KB Output is correct
30 Correct 12 ms 712 KB Output is correct
31 Correct 29 ms 712 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 79 ms 29216 KB Output is correct
34 Correct 152 ms 50388 KB Output is correct
35 Correct 102 ms 51136 KB Output is correct
36 Correct 143 ms 50328 KB Output is correct
37 Correct 127 ms 50676 KB Output is correct
38 Correct 99 ms 51100 KB Output is correct

Subtask #6
0 / 21.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 200 KB Output is correct
4 Correct 341 ms 23176 KB Output is correct
5 Correct 1381 ms 50336 KB Output is correct
6 Correct 899 ms 8572 KB Output is correct
7 Correct 1269 ms 50332 KB Output is correct
8 Correct 744 ms 17480 KB Output is correct
9 Correct 1060 ms 50316 KB Output is correct
10 Correct 1276 ms 51124 KB Output is correct
11 Correct 1144 ms 51068 KB Output is correct
12 Correct 1285 ms 50980 KB Output is correct
13 Correct 1052 ms 50324 KB Output is correct
14 Correct 1365 ms 50668 KB Output is correct
15 Correct 1280 ms 51112 KB Output is correct
16 Correct 975 ms 51100 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 6 ms 328 KB Output is correct
23 Correct 4 ms 328 KB Output is correct
24 Correct 6 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 424 KB Output is correct
27 Correct 21 ms 712 KB Output is correct
28 Correct 28 ms 712 KB Output is correct
29 Correct 28 ms 712 KB Output is correct
30 Correct 12 ms 712 KB Output is correct
31 Correct 29 ms 712 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 79 ms 29216 KB Output is correct
34 Correct 152 ms 50388 KB Output is correct
35 Correct 102 ms 51136 KB Output is correct
36 Correct 143 ms 50328 KB Output is correct
37 Correct 127 ms 50676 KB Output is correct
38 Correct 99 ms 51100 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 395 ms 23196 KB Output is correct
43 Correct 1364 ms 50368 KB Output is correct
44 Correct 840 ms 8520 KB Output is correct
45 Correct 1145 ms 50384 KB Output is correct
46 Correct 751 ms 17472 KB Output is correct
47 Correct 1172 ms 50476 KB Output is correct
48 Correct 1370 ms 51128 KB Output is correct
49 Correct 1216 ms 51136 KB Output is correct
50 Correct 1264 ms 50980 KB Output is correct
51 Correct 1113 ms 50268 KB Output is correct
52 Correct 1211 ms 50732 KB Output is correct
53 Correct 1157 ms 51116 KB Output is correct
54 Correct 1349 ms 51180 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Execution timed out 4043 ms 50192 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.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 Execution timed out 4080 ms 40732 KB Time limit exceeded
4 Halted 0 ms 0 KB -