Submission #345405

#	Time	Username	Problem	Language	Result	Execution time	Memory
345405		Pety	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	64 / 100	3031 ms	157612 KiB

sortbooks

#include <iostream>
#include<vector>
#include<algorithm>
#pragma GCC optimize("O1")


using namespace std;

const int N = 1e6;
int n, m, w[N + 2], cnt;
struct nodA {
  int inv, st, dr;
} aint[4 * N + 2];
vector<int>all;
int ans = 0, mx = 0;


void build (int nod, int st, int dr) {
  if (st == dr) {
    aint[nod].inv = 0;
    aint[nod].st = all.size();
    all.push_back(w[st]);
    aint[nod].dr = all.size();
    return;
  }
  int mid = (st + dr) / 2;
  build(2 * nod, st, mid);
  build(2 * nod + 1, mid + 1, dr);
  aint[nod].inv = max(aint[2 * nod].inv, aint[2 * nod + 1].inv);
  auto it = lower_bound(all.begin() + aint[2 * nod + 1].st,  all.begin() + aint[2 * nod + 1].dr, all[aint[2 * nod].dr - 1])-all.begin();
  if (it != aint[2 * nod + 1].st) {
    it--;
    aint[nod].inv = max(aint[nod].inv, all[aint[2 * nod].dr - 1] + all[it]);
  }
  aint[nod].st = all.size();
  for (int i = st; i <= dr; i++)
    all.push_back(w[i]);
  aint[nod].dr = all.size();
  sort(all.begin() + aint[nod].st, all.end());
  /*int i = 0, j = 0;
  while (i < aint[2 * nod].v.size() && j < aint[2 * nod + 1].v.size()) {
    if (aint[2 * nod].v[i] == aint[2 * nod + 1].v[j]) {
      int x = aint[2 * nod].v[i];
      aint[nod].v.push_back(x);
      aint[nod].v.push_back(x);
      i++;
      j++;
    }
    if (aint[2 * nod].v[i] < aint[2 * nod + 1].v[j]) {
      int x = aint[2 * nod].v[i];
      aint[nod].v.push_back(x);
      i++;
    }
    if (aint[2 * nod].v[i] > aint[2 * nod + 1].v[j]) {
      int x = aint[2 * nod + 1].v[j];
      aint[nod].v.push_back(x);
      j++;
    }
  }
  while (i < aint[2 * nod].v.size())
    aint[nod].v.push_back(aint[2 * nod].v[i++]);
  while (j < aint[2 * nod + 1].v.size())
    aint[nod].v.push_back(aint[2 * nod + 1].v[j++]);*/
}

void query (int nod, int st, int dr, int a, int b) {
  if (a <= st && dr <= b) {
    if (mx == -1) {
      ans = aint[nod].inv;
      mx = max(mx, all[aint[nod].dr - 1]);
    }
    else {
      ans = max(ans, aint[nod].inv);
      auto it = lower_bound(all.begin() + aint[nod].st, all.begin() + aint[nod].dr, mx) - all.begin();
      if (it != aint[nod].st) {
        it--;
        ans = max(ans, mx + all[it]);
      }
      mx = max(mx, all[aint[nod].dr - 1]);
    }
    return;
  }
  int mid = (st + dr) / 2;
  if (a <= mid)
    query(2 * nod, st, mid, a, b);
  if (b > mid)
    query(2 * nod + 1, mid + 1, dr, a, b);
}

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++)
    cin >> w[i];
  build(1, 1, n);
  for (int i = 1; i <= m; i++) {
    int l, r, k;
    cin >> l >> r >> k;
    ans = mx = -1;
    query(1, 1, n, l, r);
    cout << (ans <= k) << "\n";
  }
  return 0;
}

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