oj.uz

Submission #814046

# Submission time Handle Problem Language Result Execution time Memory
814046 2023-08-08T05:13:31 Z arush_agu Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 624 ms 94992 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-9;

struct Query {
  ll l, r, k, idx;

  bool operator<(const Query &other) const { return l < other.l; }
};

struct ST {
  int n;
  vl t;

  ST(int n) : n(n) { t = vl(2 * n + 10); }

  ll query(int l, int r) {
    ll res = -INF;
    for (l += n, r += n; l < r; l /= 2, r /= 2) {
      if (l & 1)
        res = max(res, t[l++]);
      if (r & 1)
        res = max(res, t[--r]);
    }
    return res;
  }

  void upd(int i, ll v) {
    i += n;
    for (t[i] = max(t[i], v); i > 1; i /= 2)
      t[i / 2] = max(t[i], t[i ^ 1]);
  }
};

void solve() {
  int n, m;
  cin >> n >> m;
  vl a(n);
  for (ll &x : a)
    cin >> x;
  vector<Query> qs(m);
  for (int i = 0; i < m; i++) {
    cin >> qs[i].l >> qs[i].r >> qs[i].k;
    qs[i].idx = i;
    qs[i].l--, qs[i].r--;
  }

  sort(all(qs));
  reverse(all(qs));

  ST st(n + 10);

  vb ans(m);

  int idx = n;
  vi s;
  for (Query q : qs) {
    while (q.l < idx) {
      idx--;

      while (s.size() && a[idx] > a[s.back()]) {
        st.upd(s.back(), a[s.back()] + a[idx]);
        s.pop_back();
      }
      while (s.size() && a[idx] == a[s.back()])
        s.pop_back();

      s.push_back(idx);
    }

    ans[q.idx] = st.query(0, q.r + 1) <= q.k;
  }

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

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:169:11: warning: unused variable 'start' [-Wunused-variable]
  169 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 3 ms 716 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 712 KB Output is correct
18 Correct 2 ms 588 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 605 ms 89072 KB Output is correct
2 Correct 598 ms 90244 KB Output is correct
3 Correct 598 ms 89984 KB Output is correct
4 Correct 624 ms 90096 KB Output is correct
5 Correct 561 ms 94160 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 8000 KB Output is correct
2 Correct 45 ms 7888 KB Output is correct
3 Correct 44 ms 7992 KB Output is correct
4 Correct 49 ms 7936 KB Output is correct
5 Correct 46 ms 7940 KB Output is correct
6 Correct 39 ms 7788 KB Output is correct
7 Correct 39 ms 7812 KB Output is correct
8 Correct 39 ms 7640 KB Output is correct
9 Correct 28 ms 4976 KB Output is correct
10 Correct 40 ms 7680 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 3 ms 716 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 712 KB Output is correct
18 Correct 2 ms 588 KB Output is correct
19 Correct 112 ms 18252 KB Output is correct
20 Correct 110 ms 18248 KB Output is correct
21 Correct 115 ms 18120 KB Output is correct
22 Correct 103 ms 18120 KB Output is correct
23 Correct 103 ms 18124 KB Output is correct
24 Correct 97 ms 18880 KB Output is correct
25 Correct 97 ms 18884 KB Output is correct
26 Correct 100 ms 19012 KB Output is correct
27 Correct 105 ms 19012 KB Output is correct
28 Correct 103 ms 19140 KB Output is correct
29 Correct 107 ms 19184 KB Output is correct
30 Correct 105 ms 19140 KB Output is correct
31 Correct 113 ms 19140 KB Output is correct
32 Correct 105 ms 19152 KB Output is correct
33 Correct 107 ms 19116 KB Output is correct
34 Correct 91 ms 18828 KB Output is correct
35 Correct 93 ms 18828 KB Output is correct
36 Correct 89 ms 18636 KB Output is correct
37 Correct 91 ms 18624 KB Output is correct
38 Correct 92 ms 18760 KB Output is correct
39 Correct 94 ms 17612 KB Output is correct
40 Correct 77 ms 15028 KB Output is correct
41 Correct 86 ms 16332 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 3 ms 716 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 712 KB Output is correct
18 Correct 2 ms 588 KB Output is correct
19 Correct 605 ms 89072 KB Output is correct
20 Correct 598 ms 90244 KB Output is correct
21 Correct 598 ms 89984 KB Output is correct
22 Correct 624 ms 90096 KB Output is correct
23 Correct 561 ms 94160 KB Output is correct
24 Correct 47 ms 8000 KB Output is correct
25 Correct 45 ms 7888 KB Output is correct
26 Correct 44 ms 7992 KB Output is correct
27 Correct 49 ms 7936 KB Output is correct
28 Correct 46 ms 7940 KB Output is correct
29 Correct 39 ms 7788 KB Output is correct
30 Correct 39 ms 7812 KB Output is correct
31 Correct 39 ms 7640 KB Output is correct
32 Correct 28 ms 4976 KB Output is correct
33 Correct 40 ms 7680 KB Output is correct
34 Correct 112 ms 18252 KB Output is correct
35 Correct 110 ms 18248 KB Output is correct
36 Correct 115 ms 18120 KB Output is correct
37 Correct 103 ms 18120 KB Output is correct
38 Correct 103 ms 18124 KB Output is correct
39 Correct 97 ms 18880 KB Output is correct
40 Correct 97 ms 18884 KB Output is correct
41 Correct 100 ms 19012 KB Output is correct
42 Correct 105 ms 19012 KB Output is correct
43 Correct 103 ms 19140 KB Output is correct
44 Correct 107 ms 19184 KB Output is correct
45 Correct 105 ms 19140 KB Output is correct
46 Correct 113 ms 19140 KB Output is correct
47 Correct 105 ms 19152 KB Output is correct
48 Correct 107 ms 19116 KB Output is correct
49 Correct 91 ms 18828 KB Output is correct
50 Correct 93 ms 18828 KB Output is correct
51 Correct 89 ms 18636 KB Output is correct
52 Correct 91 ms 18624 KB Output is correct
53 Correct 92 ms 18760 KB Output is correct
54 Correct 94 ms 17612 KB Output is correct
55 Correct 77 ms 15028 KB Output is correct
56 Correct 86 ms 16332 KB Output is correct
57 Correct 609 ms 90852 KB Output is correct
58 Correct 620 ms 90760 KB Output is correct
59 Correct 578 ms 90692 KB Output is correct
60 Correct 576 ms 90696 KB Output is correct
61 Correct 599 ms 90760 KB Output is correct
62 Correct 575 ms 90708 KB Output is correct
63 Correct 490 ms 92836 KB Output is correct
64 Correct 486 ms 93064 KB Output is correct
65 Correct 560 ms 94784 KB Output is correct
66 Correct 562 ms 94756 KB Output is correct
67 Correct 591 ms 94772 KB Output is correct
68 Correct 580 ms 94880 KB Output is correct
69 Correct 588 ms 94800 KB Output is correct
70 Correct 560 ms 94884 KB Output is correct
71 Correct 568 ms 94992 KB Output is correct
72 Correct 618 ms 94848 KB Output is correct
73 Correct 456 ms 91320 KB Output is correct
74 Correct 460 ms 92312 KB Output is correct
75 Correct 456 ms 91312 KB Output is correct
76 Correct 449 ms 91336 KB Output is correct
77 Correct 460 ms 91424 KB Output is correct
78 Correct 522 ms 87460 KB Output is correct
79 Correct 416 ms 70304 KB Output is correct
80 Correct 495 ms 81864 KB Output is correct