Submission #796125

#	Time	Username	Problem	Language	Result	Execution time	Memory
796125		arush_agu	Global Warming (CEOI18_glo)	C++17	100 / 100	40 ms	6944 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;

struct SST;

vector<SST> ssts;
struct SST {
  ll l, r;
  int s;
  int l_child = -1, r_child = -1;

  SST(ll l, ll r) : l(l), r(r), s(0), l_child(-1), r_child(-1) {}

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

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

    ll mid = (l + r) / 2;
    if (l_child == -1) {
      l_child = ssts.size();
      ssts.push_back(SST(l, mid));
    }
    if (r_child == -1) {
      r_child = ssts.size();
      ssts.push_back(SST(mid + 1, r));
    }

    if (l_child == -1)
      exit(123);
    if (r_child == -1)
      exit(123);
    assert(l_child < ssts.size());
    assert(r_child < ssts.size());
    ssts[l_child].upd(qi, val);
    ssts[r_child].upd(qi, val);

    s = max(ssts[l_child].s, ssts[r_child].s);
  }

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

    ll mid = (l + r) / 2;
    if (l_child == -1) {
      l_child = ssts.size();
      ssts.push_back(SST(l, mid));
    }
    if (r_child == -1) {
      r_child = ssts.size();
      ssts.push_back(SST(mid + 1, r));
    }

    if (l_child == -1)
      exit(123);
    if (r_child == -1)
      exit(123);
    assert(l_child < ssts.size());
    assert(r_child < ssts.size());
    return max(ssts[l_child].query(ql, qr), ssts[r_child].query(ql, qr));
  }
};

// Saw Solution

void solve() {
  ll n, x;
  cin >> n >> x;
  vl a(n + 1);
  vvl dp(2, vl(n + 1));
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    dp[0][i] = dp[1][i] = INF;
  }
  dp[0][0] = dp[1][0] = -INF;

  ll ans = 0;
  for (int i = 2; i <= n; i++) {
    ll k = lower_bound(dp[0].begin() + 1, dp[0].begin() + n + 1, a[i - 1] - x) -
           dp[0].begin();
    dp[0][k] = a[i - 1] - x;
    dp[1][k] = min(dp[1][k], dp[0][k]);
    ans = max(ans, k);
    k = lower_bound(dp[1].begin() + 1, dp[1].begin() + n + 1, a[i]) -
        dp[1].begin();
    dp[1][k] = a[i];
    ans = max(ans, k);
  }
  cout << ans << '\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)

In file included from /usr/include/c++/10/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp:45,
                 from /usr/include/c++/10/ext/pb_ds/detail/container_base_dispatch.hpp:90,
                 from /usr/include/c++/10/ext/pb_ds/assoc_container.hpp:48,
                 from glo.cpp:6:
glo.cpp: In member function 'void SST::upd(ll, int)':
glo.cpp:126:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<SST>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |     assert(l_child < ssts.size());
      |            ~~~~~~~~^~~~~~~~~~~~~
glo.cpp:127:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<SST>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |     assert(r_child < ssts.size());
      |            ~~~~~~~~^~~~~~~~~~~~~
glo.cpp: In member function 'int SST::query(ll, ll)':
glo.cpp:154:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<SST>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |     assert(l_child < ssts.size());
      |            ~~~~~~~~^~~~~~~~~~~~~
glo.cpp:155:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<SST>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |     assert(r_child < ssts.size());
      |            ~~~~~~~~^~~~~~~~~~~~~
glo.cpp: In function 'int main()':
glo.cpp:192:11: warning: unused variable 'start' [-Wunused-variable]
  192 |   clock_t start = clock();
      |           ^~~~~

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