oj.uz

답안 #495589

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495589 2021-12-19T11:50:42 Z 600Mihnea 3단 점프 (JOI19_jumps) C++17
5 / 100
 4000 ms 50012 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int) 5e5 + 7;
const int K = 19;
const int INF = (int) 1e9 + 7;
int n;
int q;
int a[N];
int lg[N];
int maxA[K][N];
int nextBigger[N];

int getMaxA(int l, int r) {
  if (l > r) {
    return -INF;
  }
  assert(1 <= l && l <= r && r <= n);
  int k = lg[r - l + 1];
  return max(maxA[k][l], maxA[k][r - (1 << k) + 1]);
}

struct Offer {
  int value;
  int lft;
  int rgh;
  int mx;
};

struct Question {
  int l;
  int r;
  int ind;
};

vector<Question> questionsAt[N];
vector<Offer> offersAt[N];

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  //freopen ("input", "r", stdin);


  cin >> n;
  for (int i = 2; i <= n; i++) {
    lg[i] = lg[i / 2] + 1;
  }
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    maxA[0][i] = a[i];
  }
  for (int k = 1; (1 << k) <= n; k++) {
    for (int i = 1; i + (1 << k) - 1 <= n; i++) {
      maxA[k][i] = max(maxA[k - 1][i], maxA[k - 1][i + (1 << (k - 1))]);
    }
  }

  { /// just some stack bro
    vector<int> stk;
    for (int i = n; i >= 1; i--) {
      while (!stk.empty() && a[i] >= a[stk.back()]) {
        stk.pop_back();
      }
      nextBigger[i] = (stk.empty() ? (n + 1) : stk.back());
      stk.push_back(i);
    }
  }

  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= min(n, nextBigger[i]); j = nextBigger[j]) {
      if (2 * j - i <= n) {
        offersAt[2 * j - i].push_back({a[i] + a[j], i, 2 * j - i});
      }
    }
  }

  cin >> q;
  vector<int> sol(q, -1);
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    questionsAt[r].push_back({l, r, i});
  }


  for (int r = 1; r <= n; r++) {
    for (int r2 = 1; r2 <= r; r2++) {
      for (auto &it : offersAt[r2]) {
        it.mx = max(it.mx, a[r]);
      }
    }
    for (auto &it : questionsAt[r]) {

      int l = it.l, r = it.r, ind = it.ind, best = 0;
      for (int r2 = 1; r2 <= r; r2++) {
        for (auto &offer : offersAt[r2]) {
          if (offer.lft >= l) {
            best = max(best, offer.value + offer.mx);
          }
        }
      }

      sol[ind] = best;
    }
  }

  for (auto &x : sol) {
    assert(x != -1);
    cout << x << "\n";
  }



  return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 14 ms 23884 KB Output is correct
3 Correct 16 ms 23772 KB Output is correct
4 Correct 14 ms 23804 KB Output is correct
5 Correct 17 ms 23888 KB Output is correct
6 Correct 14 ms 23884 KB Output is correct
7 Correct 17 ms 23884 KB Output is correct
8 Correct 13 ms 23884 KB Output is correct
9 Correct 13 ms 23852 KB Output is correct
10 Correct 13 ms 23800 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 14 ms 23884 KB Output is correct
3 Correct 16 ms 23772 KB Output is correct
4 Correct 14 ms 23804 KB Output is correct
5 Correct 17 ms 23888 KB Output is correct
6 Correct 14 ms 23884 KB Output is correct
7 Correct 17 ms 23884 KB Output is correct
8 Correct 13 ms 23884 KB Output is correct
9 Correct 13 ms 23852 KB Output is correct
10 Correct 13 ms 23800 KB Output is correct
11 Execution timed out 4048 ms 37188 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4090 ms 50012 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 14 ms 23884 KB Output is correct
3 Correct 16 ms 23772 KB Output is correct
4 Correct 14 ms 23804 KB Output is correct
5 Correct 17 ms 23888 KB Output is correct
6 Correct 14 ms 23884 KB Output is correct
7 Correct 17 ms 23884 KB Output is correct
8 Correct 13 ms 23884 KB Output is correct
9 Correct 13 ms 23852 KB Output is correct
10 Correct 13 ms 23800 KB Output is correct
11 Execution timed out 4048 ms 37188 KB Time limit exceeded
12 Halted 0 ms 0 KB -