Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/cartesian_tree.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/cartesian_tree/"

#include "../../code/ds/cartesian_tree.hpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n;
  std::cin >> n;
  vec<i32> a(n);
  for (auto &x : a) std::cin >> x;
  tifa_libs::ds::cartesian_tree tr(a);
  for (u32 i = 0; i < n; ++i) std::cout << tr.t[i].fa << ' ';
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/cartesian_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/cartesian_tree/"

#line 1 "src/code/ds/cartesian_tree.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/ds/cartesian_tree.hpp"

namespace tifa_libs::ds {

template <class T>
class cartesian_tree {
  struct YYZ {
    u32 fa;
    arr<u32, 2> son{-1u, -1u};
  };

  constexpr void build(vec<T> const& y) {
    vecu s(y.size() + 1);
    u32 top = 0;
    for (u32 i = 0; i < y.size(); i++) {
      u32 k = top;
      while (k && y[s[k]] > y[i]) --k;
      if (k) t[s[k]].son[1] = i, t[i].fa = s[k];
      if (k < top) t[i].son[0] = s[k + 1], t[s[k + 1]].fa = i;
      s[top = ++k] = i;
    }
    t[root = s[1]].fa = s[1];
  }

 public:
  u32 root;
  vec<YYZ> t;

  explicit constexpr cartesian_tree(vec<T> const& y) : root(), t(y.size()) { build(y); }
};

}  // namespace tifa_libs::ds


#line 4 "src/test_cpverifier/library-checker/cartesian_tree.test.cpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n;
  std::cin >> n;
  vec<i32> a(n);
  for (auto &x : a) std::cin >> x;
  tifa_libs::ds::cartesian_tree tr(a);
  for (u32 i = 0; i < n; ++i) std::cout << tr.t[i].fa << ' ';
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 almost-decreasing_00 :heavy_check_mark: AC 115 ms 23 MB
g++-12 almost-decreasing_01 :heavy_check_mark: AC 63 ms 12 MB
g++-12 almost-increasing_00 :heavy_check_mark: AC 120 ms 23 MB
g++-12 almost-increasing_01 :heavy_check_mark: AC 60 ms 12 MB
g++-12 decreasing_00 :heavy_check_mark: AC 117 ms 23 MB
g++-12 decreasing_01 :heavy_check_mark: AC 60 ms 12 MB
g++-12 example_00 :heavy_check_mark: AC 10 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 9 ms 4 MB
g++-12 increasing_00 :heavy_check_mark: AC 123 ms 23 MB
g++-12 increasing_01 :heavy_check_mark: AC 62 ms 12 MB
g++-12 random_00 :heavy_check_mark: AC 127 ms 23 MB
g++-12 random_01 :heavy_check_mark: AC 63 ms 12 MB
g++-12 random_02 :heavy_check_mark: AC 76 ms 15 MB
g++-12 random_03 :heavy_check_mark: AC 59 ms 12 MB
g++-12 random_04 :heavy_check_mark: AC 101 ms 19 MB
g++-12 small_00 :heavy_check_mark: AC 10 ms 4 MB
g++-12 small_01 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_02 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_03 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_04 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_05 :heavy_check_mark: AC 8 ms 4 MB
g++-12 small_06 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_07 :heavy_check_mark: AC 10 ms 4 MB
g++-12 small_08 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_09 :heavy_check_mark: AC 9 ms 4 MB
Back to top page