Tifa's CP Library

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

Depends on

Code

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

#include "../../code/io/ios_container.hpp"
#include "../../code/math/youngt.hpp"
#include "../../code/opt/lis.hpp"

constexpr u32 inf = 1145141919;

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n;
  std::cin >> n;
  vecu a(n);
  std::cin >> a;
  tifa_libs::math::Youngt yt(a);
  std::cout << yt.width() << '\n'
            << tifa_libs::opt::lis(a, inf) << '\n';
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/longest_increasing_subsequence.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/longest_increasing_subsequence"

#line 1 "src/code/io/ios_container.hpp"



#line 1 "src/code/util/traits.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/util/traits.hpp"

namespace tifa_libs {

template <class T>
concept iterable_c = requires(T v) {
  { v.begin() } -> std::same_as<typename T::iterator>;
  { v.end() } -> std::same_as<typename T::iterator>;
};

template <class T>
concept container_c = iterable_c<T> && !std::derived_from<T, std::basic_string<typename T::value_type>>;

template <class T>
constexpr bool is_char_v = std::is_same_v<T, char> || std::is_same_v<T, signed char> || std::is_same_v<T, unsigned char>;
template <class T>
concept char_c = is_char_v<T>;

template <class T>
constexpr bool is_s128_v = std::is_same_v<T, __int128_t> || std::is_same_v<T, __int128>;
template <class T>
concept s128_c = is_s128_v<T>;

template <class T>
constexpr bool is_u128_v = std::is_same_v<T, __uint128_t> || std::is_same_v<T, unsigned __int128>;
template <class T>
concept u128_c = is_u128_v<T>;

template <class T>
constexpr bool is_i128_v = is_s128_v<T> || is_u128_v<T>;
template <class T>
concept i128_c = is_u128_v<T>;

template <class T>
constexpr bool is_int_v = std::is_integral_v<T> || is_i128_v<T>;
template <class T>
concept int_c = is_int_v<T>;

template <class T>
constexpr bool is_sint_v = is_s128_v<T> || (is_int_v<T> && std::is_signed_v<T>);
template <class T>
concept sint_c = is_sint_v<T>;

template <class T>
constexpr bool is_uint_v = is_u128_v<T> || (is_int_v<T> && std::is_unsigned_v<T>);
template <class T>
concept uint_c = is_uint_v<T>;

template <class T>
concept mint_c = requires(T x) {
  { x.mod() } -> uint_c;
  { x.val() } -> uint_c;
};

template <class T>
constexpr bool is_arithm_v = std::is_arithmetic_v<T> || is_int_v<T>;
template <class T>
concept arithm_c = is_arithm_v<T>;

template <class T>
struct to_sint : std::make_signed<T> {};
template <>
struct to_sint<u128> {
  using type = u128;
};
template <>
struct to_sint<i128> {
  using type = u128;
};
template <class T>
using to_sint_t = typename to_sint<T>::type;

template <class T>
struct to_uint : std::make_unsigned<T> {};
template <>
struct to_uint<u128> {
  using type = u128;
};
template <>
struct to_uint<i128> {
  using type = u128;
};
template <class T>
using to_uint_t = typename to_uint<T>::type;

}  // namespace tifa_libs


#line 5 "src/code/io/ios_container.hpp"

template <tifa_libs::container_c T>
std::istream &operator>>(std::istream &is, T &x) {
  for (auto &i : x) is >> i;
  return is;
}
template <tifa_libs::container_c T>
std::ostream &operator<<(std::ostream &os, T const &x) {
  if (x.begin() == x.end()) return os;
  auto it = x.begin();
  os << *it++;
  for (; it != x.end(); ++it) os << ' ' << *it;
  return os;
}


#line 1 "src/code/math/youngt.hpp"



#line 5 "src/code/math/youngt.hpp"

namespace tifa_libs::math {

class Youngt {
  vvecu d;
  u32 n;

 public:
  constexpr explicit Youngt(vecu const& l) {
    for (auto i : l) insert(i);
  }
  constexpr Youngt(std::initializer_list<u32> l = {}) {
    for (auto i : l) insert(i);
  }
  constexpr Youngt(std::initializer_list<std::initializer_list<u32>> l) {
    for (auto&& i : l) d.emplace_back(i);
  }

  // height() == len(longest non-decresing seq.)
  constexpr u32 height() const { return (u32)d.size(); }
  // width() == len(longest incresing seq.)
  constexpr u32 width() const { return (u32)d[0].size(); }
  constexpr u32 const& size() const { return n; }
  constexpr vvecu& data() { return d; }
  constexpr vvecu const& data() const { return d; }
  constexpr u32& operator()(u32 h, u32 w) { return d[h][w]; }
  constexpr u32 const& operator()(u32 h, u32 w) const { return d[h][w]; }

  constexpr u32 hook(u32 h, u32 w) const {
    assert(h < height() && w < d[h].size());
    return u32(d[h].size() - w + h);
  }

  constexpr void insert(u32 val) {
    ++n;
    for (auto& i : d) {
      auto it = std::ranges::lower_bound(i, val);
      if (it == i.end()) {
        i.push_back(val);
        return;
      }
      std::swap(val, *it);
    }
    d.push_back({val});
  }

  friend std::ostream& operator<<(std::ostream& os, Youngt const& yt) {
    for (u32 i = 0; i < yt.height() - 1; ++i)
      for (u32 j = 0; j < yt.d[i].size(); ++j) os << yt.d[i][j] << " \n"[j == yt.d[i].size() - 1];
    os << yt.d.back()[0];
    for (u32 j = 1; j < yt.d.back().size(); ++j) os << ' ' << yt.d.back()[j];
    return os;
  }
};

}  // namespace tifa_libs::math


#line 1 "src/code/opt/lis.hpp"



#line 5 "src/code/opt/lis.hpp"

namespace tifa_libs::opt {

// @return INDEX of LIS in @a
template <class T, class C = std::less<T>>
constexpr vecu lis(vec<T> const& a, T inf = std::numeric_limits<T>::max(), C&& comp = C{}) {
  vec<T> f{inf};
  vecu g;
  for (auto i : a) {
    auto it = std::ranges::lower_bound(f, i, comp);
    g.push_back(u32(it - f.begin()));
    if (it == f.end()) f.push_back(i);
    else *it = i;
  }
  T val = inf;
  vecu ret;
  for (u32 i = u32(g.size() - 1), now = u32(f.size() - 1); ~i; --i)
    if (g[i] == now && val > a[i]) {
      ret.push_back((u32)i);
      --now;
      val = a[i];
    }
  std::ranges::reverse(ret);
  return ret;
}

}  // namespace tifa_libs::opt


#line 6 "src/test_cpverifier/library-checker/longest_increasing_subsequence.test.cpp"

constexpr u32 inf = 1145141919;

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n;
  std::cin >> n;
  vecu a(n);
  std::cin >> a;
  tifa_libs::math::Youngt yt(a);
  std::cout << yt.width() << '\n'
            << tifa_libs::opt::lis(a, inf) << '\n';
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 11 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 11 ms 4 MB
g++-12 hand_max_00 :heavy_check_mark: AC 87 ms 14 MB
g++-12 hand_min_00 :heavy_check_mark: AC 219968 ms 37 MB
g++-12 max_random_00 :heavy_check_mark: AC 4819 ms 11 MB
g++-12 max_random_01 :heavy_check_mark: AC 4677 ms 10 MB
g++-12 max_random_02 :heavy_check_mark: AC 4777 ms 10 MB
g++-12 max_random_03 :heavy_check_mark: AC 4613 ms 11 MB
g++-12 max_random_04 :heavy_check_mark: AC 4689 ms 11 MB
g++-12 random_00 :heavy_check_mark: AC 3103 ms 9 MB
g++-12 random_01 :heavy_check_mark: AC 4176 ms 10 MB
g++-12 random_02 :heavy_check_mark: AC 121 ms 4 MB
g++-12 random_03 :heavy_check_mark: AC 3719 ms 10 MB
g++-12 random_04 :heavy_check_mark: AC 1742 ms 8 MB
g++-12 small_00 :heavy_check_mark: AC 11 ms 4 MB
g++-12 small_01 :heavy_check_mark: AC 10 ms 4 MB
g++-12 small_02 :heavy_check_mark: AC 10 ms 4 MB
g++-12 small_03 :heavy_check_mark: AC 10 ms 4 MB
g++-12 small_04 :heavy_check_mark: AC 10 ms 4 MB
Back to top page