oj.uz

Submission #569780

# Submission time Handle Problem Language Result Execution time Memory
569780 2022-05-27T18:53:34 Z Lobo Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 4000 ms 44900 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++) {
        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 4066 ms 35852 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 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 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.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 504 ms 20028 KB Output is correct
5 Correct 3364 ms 43372 KB Output is correct
6 Correct 956 ms 7460 KB Output is correct
7 Correct 3518 ms 43540 KB Output is correct
8 Correct 1113 ms 15172 KB Output is correct
9 Correct 3208 ms 43428 KB Output is correct
10 Execution timed out 4070 ms 44900 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.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 504 ms 20028 KB Output is correct
5 Correct 3364 ms 43372 KB Output is correct
6 Correct 956 ms 7460 KB Output is correct
7 Correct 3518 ms 43540 KB Output is correct
8 Correct 1113 ms 15172 KB Output is correct
9 Correct 3208 ms 43428 KB Output is correct
10 Execution timed out 4070 ms 44900 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 4066 ms 35852 KB Time limit exceeded
4 Halted 0 ms 0 KB -