oj.uz

Submission #569757

# Submission time Handle Problem Language Result Execution time Memory
569757 2022-05-27T17:57:32 Z Lobo Rainforest Jumps (APIO21_jumps) C++17
23 / 100
 1116 ms 63064 KB 
#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 2e5+10;

int n, h[maxn], nx[maxn][25], nxl[maxn][25], nxr[maxn][25];


void init(int N, vector<int> H) {
    n = N;

    for(int i = 1; i <= n; i++) {
        h[i] = H[i-1];
    }

    //os proximos da esquerda e direita de cada um e 0 se não tiver
    stack<pair<int,int>> stl;
    for(int i = 1; i <= n; i++) {
        while(stl.size() && stl.top().fr < h[i]) {
            stl.pop();
        }

        if(stl.size()) nxl[i][0] = stl.top().sc;
        else nxl[i][0] = 0;

        stl.push(mp(h[i],i));
    }
    stack<pair<int,int>> str;
    for(int i = n; i >= 1; i--) {
        while(str.size() && str.top().fr < h[i]) {
            str.pop();
        }

        if(str.size()) nxr[i][0] = str.top().sc;
        else nxr[i][0] = 0;

        str.push(mp(h[i],i));
    }

    //sei qual o proximo normal de cada um
    for(int i = 1; i <= n; i++) {
        if(nxr[i][0] == 0 || h[nxl[i][0]] > h[nxr[i][0]]) nx[i][0] = nxl[i][0];
        else nx[i][0] = nxr[i][0];

        // cout << i << " " << nx[i][0] << " " << nxl[i][0] << " " << nxr[i][0] << endl;
    }

    for(int pt = 1; pt <= 20; pt++) {
        for(int i = 1; i <= n; i++) {
            nx[i][pt] = nx[nx[i][pt-1]][pt-1];
        }
    }
    for(int pt = 1; pt <= 20; pt++) {
        for(int i = 1; i <= n; i++) {
            nxl[i][pt] = nxl[nxl[i][pt-1]][pt-1];
        }
    }
    for(int pt = 1; pt <= 20; pt++) {
        for(int i = 1; i <= n; i++) {
            nxr[i][pt] = nxr[nxr[i][pt-1]][pt-1];
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    A++;
    B++;
    C++;
    D++;
    //ir do a para o c

    int s = A;
    int t = C;
    int ans = 0;
    for(int pt = 20; pt >= 0; pt--) {
        if(nx[s][pt] == 0 || h[nx[s][pt]] > h[t]) continue;
        ans+= (1<<pt);
        s = nx[s][pt];
    }

    //vai so para a direita ate chegar no t
    for(int pt = 20; pt >= 0; pt--) {
        if(nxr[s][pt] == 0 || nxr[s][pt] > t) continue;
        ans+= (1<<pt);
        s = nxr[s][pt];
    }

    if(s == t) return ans;
    else return -1;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 204 ms 50220 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 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 256 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 336 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 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 282 ms 28228 KB Output is correct
5 Correct 830 ms 61380 KB Output is correct
6 Correct 510 ms 10356 KB Output is correct
7 Correct 835 ms 61256 KB Output is correct
8 Correct 519 ms 21320 KB Output is correct
9 Correct 960 ms 61292 KB Output is correct
10 Correct 1116 ms 63064 KB Output is correct
11 Correct 1087 ms 62932 KB Output is correct
12 Correct 985 ms 62816 KB Output is correct
13 Correct 1030 ms 61352 KB Output is correct
14 Correct 1107 ms 62116 KB Output is correct
15 Correct 862 ms 62884 KB Output is correct
16 Correct 974 ms 63012 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 18 ms 848 KB Output is correct
28 Correct 17 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 17 ms 848 KB Output is correct
31 Correct 18 ms 848 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 88 ms 35708 KB Output is correct
34 Correct 150 ms 61352 KB Output is correct
35 Correct 158 ms 62764 KB Output is correct
36 Correct 161 ms 61368 KB Output is correct
37 Correct 175 ms 62196 KB Output is correct
38 Correct 173 ms 62996 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 282 ms 28228 KB Output is correct
5 Correct 830 ms 61380 KB Output is correct
6 Correct 510 ms 10356 KB Output is correct
7 Correct 835 ms 61256 KB Output is correct
8 Correct 519 ms 21320 KB Output is correct
9 Correct 960 ms 61292 KB Output is correct
10 Correct 1116 ms 63064 KB Output is correct
11 Correct 1087 ms 62932 KB Output is correct
12 Correct 985 ms 62816 KB Output is correct
13 Correct 1030 ms 61352 KB Output is correct
14 Correct 1107 ms 62116 KB Output is correct
15 Correct 862 ms 62884 KB Output is correct
16 Correct 974 ms 63012 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 18 ms 848 KB Output is correct
28 Correct 17 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 17 ms 848 KB Output is correct
31 Correct 18 ms 848 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 88 ms 35708 KB Output is correct
34 Correct 150 ms 61352 KB Output is correct
35 Correct 158 ms 62764 KB Output is correct
36 Correct 161 ms 61368 KB Output is correct
37 Correct 175 ms 62196 KB Output is correct
38 Correct 173 ms 62996 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 165 ms 28136 KB Output is correct
43 Correct 971 ms 61256 KB Output is correct
44 Correct 384 ms 10320 KB Output is correct
45 Correct 956 ms 61348 KB Output is correct
46 Correct 484 ms 21352 KB Output is correct
47 Correct 905 ms 61228 KB Output is correct
48 Correct 1061 ms 63004 KB Output is correct
49 Correct 1053 ms 62740 KB Output is correct
50 Correct 1040 ms 62756 KB Output is correct
51 Correct 788 ms 61356 KB Output is correct
52 Correct 1037 ms 62272 KB Output is correct
53 Correct 989 ms 63020 KB Output is correct
54 Correct 1018 ms 62920 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Incorrect 210 ms 61120 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 204 ms 50220 KB Output isn't correct
4 Halted 0 ms 0 KB -