Submission #869601

#	Time	Username	Problem	Language	Result	Execution time	Memory
869601		NeroZein	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	915 ms	50920 KiB

sortbooks

#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 1e6 + 6;

int ans[N]; 
int seg[N * 2];

void upd(int nd, int l, int r, int p, int v) {
  if (l == r) {
    seg[nd] = max(seg[nd], v);
    return;
  }
  int mid = (l + r) >> 1;
  int rs = nd + ((mid - l + 1) << 1);
  if (p <= mid) {
    upd(nd + 1, l, mid, p, v);
  } else {
    upd(rs, mid + 1, r, p, v);
  }
  seg[nd] = max(seg[nd + 1], seg[rs]); 
}

int qry(int nd, int l, int r, int s, int e) {
  if (l >= s && r <= e) {
    return seg[nd]; 
  }
  int mid = (l + r) >> 1;
  int rs = nd + ((mid - l + 1) << 1);
  if (mid >= e) {
    return qry(nd + 1, l, mid, s, e); 
  } else {
    if (mid < s) {
      return qry(rs, mid + 1, r, s, e);
    } else {
      return max(qry(nd + 1, l, mid, s, e), qry(rs, mid + 1, r, s, e)); 
    }
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, q;
  cin >> n >> q;
  vector<int> a(n); 
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  stack<int> stk;
  vector<array<int, 4>> ranges; 
  for (int i = 0; i < q; ++i) {
    int l, r, v;
    cin >> l >> r >> v; 
    --l, --r; 
    ranges.push_back({l, -r, v, i});//biggest l, then smallest r, then biggest sum
  }
  for (int i = n - 1; i >= 0; --i) {
    while (!stk.empty() && a[stk.top()] < a[i]) {
      ranges.push_back({i, -stk.top(), a[i] + a[stk.top()], -1});
      stk.pop();
    }
    stk.push(i); 
  }
  sort(ranges.begin(), ranges.end()); 
  reverse(ranges.begin(), ranges.end()); 
  for (auto [l, r, v, i] : ranges) {
    r = -r; 
    if (i == -1) {
      upd(0, 0, n - 1, r, v); 
    } else {
      int mx = qry(0, 0, n - 1, l, r);
      ans[i] = (mx <= v); 
    }
  }
  for (int i = 0; i < q; ++i) {
    cout << ans[i] << '\n'; 
  }
  return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 17 / 17
• Subtask 5: 30 / 30
• Subtask 6: 23 / 23