oj.uz

Submission #898201

# Submission time Handle Problem Language Result Execution time Memory
898201 2024-01-04T11:28:44 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 187216 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()
#define tp3 tuple<int, int, int>

const int N = 1e6, L = 20, inf = INT_MAX;

int n, m, mnA, mxK, a[N], b[N], mxL[N], lg[N], st[L][N], seg[N*4];
vector<int> lf[N];
vector<tp3> q[N];
bitset<N> ans;

void build(int p=1, int l=0, int r=n-1) {
  if (l == r) {
    seg[p] = (b[l] == -1 ? 0 : (a[l] + a[b[l]]));
    return;
  }

  int mid = (l+r) >> 1;
  build(p*2, l, mid);
  build(p*2+1, mid+1, r); 

  seg[p] = max(seg[p*2], seg[p*2+1]);
}

void update(int x, int p=1, int l=0, int r=n-1) {
  if (l == r) {
    seg[p] = 0;
    return;
  }

  int mid = (l+r) >> 1;
  if (x <= mid) update(x, p*2, l, mid);
  else update(x, p*2+1, mid+1, r); 

  seg[p] = max(seg[p*2], seg[p*2+1]);
}

int query(int x, int y, int p=1, int l=0, int r=n-1) {
  if (x <= l && r <= y) {
    return seg[p];
  }

  int mid = (l+r) >> 1;
  if (y <= mid) {
    return query(x, y, p*2, l, mid);
  }
  else if(mid+1 <= x) {
    return query(x, y, p*2+1, mid+1, r);
  }
  else {
    return max(query(x, y, p*2, l, mid), query(x, y, p*2+1, mid+1, r));
  }
}

int querySt(int l, int r) {
  int x = lg[r-l+1];
  return max(st[x][l], st[x][r - (1 << x) + 1]);
}

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

  lg[1] = 0;
  for (int i = 2; i < N; i++) {
    lg[i] = lg[i >> 1] + 1;
  }

  cin >> n >> m;
  mnA = inf;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mnA = min(mnA, a[i]);
    st[0][i] = a[i];
  }

  mxK = -inf;
  for (int i = 0; i < m; i++) {
    int l, r, k;
    cin >> l >> r >> k;
    l--; r--;
    mxK = max(mxK, k);
    q[l].push_back(make_tuple(r, k, i));
  }

  if (mxK < mnA) {
    int curr = 0;
    mxL[0] = 0;
    for (int i = 1; i < n; i++) {
      if (a[i-1] > a[i]) {
        curr = i;
      }
      mxL[i] = curr;
    }

    for (int l = 0; l < n; l++) {
      for (auto& [r, k, idx] : q[l]) {
        ans[idx] = (mxL[r] <= l);
      }
    }
  }
  else {
    for (int j = 1; j < L; j++) {
      for (int i = 0; i < n; i++) {
        st[j][i] = max(st[j-1][i], st[j-1][i + (1 << (j-1))]);
      }
    }

    for (int i = 0; i < n; i++) {
      int l = -1;
      int r = i-1;
      while (l < r) {
        int mid = (l+r+1)/2;

        int x = querySt(mid, i-1);
        if (x > a[i]) l = mid;
        else r = mid-1;
      }
      b[i] = l;
      lf[l].push_back(i);
    }

    build();
    for (int l = 0; l < n; l++) {
      for (auto& [r, k, idx] : q[l]) {
        ans[idx] = (query(l, r) <= k);
      }

      for (int& i : lf[l]) {
        update(i);
      }
    }
  }

  for (int i = 0; i < m; i++) {
      cout << ans[i] << "\n";
    }
}

/*
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()
#define tp3 tuple<int, int, int>

const int N = 1e6, L = 20, inf = INT_MAX;

int n, m, a[N], bit[N], lg[N], st[L][N];
vector<int> lf[N];
vector<tp3> q[N];
bitset<N> ans;

void update(int i, int x) {
  for (; i < n; i = i | (i + 1)) {
    bit[i] += x;
  }
}

int query(int r) {
  int x = 0;
  for (; r >= 0; r = (r & (r + 1)) - 1) {
    x = max(x, bit[r]);
  }
  return x;
}

int querySt(int l, int r) {
  int x = lg[r-l+1];
  return max(st[x][l], st[x][r - (1 << x) + 1]);
}

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

  memset(bit, 0, sizeof(bit));

  lg[1] = 0;
  for (int i = 2; i < N; i++) {
    lg[i] = lg[i >> 1] + 1;
  }

  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    st[0][i] = a[i];
  }

  for (int i = 0; i < m; i++) {
    int l, r, k;
    cin >> l >> r >> k;
    l--; r--;
    q[l].push_back(make_tuple(r, k, i));
  }

  for (int j = 1; j < L; j++) {
    for (int i = 0; i < n; i++) {
      st[j][i] = max(st[j-1][i], st[j-1][i + (1 << (j-1))]);
    }
  }

  for (int i = 0; i < n; i++) {
    int l = -1;
    int r = i-1;
    while (l < r) {
      int mid = (l+r+1)/2;

      int x = querySt(mid, i-1);
      if (x > a[i]) l = mid;
      else r = mid-1;
    }
    lf[l].push_back(i);
    if (l != -1) update(i, a[i]+a[l]);
  }

  for (int l = 0; l < n; l++) {
    for (auto& [r, k, idx] : q[l]) {
      ans[idx] = (query(r) <= k);
    }

    for (int& i : lf[l]) {
      update(i, -(a[i]+a[l]));
    }
  }

  for (int i = 0; i < m; i++) {
    cout << ans[i] << "\n";
  }
}
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 98976 KB Output is correct
2 Correct 18 ms 98976 KB Output is correct
3 Correct 18 ms 98904 KB Output is correct
4 Correct 18 ms 99024 KB Output is correct
5 Correct 18 ms 98996 KB Output is correct
6 Correct 22 ms 98908 KB Output is correct
7 Correct 22 ms 98908 KB Output is correct
8 Correct 21 ms 98908 KB Output is correct
9 Correct 20 ms 98876 KB Output is correct
10 Correct 20 ms 98988 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 98976 KB Output is correct
2 Correct 18 ms 98976 KB Output is correct
3 Correct 18 ms 98904 KB Output is correct
4 Correct 18 ms 99024 KB Output is correct
5 Correct 18 ms 98996 KB Output is correct
6 Correct 22 ms 98908 KB Output is correct
7 Correct 22 ms 98908 KB Output is correct
8 Correct 21 ms 98908 KB Output is correct
9 Correct 20 ms 98876 KB Output is correct
10 Correct 20 ms 98988 KB Output is correct
11 Correct 22 ms 99100 KB Output is correct
12 Correct 21 ms 99156 KB Output is correct
13 Correct 23 ms 99176 KB Output is correct
14 Correct 24 ms 99160 KB Output is correct
15 Correct 25 ms 99156 KB Output is correct
16 Correct 21 ms 99164 KB Output is correct
17 Correct 21 ms 99160 KB Output is correct
18 Correct 21 ms 99160 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 92472 KB Output is correct
2 Correct 681 ms 92520 KB Output is correct
3 Correct 575 ms 92512 KB Output is correct
4 Correct 631 ms 92604 KB Output is correct
5 Correct 609 ms 92528 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 113296 KB Output is correct
2 Correct 89 ms 112808 KB Output is correct
3 Correct 77 ms 112080 KB Output is correct
4 Correct 104 ms 111984 KB Output is correct
5 Correct 78 ms 112028 KB Output is correct
6 Correct 83 ms 111476 KB Output is correct
7 Correct 68 ms 111576 KB Output is correct
8 Correct 85 ms 111648 KB Output is correct
9 Correct 63 ms 100620 KB Output is correct
10 Correct 80 ms 111896 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 98976 KB Output is correct
2 Correct 18 ms 98976 KB Output is correct
3 Correct 18 ms 98904 KB Output is correct
4 Correct 18 ms 99024 KB Output is correct
5 Correct 18 ms 98996 KB Output is correct
6 Correct 22 ms 98908 KB Output is correct
7 Correct 22 ms 98908 KB Output is correct
8 Correct 21 ms 98908 KB Output is correct
9 Correct 20 ms 98876 KB Output is correct
10 Correct 20 ms 98988 KB Output is correct
11 Correct 22 ms 99100 KB Output is correct
12 Correct 21 ms 99156 KB Output is correct
13 Correct 23 ms 99176 KB Output is correct
14 Correct 24 ms 99160 KB Output is correct
15 Correct 25 ms 99156 KB Output is correct
16 Correct 21 ms 99164 KB Output is correct
17 Correct 21 ms 99160 KB Output is correct
18 Correct 21 ms 99160 KB Output is correct
19 Correct 183 ms 123540 KB Output is correct
20 Correct 209 ms 123460 KB Output is correct
21 Correct 166 ms 122448 KB Output is correct
22 Correct 174 ms 122496 KB Output is correct
23 Correct 180 ms 122392 KB Output is correct
24 Correct 200 ms 120588 KB Output is correct
25 Correct 131 ms 120668 KB Output is correct
26 Correct 180 ms 120676 KB Output is correct
27 Correct 171 ms 120668 KB Output is correct
28 Correct 188 ms 120776 KB Output is correct
29 Correct 192 ms 121116 KB Output is correct
30 Correct 199 ms 121108 KB Output is correct
31 Correct 175 ms 121096 KB Output is correct
32 Correct 225 ms 121028 KB Output is correct
33 Correct 178 ms 121028 KB Output is correct
34 Correct 155 ms 119900 KB Output is correct
35 Correct 132 ms 119864 KB Output is correct
36 Correct 137 ms 119944 KB Output is correct
37 Correct 136 ms 120020 KB Output is correct
38 Correct 134 ms 119992 KB Output is correct
39 Correct 185 ms 121052 KB Output is correct
40 Correct 114 ms 115972 KB Output is correct
41 Correct 161 ms 120580 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 98976 KB Output is correct
2 Correct 18 ms 98976 KB Output is correct
3 Correct 18 ms 98904 KB Output is correct
4 Correct 18 ms 99024 KB Output is correct
5 Correct 18 ms 98996 KB Output is correct
6 Correct 22 ms 98908 KB Output is correct
7 Correct 22 ms 98908 KB Output is correct
8 Correct 21 ms 98908 KB Output is correct
9 Correct 20 ms 98876 KB Output is correct
10 Correct 20 ms 98988 KB Output is correct
11 Correct 22 ms 99100 KB Output is correct
12 Correct 21 ms 99156 KB Output is correct
13 Correct 23 ms 99176 KB Output is correct
14 Correct 24 ms 99160 KB Output is correct
15 Correct 25 ms 99156 KB Output is correct
16 Correct 21 ms 99164 KB Output is correct
17 Correct 21 ms 99160 KB Output is correct
18 Correct 21 ms 99160 KB Output is correct
19 Correct 629 ms 92472 KB Output is correct
20 Correct 681 ms 92520 KB Output is correct
21 Correct 575 ms 92512 KB Output is correct
22 Correct 631 ms 92604 KB Output is correct
23 Correct 609 ms 92528 KB Output is correct
24 Correct 113 ms 113296 KB Output is correct
25 Correct 89 ms 112808 KB Output is correct
26 Correct 77 ms 112080 KB Output is correct
27 Correct 104 ms 111984 KB Output is correct
28 Correct 78 ms 112028 KB Output is correct
29 Correct 83 ms 111476 KB Output is correct
30 Correct 68 ms 111576 KB Output is correct
31 Correct 85 ms 111648 KB Output is correct
32 Correct 63 ms 100620 KB Output is correct
33 Correct 80 ms 111896 KB Output is correct
34 Correct 183 ms 123540 KB Output is correct
35 Correct 209 ms 123460 KB Output is correct
36 Correct 166 ms 122448 KB Output is correct
37 Correct 174 ms 122496 KB Output is correct
38 Correct 180 ms 122392 KB Output is correct
39 Correct 200 ms 120588 KB Output is correct
40 Correct 131 ms 120668 KB Output is correct
41 Correct 180 ms 120676 KB Output is correct
42 Correct 171 ms 120668 KB Output is correct
43 Correct 188 ms 120776 KB Output is correct
44 Correct 192 ms 121116 KB Output is correct
45 Correct 199 ms 121108 KB Output is correct
46 Correct 175 ms 121096 KB Output is correct
47 Correct 225 ms 121028 KB Output is correct
48 Correct 178 ms 121028 KB Output is correct
49 Correct 155 ms 119900 KB Output is correct
50 Correct 132 ms 119864 KB Output is correct
51 Correct 137 ms 119944 KB Output is correct
52 Correct 136 ms 120020 KB Output is correct
53 Correct 134 ms 119992 KB Output is correct
54 Correct 185 ms 121052 KB Output is correct
55 Correct 114 ms 115972 KB Output is correct
56 Correct 161 ms 120580 KB Output is correct
57 Execution timed out 3060 ms 187216 KB Time limit exceeded
58 Halted 0 ms 0 KB -