Submission #796107

#	Time	Username	Problem	Language	Result	Execution time	Memory
796107		arush_agu	Global Warming (CEOI18_glo)	C++17	0 / 100	506 ms	262144 KiB

glo

#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 <ios>
#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 = 1e9;
const ld EPS = 1e-9;

const ll MX_ABS = 2e9 + 10;

struct SSTNode {
  ll l, r, s;
  SSTNode *l_child, *r_child;

  SSTNode(ll l, ll r) : l(l), r(r), s(0), l_child(nullptr), r_child(nullptr) {}
  SSTNode(ll l, ll r, SSTNode *left, SSTNode *right)
      : l(l), r(r), l_child(left), r_child(right) {
    s = max(left->s, right->s);
  }

  void upd(ll qi, ll val) {
    if (!(l <= qi && qi <= r))
      return;

    if (l == r) {
      s = max(val, s);
      return;
    }

    ll mid = (l + r) / 2;
    if (!l_child)
      l_child = new SSTNode(l, mid);
    if (!r_child)
      r_child = new SSTNode(mid + 1, r);

    l_child->upd(qi, val);
    r_child->upd(qi, val);

    s = max(l_child->s, r_child->s);
  }

  ll query(ll ql, ll qr) {
    if (ql > r || l > qr)
      return 0;
    if (ql <= l && r <= qr)
      return s;

    if (!l_child)
      l_child = new SSTNode(l, (l + r) / 2);
    if (!r_child)
      r_child = new SSTNode((l + r) / 2 + 1, r);

    return max(l_child->query(ql, qr), r_child->query(ql, qr));
  }
};

void solve() {
  ll n, x;
  cin >> n >> x;
  vl a(n);
  for (ll &x : a)
    cin >> x;

  auto query_seg = [](SSTNode *root, ll r) -> ll { return root->query(0, r); };
  auto upd_seg = [](SSTNode *root, ll qi, ll val) { root->upd(qi, val); };

  ll mx = 0;

  auto do_it = [&]() {
    SSTNode *rootpd = new SSTNode(0, 1e9 + x + 1000);

    upd_seg(rootpd, a[0], 1), upd_seg(rootpd, a[0] + x, 1);

    for (int i = 1; i < n; i++) {
      ll mx = query_seg(rootpd, a[i] - 1);
      ll nmx = max(mx, query_seg(rootpd, a[i] + x - 1));
      upd_seg(rootpd, a[i] + x, nmx + 1);
      upd_seg(rootpd, a[i], mx + 1);
    }

    mx = max(mx, rootpd->s);
  };

  do_it();
  reverse(all(a));
  for (ll &x : a)
    x *= -1;
  ll mn = *min_element(all(a)) - 1;
  for (ll &x : a)
    x -= mn;
  do_it();

  cout << mx << "\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 (stderr)

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25