oj.uz

Submission #569781

# Submission time Handle Problem Language Result Execution time Memory
569781 2022-05-27T18:56:50 Z Lobo Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 44984 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];

pair<int,int> tr[22*maxn];
int f1[22*maxn], f2[22*maxn], bg[maxn], cnt = 0;
int att(int no, int l, int r, int no1, int pos, int val) {
    if(no == 0) no = ++cnt;
    if(l > pos || r < pos) return no;
    if(l == r) {
        tr[no] = mp(val,l);
        return no;
    }

    int mid = (l+r)/2;
    if(pos <= mid) {
        //vai para esquerda
        f1[no] = att(f1[no],l,mid,f1[no1],pos,val);
        f2[no] = f2[no1];
    }
    else {
        f2[no] = att(f2[no],mid+1,r,f2[no1],pos,val);
        f1[no] = f1[no1];
    }
    tr[no] = max(tr[f1[no]],tr[f2[no]]);
    return no;
}

pair<int,int> qrrmx(int no, int l, int r, int L, int R) {
    if(l > R || r < L) return mp(0,0);
    if(l >= L && r <= R) return tr[no];
    int mid = (l+r)/2;
    return max(qrrmx(f1[no],l,mid,L,R),qrrmx(f2[no],mid+1,r,L,R));
}

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

    vector<pair<int,int>> vec;
    for(int i = 1; i <= n; i++) {
        h[i] = H[i-1];
        vec.pb(mp(h[i],i));
    }
    // cout << cnt << endl;

    //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));
    }

}

int minimum_jumps(int A, int B, int C, int D) {
    A++;
    B++;
    C++;
    D++;

    int d[n+10];
    queue<int> q;
    for(int i = 1; i <= n; i++) d[i] = -1;
    for(int i = A; i <= B; i++) {
        d[i] = 0;
        q.push(i);
    }

    while(q.size()) {
        int u = q.front();
        q.pop();
        int v;

        v = nxl[u][0];
        if(v != 0 && d[v] == -1) {
            d[v] = d[u]+1;
            q.push(v);
        }
        v = nxr[u][0];
        if(v != 0 && d[v] == -1) {
            d[v] = d[u]+1;
            q.push(v);
        }
    }

    int ans = n+10;
    for(int i = C; i <= D; i++) {
        if(d[i] != -1) ans = min(ans, d[i]);
    }

    if(ans == n+10) return -1;
    return ans;
}

Subtask #1
0 / 4.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 2 ms 336 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 336 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 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 4 ms 336 KB Output is correct
32 Correct 3 ms 336 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct

Subtask #3
13.0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 37 ms 34964 KB Output is correct
6 Correct 49 ms 43472 KB Output is correct
7 Correct 23 ms 22388 KB Output is correct
8 Correct 49 ms 43432 KB Output is correct
9 Correct 8 ms 6824 KB Output is correct
10 Correct 46 ms 43452 KB Output is correct
11 Correct 50 ms 44908 KB Output is correct
12 Correct 53 ms 44564 KB Output is correct
13 Correct 48 ms 44436 KB Output is correct
14 Correct 45 ms 43472 KB Output is correct
15 Correct 60 ms 44168 KB Output is correct
16 Correct 53 ms 44860 KB Output is correct
17 Correct 53 ms 44760 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 0 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 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 1 ms 720 KB Output is correct
28 Correct 1 ms 720 KB Output is correct
29 Correct 1 ms 720 KB Output is correct
30 Correct 1 ms 720 KB Output is correct
31 Correct 1 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 44 ms 43284 KB Output is correct
34 Correct 48 ms 43436 KB Output is correct
35 Correct 48 ms 44548 KB Output is correct
36 Correct 46 ms 43404 KB Output is correct
37 Correct 64 ms 44088 KB Output is correct
38 Correct 46 ms 44968 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 36 ms 25324 KB Output is correct
41 Correct 44 ms 43396 KB Output is correct
42 Correct 50 ms 44728 KB Output is correct
43 Correct 45 ms 43444 KB Output is correct
44 Correct 49 ms 44156 KB Output is correct
45 Correct 48 ms 44972 KB Output is correct

Subtask #5
0 / 23.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 Correct 0 ms 208 KB Output is correct
4 Correct 486 ms 19988 KB Output is correct
5 Correct 3401 ms 43452 KB Output is correct
6 Correct 868 ms 7468 KB Output is correct
7 Correct 3593 ms 43384 KB Output is correct
8 Correct 921 ms 15152 KB Output is correct
9 Correct 3309 ms 43392 KB Output is correct
10 Execution timed out 4057 ms 44984 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 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 486 ms 19988 KB Output is correct
5 Correct 3401 ms 43452 KB Output is correct
6 Correct 868 ms 7468 KB Output is correct
7 Correct 3593 ms 43384 KB Output is correct
8 Correct 921 ms 15152 KB Output is correct
9 Correct 3309 ms 43392 KB Output is correct
10 Execution timed out 4057 ms 44984 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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