oj.uz

Submission #566684

# Submission time Handle Problem Language Result Execution time Memory
566684 2022-05-22T16:09:29 Z Ooops_sorry Rainforest Jumps (APIO21_jumps) C++14
0 / 100
 4000 ms 5016 KB 
#include<bits/stdc++.h>
#ifndef LOCAL
    #include "jumps.h"
#endif

#define ld long double
#define ll long long
#define pb push_back

const int INF = 1e9;

using namespace std;
int n;
vector<int> h, l, r;

void init(int N, std::vector<int> H) {
    h = H;
    n = N;
    l.resize(n, -1);
    r.resize(n, -1);
    deque<int> q;
    for (int i = 0; i < n; i++) {
        while (q.size() > 0 && h[q.back()] < h[i]) {
            r[q.back()] = i;
            q.pop_back();
        }
        q.pb(i);
    }
    q.clear();
    for (int i = n - 1; i >= 0; i--) {
        while (q.size() > 0 && h[q.back()] < h[i]) {
            l[q.back()] = i;
            q.pop_back();
        }
        q.pb(i);
    }
}

int minimum_jumps(int a, int b, int c, int d) {
    int j = -1, k = -1;
    for (int i = c; i <= d; i++) {
        if (j == -1 || h[i] > h[j]) {
            j = i;
        }
    }
    for (int i = a; i <= b; i++) {
        if (h[i] < h[j] && (k == -1 || h[i] > h[k])) {
            k = i;
        }
    }
    if (k == -1) return -1;
    int cnt = 1;
    while (r[k] < c) {
        int L = l[k], R = r[k];
        cnt++;
        if (L == -1) {
            k = R;
        } else if (R == -1) {
            k = L;
        } else {
            if (h[L] > h[R] && h[L] < h[j]) {
                k = L;
            } else {
                k = R;
            }
        }
    }
    return cnt;
}

#ifdef LOCAL

int main() {
  int N, Q;
  assert(2 == scanf("%d %d", &N, &Q));
  std::vector<int> H(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &H[i]));
  }
  init(N, H);

  for (int i = 0; i < Q; ++i) {
    int A, B, C, D;
    assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
    printf("%d\n", minimum_jumps(A, B, C, D));
  }
  return 0;
}

#endif

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 Correct 2935 ms 3996 KB Output is correct
4 Execution timed out 4090 ms 5016 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
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 Execution timed out 4074 ms 208 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
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 Execution timed out 4074 ms 208 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
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 208 KB Output is correct
5 Execution timed out 4026 ms 3348 KB Time limit exceeded
6 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 Execution timed out 4043 ms 2080 KB Time limit exceeded
5 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 Execution timed out 4043 ms 2080 KB Time limit exceeded
5 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 Correct 2935 ms 3996 KB Output is correct
4 Execution timed out 4090 ms 5016 KB Time limit exceeded
5 Halted 0 ms 0 KB -