Tifa's CP Library

:heavy_check_mark: fastio (src/code/io/fastio.hpp)

Depends on

Verified with

Code

#ifndef TIFALIBS_IO_FASTIO
#define TIFALIBS_IO_FASTIO

#include "../fast/u32tostr.hpp"
#include "../util/traits.hpp"

namespace tifa_libs {
namespace fastio_impl_ {
//! UB if EOF occured during reading
template <u32 BUF>
class fastin {
  char bf_[BUF], *now_ = bf_, *end_ = bf_;
  FILE *f_;

 public:
  explicit fastin(FILE *f = stdin) : f_(f) {}

  char get() { return now_ == end_ && (end_ = (now_ = bf_) + fread(bf_, 1, BUF, f_), now_ == end_) ? EOF : *(now_)++; }
  char peek() { return now_ == end_ && (end_ = (now_ = bf_) + fread(bf_, 1, BUF, f_), now_ == end_) ? EOF : *(now_); }
  void rebind(FILE *f) { f_ = f, now_ = end_ = bf_; }
  bool iseof() { return peek() == EOF; }
  template <class T>
  requires(sint_c<T> && !char_c<T>)
  fastin &read(T &n) {
    bool is_neg = false;
    char ch = get();
    while (!isdigit(ch)) is_neg |= ch == '-', ch = get();
    n = 0;
    while (isdigit(ch)) (n *= 10) += ch & 15, ch = get();
    if (is_neg) n = -n;
    return *this;
  }
  template <class T>
  requires(uint_c<T> && !char_c<T>)
  fastin &read(T &n) {
    char ch = get();
    while (!isdigit(ch)) ch = get();
    n = 0;
    while (isdigit(ch)) (n *= 10) += ch & 15, ch = get();
    return *this;
  }
  template <mint_c T>
  fastin &read(T &n) {
    decltype(std::declval<T>().sval()) x;
    return read(x), n = T(x), *this;
  }
  //! ignore cntrl and space
  template <char_c T>
  fastin &read(T &n) {
    while (!isgraph(n = get()));
    return *this;
  }
  fastin &read(char *n) {
    char *n_ = n;
    while (!isgraph(*n_ = get()));
    while (isgraph(*(++n_) = get()));
    return *n_ = '\0', *this;
  }
  fastin &read(strn &n) {
    n.clear();
    char n_;
    while (!isgraph(n_ = get()));
    n.push_back(n_);
    while (isgraph(n_ = get())) n.push_back(n_);
    return *this;
  }
  template <class T, class U>
  fastin &read(std::pair<T, U> &p) { return read(p.first).read(p.second); }
  template <class... Ts>
  fastin &read(std::tuple<Ts...> &p) {
    return std::apply([&](Ts &...targs) { ((read(targs)), ...); }, p), *this;
  }
  template <container_c T>
  fastin &read(T &p) {
    if (p.begin() == p.end()) return *this;
    for (auto &i : p) read(i);
    return *this;
  }
  fastin &getline(char *n) {
    char *n_ = n;
    while (!isprint(*n_ = get()));
    while (isprint(*(++n_) = get()));
    return *n_ = '\0', *this;
  }
  fastin &getline(strn &n) {
    char n_;
    while (!isprint(n_ = get()));
    n.push_back(n_);
    while (isprint(n_ = get())) n.push_back(n_);
    return *this;
  }
  //! NOT ignore cntrl and space
  template <char_c T>
  fastin &strict_read(T &n) { return n = get(), *this; }
  template <class T>
  fastin &operator>>(T &val) { return read(val); }
};
template <u32 BUF, u32 INTBUF>
class fastout {
  char int_bf_[INTBUF], *now_ib_ = int_bf_;
  FILE *f_;
  char *now_, bf_[BUF];
  const char *const end_ = bf_ + BUF;

 public:
  explicit fastout(FILE *file = stdout) : f_(file), now_(bf_) {}

  fastout &operator=(fastout CR r) {
    if (&r == this) return *this;
    return f_ = r.f_, now_ = bf_ + (r.now_ - r.bf_), memcpy(bf_, r.bf_, sizeof(*bf_) * (r.now_ - r.bf_)), *this;
  }
  fastout(fastout CR r) { *this = r; }
  ~fastout() { flush(); }

  void flush() { fwrite(bf_, 1, usz(now_ - bf_), f_), now_ = bf_; }
  void rebind(FILE *file) { f_ = file; }
  template <char_c T>
  fastout &write(T n) {
    if (now_ == end_) flush();
    return *(now_++) = n, *this;
  }
  fastout &write(const char *n) {
    usz len = strlen(n), l_;
    const char *n_ = n;
    while (now_ + len >= end_) memcpy(now_, n_, l_ = usz(end_ - now_)), now_ += l_, n_ += l_, len -= l_, flush();
    return memcpy(now_, n_, len), now_ += len, *this;
  }
  template <class T>
  requires(sint_c<T> && !char_c<T>)
  fastout &write(T n) {
    if (n < 0) write('-'), n = -n;
    return write(to_uint_t<T>(n));
  }
  template <class T>
  requires(uint_c<T> && !char_c<T>)
  fastout &write(T n) {
    if CEXP (sizeof(T) <= 4) return memset(now_ib_ = int_bf_, 0, 11), u32tostr(n, now_ib_), write(now_ib_);
    now_ib_ = int_bf_ + INTBUF - 1;
    do *(--(now_ib_)) = char(n % 10) | '0';
    while (n /= 10);
    return write(now_ib_);
  }
  template <mint_c T>
  fastout &write(T n) { return write(n.val()); }
  fastout &write(strn CR str) { return write(str.c_str()); }
  template <class T, class U>
  fastout &write(std::pair<T, U> CR p) { return write(p.first).space().write(p.second); }
  template <class... Ts>
  fastout &write(std::tuple<Ts...> CR p) {
    std::apply(
        [&](Ts CR... targs) {
          usz n{0};
          ((write(targs).space_if(++n != sizeof...(Ts))), ...);
        },
        p);
    return *this;
  }
  template <container_c T>
  fastout &write(T CR p) {
    if (p.begin() == p.end()) return *this;
    auto it = p.begin();
    for (write(*it++); it != p.end(); ++it) space().write(*it);
    return *this;
  }
  fastout &linebreak() { return write('\n'); }
  fastout &linebreak_if(bool flag) { return flag ? linebreak() : *this; }
  fastout &space() { return write(' '); }
  fastout &space_if(bool flag) { return flag ? space() : *this; }
  template <class T>
  fastout &operator<<(T CR val) { return write(val); }
};
}  // namespace fastio_impl_
inline fastio_impl_::fastin<0x200005> fin;
inline fastio_impl_::fastout<0x200005, 41> fout;

}  // namespace tifa_libs

#endif
#line 1 "src/code/io/fastio.hpp"



#line 1 "src/code/fast/u32tostr.hpp"



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



#include <bits/stdc++.h>

#define CEXP constexpr
#define TPN typename
#define CR const&

#define cT_(...) std::conditional_t<sizeof(__VA_ARGS__) <= sizeof(size_t), __VA_ARGS__, __VA_ARGS__ CR>
#define fle_(T, i, l, r, ...) for (T i = (l), i##e = (r)__VA_OPT__(, ) __VA_ARGS__; i <= i##e; ++i)
#define flt_(T, i, l, r, ...) for (T i = (l), i##e = (r)__VA_OPT__(, ) __VA_ARGS__; i < i##e; ++i)

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

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 E>
using itl = std::initializer_list<E>;
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>
using ptvec = ptt<vec<T>>;
template <class T>
using ptvvec = ptt<vvec<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;
template <class T, usz ext = std::dynamic_extent>
using spn = std::span<T const, ext>;

#define mk_(V, A, T) using V##A = V<T>;
#define mk(A, T) mk_(ptt, A, T) mk_(pt3, A, T) mk_(pt4, A, T) mk_(vec, A, T) mk_(vvec, A, T) mk_(v3ec, A, T) mk_(vecpt, A, T) mk_(vvecpt, A, T) mk_(ptvec, A, T) mk_(ptvvec, A, T) mk_(spn, A, T) mk_(itl, A, T)
mk(b, bool) mk(i, i32) mk(u, u32) mk(ii, i64) mk(uu, u64);
#undef mk
#undef mk_

using namespace std::literals;
CEXP i8 operator""_i8(unsigned long long x) { return (i8)x; }
CEXP i16 operator""_i16(unsigned long long x) { return (i16)x; }
CEXP i32 operator""_i32(unsigned long long x) { return (i32)x; }
CEXP i64 operator""_i64(unsigned long long x) { return (i64)x; }
CEXP isz operator""_iz(unsigned long long x) { return (isz)x; }

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

inline const auto fn_0 = [](auto&&...) {};
inline const auto fn_is0 = [](auto x) { return x == 0; };

template <std::floating_point FP>
inline FP eps_v = std::sqrt(std::numeric_limits<FP>::epsilon());
template <std::floating_point FP>
CEXP void set_eps(FP v) { eps_v<FP> = v; }
using std::numbers::pi_v;

namespace tifa_libs {
using std::min, std::max, std::swap;
template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }
}  // namespace tifa_libs


#line 5 "src/code/fast/u32tostr.hpp"

namespace tifa_libs {

CEXP u32 u32tostr_si16(u64 x, char *s) {
  if (x <= 9) return *s = (char)(x | 0x30), 1;
  else if (x <= 99) {
    u64 lo = x, ll = ((lo * 103) >> 9) & 0x1E;
    return lo += ll * 3, ll = ((lo & 0xF0) >> 4) | ((lo & 0x0F) << 8), *(u16 *)s = (u16)(ll | 0x3030), 2;
  } else return 0;
}
CEXP u32 u32tostr_si32(u64 x, char *s) {
  u64 lo = 0, ll = 0;
  u32 digits = 0;
  if (x <= 99) return u32tostr_si16(x, s);
  lo = x, digits = (lo > 999) ? 4 : 3;
  ll = ((lo * 5243) >> 19) & 0xFF, lo = ((lo - ll * 100) << 16) | ll, ll = ((lo * 103) >> 9) & 0x1E001E, lo += ll * 3;
  ll = ((lo & 0x00F000F0) << 28) | ((lo & 0x000F000F) << 40) | 0x3030303000000000;
  if (u8 *p = (u8 *)&ll; digits == 4) *(u32 *)s = *(u32 *)(&p[4]);
  else *(u16 *)s = *(u16 *)(&p[5]), *(((u8 *)s) + 2) = p[7];
  return digits;
}

CEXP u32 u32tostr(u64 x, char *s) {
  u64 low = 0, ll = 0;
  u32 digits = 0;
  if (x <= 9999) return u32tostr_si32(x, s);
  if (x < 100000000) {
    if ((low = x) > 999999) digits = (low > 9999999) ? 8 : 7;
    else digits = (low > 99999) ? 6 : 5;
  } else {
    u64 high = (x * 0x55E63B89) >> 57;
    low = x - (high * 100000000), digits = u32tostr_si16(high, s) + 8;
  }
  ll = (low * 109951163) >> 40, (low -= ll * 10000) |= ll << 32;
  ll = ((low * 5243) >> 19) & 0x000000FF000000FF, low = ((low - ll * 100) << 16) | ll;
  ll = ((low * 103) >> 9) & 0x001E001E001E001E, low += ll * 3;
  ll = ((low & 0x00F000F000F000F0) >> 4) | (low & 0x000F000F000F000F) << 8;
  ll = (ll >> 32) | (ll << 32) | 0x3030303030303030;
  if (digits >= 8) memcpy(s + digits - 8, &ll, 8);
  else {
    u32 d = digits;
    char *s1 = s, *pll = &(((char *)&ll)[8 - digits]);
    if (d >= 4) memcpy(s1, pll, 4), s1 += 4, pll += 4, d -= 4;
    if (d >= 2) memcpy(s1, pll, 2), s1 += 2, pll += 2, d -= 2;
    if (d > 0) *(u8 *)s1 = *(u8 *)pll;
  }
  return digits;
}

}  // namespace tifa_libs


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



#line 5 "src/code/util/traits.hpp"

namespace tifa_libs {

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

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

template <class T>
CEXP 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>
CEXP 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>
CEXP 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>
CEXP 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>
CEXP 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>
CEXP 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>
CEXP 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>
concept dft_c = requires(T x, vec<TPN T::data_t> v, u32 n) {
  { x.size() } -> std::same_as<u32>;
  x.bzr(n);
  x.dif(v, n);
  x.dit(v, n);
};

template <class T>
concept ntt_c = dft_c<T> && requires(T x) {
  T::max_size;
  T::G;
};

template <class T>
CEXP 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 = TPN 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 = TPN to_uint<T>::type;

}  // namespace tifa_libs


#line 6 "src/code/io/fastio.hpp"

namespace tifa_libs {
namespace fastio_impl_ {
//! UB if EOF occured during reading
template <u32 BUF>
class fastin {
  char bf_[BUF], *now_ = bf_, *end_ = bf_;
  FILE *f_;

 public:
  explicit fastin(FILE *f = stdin) : f_(f) {}

  char get() { return now_ == end_ && (end_ = (now_ = bf_) + fread(bf_, 1, BUF, f_), now_ == end_) ? EOF : *(now_)++; }
  char peek() { return now_ == end_ && (end_ = (now_ = bf_) + fread(bf_, 1, BUF, f_), now_ == end_) ? EOF : *(now_); }
  void rebind(FILE *f) { f_ = f, now_ = end_ = bf_; }
  bool iseof() { return peek() == EOF; }
  template <class T>
  requires(sint_c<T> && !char_c<T>)
  fastin &read(T &n) {
    bool is_neg = false;
    char ch = get();
    while (!isdigit(ch)) is_neg |= ch == '-', ch = get();
    n = 0;
    while (isdigit(ch)) (n *= 10) += ch & 15, ch = get();
    if (is_neg) n = -n;
    return *this;
  }
  template <class T>
  requires(uint_c<T> && !char_c<T>)
  fastin &read(T &n) {
    char ch = get();
    while (!isdigit(ch)) ch = get();
    n = 0;
    while (isdigit(ch)) (n *= 10) += ch & 15, ch = get();
    return *this;
  }
  template <mint_c T>
  fastin &read(T &n) {
    decltype(std::declval<T>().sval()) x;
    return read(x), n = T(x), *this;
  }
  //! ignore cntrl and space
  template <char_c T>
  fastin &read(T &n) {
    while (!isgraph(n = get()));
    return *this;
  }
  fastin &read(char *n) {
    char *n_ = n;
    while (!isgraph(*n_ = get()));
    while (isgraph(*(++n_) = get()));
    return *n_ = '\0', *this;
  }
  fastin &read(strn &n) {
    n.clear();
    char n_;
    while (!isgraph(n_ = get()));
    n.push_back(n_);
    while (isgraph(n_ = get())) n.push_back(n_);
    return *this;
  }
  template <class T, class U>
  fastin &read(std::pair<T, U> &p) { return read(p.first).read(p.second); }
  template <class... Ts>
  fastin &read(std::tuple<Ts...> &p) {
    return std::apply([&](Ts &...targs) { ((read(targs)), ...); }, p), *this;
  }
  template <container_c T>
  fastin &read(T &p) {
    if (p.begin() == p.end()) return *this;
    for (auto &i : p) read(i);
    return *this;
  }
  fastin &getline(char *n) {
    char *n_ = n;
    while (!isprint(*n_ = get()));
    while (isprint(*(++n_) = get()));
    return *n_ = '\0', *this;
  }
  fastin &getline(strn &n) {
    char n_;
    while (!isprint(n_ = get()));
    n.push_back(n_);
    while (isprint(n_ = get())) n.push_back(n_);
    return *this;
  }
  //! NOT ignore cntrl and space
  template <char_c T>
  fastin &strict_read(T &n) { return n = get(), *this; }
  template <class T>
  fastin &operator>>(T &val) { return read(val); }
};
template <u32 BUF, u32 INTBUF>
class fastout {
  char int_bf_[INTBUF], *now_ib_ = int_bf_;
  FILE *f_;
  char *now_, bf_[BUF];
  const char *const end_ = bf_ + BUF;

 public:
  explicit fastout(FILE *file = stdout) : f_(file), now_(bf_) {}

  fastout &operator=(fastout CR r) {
    if (&r == this) return *this;
    return f_ = r.f_, now_ = bf_ + (r.now_ - r.bf_), memcpy(bf_, r.bf_, sizeof(*bf_) * (r.now_ - r.bf_)), *this;
  }
  fastout(fastout CR r) { *this = r; }
  ~fastout() { flush(); }

  void flush() { fwrite(bf_, 1, usz(now_ - bf_), f_), now_ = bf_; }
  void rebind(FILE *file) { f_ = file; }
  template <char_c T>
  fastout &write(T n) {
    if (now_ == end_) flush();
    return *(now_++) = n, *this;
  }
  fastout &write(const char *n) {
    usz len = strlen(n), l_;
    const char *n_ = n;
    while (now_ + len >= end_) memcpy(now_, n_, l_ = usz(end_ - now_)), now_ += l_, n_ += l_, len -= l_, flush();
    return memcpy(now_, n_, len), now_ += len, *this;
  }
  template <class T>
  requires(sint_c<T> && !char_c<T>)
  fastout &write(T n) {
    if (n < 0) write('-'), n = -n;
    return write(to_uint_t<T>(n));
  }
  template <class T>
  requires(uint_c<T> && !char_c<T>)
  fastout &write(T n) {
    if CEXP (sizeof(T) <= 4) return memset(now_ib_ = int_bf_, 0, 11), u32tostr(n, now_ib_), write(now_ib_);
    now_ib_ = int_bf_ + INTBUF - 1;
    do *(--(now_ib_)) = char(n % 10) | '0';
    while (n /= 10);
    return write(now_ib_);
  }
  template <mint_c T>
  fastout &write(T n) { return write(n.val()); }
  fastout &write(strn CR str) { return write(str.c_str()); }
  template <class T, class U>
  fastout &write(std::pair<T, U> CR p) { return write(p.first).space().write(p.second); }
  template <class... Ts>
  fastout &write(std::tuple<Ts...> CR p) {
    std::apply(
        [&](Ts CR... targs) {
          usz n{0};
          ((write(targs).space_if(++n != sizeof...(Ts))), ...);
        },
        p);
    return *this;
  }
  template <container_c T>
  fastout &write(T CR p) {
    if (p.begin() == p.end()) return *this;
    auto it = p.begin();
    for (write(*it++); it != p.end(); ++it) space().write(*it);
    return *this;
  }
  fastout &linebreak() { return write('\n'); }
  fastout &linebreak_if(bool flag) { return flag ? linebreak() : *this; }
  fastout &space() { return write(' '); }
  fastout &space_if(bool flag) { return flag ? space() : *this; }
  template <class T>
  fastout &operator<<(T CR val) { return write(val); }
};
}  // namespace fastio_impl_
inline fastio_impl_::fastin<0x200005> fin;
inline fastio_impl_::fastout<0x200005, 41> fout;

}  // namespace tifa_libs
Back to top page
This site is open source. Improve this page.