#1192562 (C++23) No.3760 Streaming Schedule

• 問題: No.3760 Streaming Schedule
• ユーザー: miscalc
• 提出日時: 2026-10-09 23:33:56
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 21,154 bytes
• コンパイル時間: 2,263 ms
• コンパイル使用メモリ: 353,364 KB
• 実行使用メモリ: 18,524 KB
• 最終ジャッジ日時: 2026-10-09 23:34:13
• 合計ジャッジ時間: 5,734 ms
• ジャッジサーバーID （参考情報）: judge5_1 / judge3_1

ファイルパターン	結果
sample	AC * 3
other	AC * 13 WA * 34

ソースコード

// #define MULTI_TESTCASE
// #define AOJ_TESTCASE

// #define FAST_CIO
// #define INTERACTIVE

#define INF 4'000'000'000'000'000'037LL

// https://github.com/miscalculation53/library/tree/wip/template/template_all.hpp

// https://github.com/miscalculation53/library/tree/wip/template/template_all_but_modint.hpp

// https://github.com/miscalculation53/library/tree/wip/template/template_types.hpp

#include <bits/stdc++.h>
namespace {
using namespace std;

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using pll = pair<ll, ll>;

#define vc vector

using i128 = __int128_t;
using u128 = __uint128_t;

#define cauto const auto
// https://github.com/miscalculation53/library/tree/wip/template/template_rep.hpp

#define overload4(_1,_2,_3,_4,name,...) name
#define rep2(i,l,r) for (ll i = ll(l), rrrrr = ll(r); i < rrrrr; i++)
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define repi1(i,n) for (int i = 0, nnnnn = int(n); i < nnnnn; i++)
#define repi3(i,l,r,d) for (int i = int(l), rrrrr = int(r), ddddd = int(d); ddddd > 0 ? i < rrrrr : i > rrrrr; i += d)
#define repi(...) overload4(__VA_ARGS__, repi3, repi2, repi1)(__VA_ARGS__)

#define fec(...) for (cauto &__VA_ARGS__)
// https://github.com/miscalculation53/library/tree/wip/template/template_math.hpp

// https://github.com/miscalculation53/library/tree/wip/utils/is_integral_ext.hpp

template <class T>
constexpr bool is_integral_ext = is_integral_v<T> || is_same_v<T, i128> || is_same_v<T, u128>;

template <class T>
constexpr bool is_signed_ext = is_signed_v<T> || is_same_v<T, i128>;

template <class T>
constexpr bool is_unsigned_ext = is_unsigned_v<T> || is_same_v<T, u128>;
// https://github.com/miscalculation53/library/tree/wip/utils/default_infty.hpp

namespace default_infty_detail
{
  template <class T, class = void>
  struct has_infty : false_type {};

  template <class T>
  struct has_infty<T, void_t<decltype(T::infty())>> : true_type {};

  template <class T>
  const T &custom_value();

  template <class T>
  inline constexpr bool unsupported = false;
}

template <class T>
constexpr decltype(auto) default_infty()
{
  if constexpr (default_infty_detail::has_infty<T>::value)
    return default_infty_detail::custom_value<T>();
  else if constexpr (is_same_v<T, i128> || is_same_v<T, u128>)
    return T(INF) * T(INF);
  else if constexpr (is_integral_ext<T> && !is_same_v<T, bool>)
  {
    if constexpr (sizeof(T) >= sizeof(ll))
      return T(INF);
    else if constexpr (numeric_limits<T>::digits >= 31)
      return (T(1) << 30) - 1;
    else
      return T(numeric_limits<T>::max() / 2);
  }
  else if constexpr (numeric_limits<T>::has_infinity)
    return numeric_limits<T>::infinity();
  else
    static_assert(default_infty_detail::unsupported<T>, "No default infinity for this type; specify infty explicitly or define T::infty().");
}

template <class T = ll, class U, class V, typename = enable_if_t<is_integral_ext<U> && is_integral_ext<V>>>
inline constexpr T divfloor(U a, V b) { return T(a) / T(b) - (T(a) % T(b) && (T(a) ^ T(b)) < 0); }
template <class T = ll, class U, class V, typename = enable_if_t<is_integral_ext<U> && is_integral_ext<V>>>
inline constexpr T safemod(U a, V b) { return T(a) - T(b) * divfloor<T>(a, b); }

// https://github.com/miscalculation53/library/tree/wip/template/template_vector.hpp

template <class T = ll, class V>
inline T SZ(const V &x) { return x.size(); }
#define eb emplace_back

// https://github.com/miscalculation53/library/tree/wip/template/template_algo.hpp

// https://github.com/miscalculation53/library/tree/wip/utils/resolved_infty.hpp

// https://github.com/miscalculation53/library/tree/wip/utils/resolved_value.hpp

template <class T, auto x, enable_if_t<!is_invocable_v<decltype(x)>, int> = 0>
constexpr T resolved_value();

template <class T, auto x, enable_if_t<is_invocable_v<decltype(x)>, long> = 0>
const T &resolved_value();

template <class T, auto x = nullptr>
constexpr decltype(auto) resolved_infty()
{
  if constexpr (is_same_v<decltype(x), nullptr_t>)
    return default_infty<T>();
  else
    return resolved_value<T, x>();
}

template <class V>
auto SUM(const V &v)
{
  typename V::value_type s{};
  fec(vi : v) s += vi;
  return s;
}

template <class T, class = void>
struct has_e0 : false_type {};
template <class T>
struct has_e0<T, void_t<decltype(T::e0())>> : true_type {};
template <class T>
inline constexpr bool has_e0_v = has_e0<T>::value;

template <class T, auto infty = nullptr>
struct MonoidMax
{
  using S = T;
  static constexpr S op(S a, S b) { return max(a, b); }
  static constexpr S e() { return -resolved_infty<T, infty>(); }
};

namespace internal
{
}

constexpr array<pll, 4> DRULgrid = {{{1, 0}, {0, 1}, {-1, 0}, {0, -1}}};
constexpr array<pll, 4> DRULplane = {{{0, -1}, {1, 0}, {0, 1}, {-1, 0}}};
// https://github.com/miscalculation53/library/tree/wip/template/template_binsearch.hpp

template <class T>
struct is_random_access_iterator
{
  static constexpr bool value = is_same_v<
    typename iterator_traits<T>::iterator_category,
    random_access_iterator_tag
  >;
};
template <class T>
constexpr bool is_random_access_iterator_v = is_random_access_iterator<T>::value;

namespace internal
{
};

// https://github.com/miscalculation53/library/tree/wip/template/template_bit.hpp

template <class T>
inline constexpr ull MASK(T k) { return (1ULL << k) - 1ULL; }

inline constexpr ll bit_ceil(ll x) { return std::bit_ceil((ull)x); }
inline constexpr ll countr_zero(ll x) { assert(x != 0); return std::countr_zero((ull)x); }

// https://github.com/miscalculation53/library/tree/wip/template/template_inout.hpp

// https://github.com/miscalculation53/library/tree/wip/template/template_dump.hpp

// https://github.com/miscalculation53/library/tree/wip/template/template_dump_map.hpp

#define dump(...) ((void)0)
#define oj(...) __VA_ARGS__

namespace fastio {
template <class T>
struct unsigned_integer
{
  using type = make_unsigned_t<T>;
};
template <>
struct unsigned_integer<i128>
{
  using type = u128;
};
template <>
struct unsigned_integer<u128>
{
  using type = u128;
};
template <class T>
using unsigned_integer_t = typename unsigned_integer<T>::type;

static constexpr uint32_t SIZ = 1 << 17;
char ibuf[SIZ];
char obuf[SIZ];
char out[100];

uint32_t pil = 0, pir = 0, por = 0;

struct Pre {
  char num[10000][4];
  constexpr Pre() : num() {
    for (int i = 0; i < 10000; i++) {
      int n = i;
      for (int j = 3; j >= 0; j--) {
        num[i][j] = n % 10 | '0';
        n /= 10;
      }
    }
  }
} constexpr pre;

inline void load() {
  memcpy(ibuf, ibuf + pil, pir - pil);
  pir = pir - pil + fread(ibuf + pir - pil, 1, SIZ - pir + pil, stdin);
  pil = 0;
  if (pir < SIZ) ibuf[pir++] = '\n';
}

inline void flush() {
  fwrite(obuf, 1, por, stdout);
  por = 0;
}

template <bool check_buffer = true, typename T>
void rd1_integer(T &x) {
  using U = unsigned_integer_t<T>;
  bool minus = false;
  U val = 0;
  if constexpr (check_buffer)
    if (pil + 100 > pir) load();
  uint32_t p = pil;
  while (ibuf[p] < '-') ++p;
  if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
    if (ibuf[p] == '-') minus = true, ++p;
  }
  while ('0' <= ibuf[p]) val = val * 10 + (ibuf[p++] & 15);
  pil = p;
  if constexpr (is_signed<T>::value || is_same_v<T, i128>)
  {
    if (minus)
    {
      const U min_abs = U(numeric_limits<T>::max()) + 1;
      x = val == min_abs ? numeric_limits<T>::lowest() : -T(val);
    }
    else x = T(val);
  }
  else
    x = T(val);
}

void rd1(ll &x) { rd1_integer(x); }

template <class T>
void rd1(vc<T> &x) {
  for (auto &d: x) rd1(d);
}

template <class... T>
void read(T &...x) {
  if constexpr (sizeof...(T) <= SIZ / 100 &&
                ((!is_same_v<T, char> &&
                  (is_integral_v<T> || is_same_v<T, i128> || is_same_v<T, u128>)) && ...)) {
    if (pil + 100 * sizeof...(T) > pir) load();
    (rd1_integer<false>(x), ...);
  }
  else
    (rd1(x), ...);
}

void wt1(const char c) {
  if (por == SIZ) flush();
  obuf[por++] = c;
}

template <typename T>
void wt1_integer(T x) {
  if (por > SIZ - 100) flush();
  using U = unsigned_integer_t<T>;
  U ux;
  if constexpr (is_signed<T>::value || is_same_v<T, i128>)
  {
    if (x < 0)
      obuf[por++] = '-', ux = U(0) - U(x);
    else
      ux = U(x);
  }
  else
    ux = x;
  int outi;
  for (outi = 96; ux >= 10000; outi -= 4) {
    memcpy(out + outi, pre.num[ux % 10000], 4);
    ux /= 10000;
  }
  if (ux >= 1000) {
    memcpy(obuf + por, pre.num[ux], 4);
    por += 4;
  } else if (ux >= 100) {
    memcpy(obuf + por, pre.num[ux] + 1, 3);
    por += 3;
  } else if (ux >= 10) {
    int q = (ux * 103) >> 10;
    obuf[por] = q | '0';
    obuf[por + 1] = (ux - q * 10) | '0';
    por += 2;
  } else
    obuf[por++] = ux | '0';
  memcpy(obuf + por, out + outi + 4, 96 - outi);
  por += 96 - outi;
}

template <class T, enable_if_t<is_integral_v<T>, int> = 0>
void wt1(T x) { wt1_integer(x); }

template <class T, class U>
void wt1(const pair<T, U> &val);
template <class... T>
void wt1(const tuple<T...> &tpl);
template <class T, size_t S>
void wt1(const array<T, S> &val);
template <class T>
void wt1(const vector<T> &val);

template <class... T>
void write(T &&...x) {
  (wt1(std::forward<T>(x)), ...);
}

template <class... T>
void print(T &&...x) {
  if constexpr (sizeof...(T))
  {
    int i = 0;
    ((i++ ? wt1(' ') : void(), wt1(std::forward<T>(x))), ...);
  }
  wt1('\n');
}

} 

struct Dummy {
  Dummy() { atexit(fastio::flush); }
} dummy;

namespace internal
{

template <class... Ts>
void READnodump(Ts &...a) { fastio::read(a...); }

template <class... T>
void READVECnodump(int n, vc<T> &...v)
{
  (v.resize(n), ...);
  READnodump(v...);
}

}; 

#define READ(...) internal::READnodump(__VA_ARGS__); dump(__VA_ARGS__)

#define IN(T,...) T __VA_ARGS__; READ(__VA_ARGS__)

#define LL(...) IN(ll, __VA_ARGS__)

#define READVEC(...) internal::READVECnodump(__VA_ARGS__); dump(__VA_ARGS__)

#define VEC(T,n,...) vc<T> __VA_ARGS__; READVEC(n, __VA_ARGS__)

#define PRINT fastio::print

namespace internal
{

}; 

namespace internal
{

};

namespace internal
{

};

// https://github.com/miscalculation53/library/tree/wip/template/template_random.hpp

mt19937_64 mt;

namespace internal
{
}; 

// https://github.com/miscalculation53/library/tree/wip/math/modint/template_modint.hpp

// https://github.com/miscalculation53/library/tree/wip/math/modint/modint.hpp

// https://github.com/miscalculation53/library/tree/wip/math/modint/modint_internal_static.hpp

// https://github.com/miscalculation53/library/tree/wip/utils/larger_int.hpp

namespace larger_int_detail
{
}

template <class T>
struct larger_int
{
private:
  static constexpr bool check();
  static_assert(check());

public:
  using type = T;
};

#define LARGER_INT(T,U) template <> struct larger_int<T> { using type = U; };

LARGER_INT(signed char, short)
LARGER_INT(short, int)
LARGER_INT(int, long long)
LARGER_INT(long, __int128_t)
LARGER_INT(long long, __int128_t)

LARGER_INT(unsigned char, unsigned short)
LARGER_INT(unsigned short, unsigned int)
LARGER_INT(unsigned int, unsigned long long)
LARGER_INT(unsigned long, __uint128_t)
LARGER_INT(unsigned long long, __uint128_t)

#undef LARGER_INT

template <class T>
struct Rational;

template <class T>
struct larger_int<Rational<T>>
{
  using type = Rational<typename larger_int<T>::type>;
};

template <class T>
using larger_int_t = typename larger_int<T>::type;
// https://github.com/miscalculation53/library/tree/wip/math/modint/modint_internal_isprime.hpp

namespace internal
{

template <class T>
constexpr ll powmod_constexpr(ll x, ll n, T m)
{
  if (m == 1)
    return 0;
  using U = make_unsigned_t<T>;
  using L = larger_int_t<U>;

  U r = 1, y = safemod(x, m);
  while (n)
  {
    if (n & 1)
      r = L(r) * y % m;
    y = L(y) * y % m;
    n >>= 1;
  }
  return r;
}

template <auto n>
constexpr bool isprime = isprime_constexpr(n);

};

namespace internal
{

template <auto M>
struct policy_static
{
  using mod_type = decltype(M);
  using value_type = make_unsigned_t<mod_type>;
  using calc_type = conditional_t<(M <= UINT_MAX), ull, larger_int_t<value_type>>;

  static constexpr bool is_prime = isprime_constexpr(M);

  static constexpr value_type init(value_type v) { return v; }
  static constexpr mod_type val(value_type v);
};

};
// https://github.com/miscalculation53/library/tree/wip/math/modint/modint_internal_barrett32.hpp

namespace internal
{

struct barrett32
{
  uint m = 0;
  ull im = 0;
  barrett32() = default;
  explicit barrett32(uint m) : m(m), im((ull)(-1) / m + 1) {}
};

template <int id>
struct policy_barrett32
{
  using value_type = uint;
  using calc_type = ull;
  using mod_type = int;
  
  static constexpr bool is_prime = false;
  static inline barrett32 reducer{};
  static value_type init(value_type v) { return v; }
  static mod_type val(value_type v);
};

};
// https://github.com/miscalculation53/library/tree/wip/math/modint/modint_internal_montgomery64.hpp

namespace internal
{

inline constexpr ull inv64(ull a)
{
  ull x = a;
  while (a * x != 1) x *= 2 - a * x;
  return x;
}

struct montgomery64odd
{
  ull m = 0, im = 0, sq = 0;
  montgomery64odd() = default;
  explicit montgomery64odd(ull m) : m(m), im(inv64(m)), sq(-u128(m) % m) {}
  ull reduce(u128 x) const
  {
    auto t = (x + u128(m) * (-im * ull(x))) >> 64;
    if (t >= m) t -= m;
    return (ull)t;
  }
  ull inv_reduce(i128 v) const { return reduce(u128(v % m + m) * sq); }
};

struct montgomery64
{
  ull m = 0, mx = 0, imx = 0, d = 0, q = 0;
  uint b = 0;
  montgomery64() = default;
  explicit montgomery64(ull m) : m(m)
  {
    b = countr_zero(m), mx = m >> b; 
    imx = inv64(mx);
    d = powmod_constexpr((mx + 1) / 2, b, mx); 
    u128 sq = -u128(mx) % mx; 
    q = (1 + (((sq - 1) * d) << b)) % m;
  }
  ull reduce(u128 x) const
  {
    if (b == 0)
    {
      auto t = (x + u128(mx) * (-imx * ull(x))) >> 64;
      if (t >= m) t -= m;
      return (ull)t;
    }
    ull p = x & MASK(b); 
    x = (x >> b) + p * d;
    ull y = p << (64 - b);
    auto t = (x + u128(mx) * (imx * (y - ull(x)))) >> (64 - b);
    if (t >= m) { t -= m; if (t >= m) t -= m; }
    return (ull)t;
  }
  ull inv_reduce(i128 v) const { return reduce(u128(v % m + m) * q); }
};

template <int id>
struct policy_montgomery64_odd
{
  using value_type = ull;
  using calc_type = u128;
  using mod_type = ll;

  static constexpr bool is_prime = false;
  static inline montgomery64odd reducer{};
  static value_type init(value_type v) { return reducer.inv_reduce(v); }
  static mod_type val(value_type v);
};

template <int id>
struct policy_montgomery64
{
  using value_type = ull;
  using calc_type = u128;
  using mod_type = ll;

  static constexpr bool is_prime = false;
  static inline montgomery64 reducer{};
  static value_type init(value_type v) { return reducer.inv_reduce(v); }
  static mod_type val(value_type v);
};

};
// https://github.com/miscalculation53/library/tree/wip/math/extgcd.hpp

namespace internal
{

  template <class Policy, class PowInv = void>
  struct modint_impl
  {
    using V = typename Policy::value_type;
    using M = typename Policy::mod_type;
    using mint = modint_impl;

  private:
    V _v;

  public:

    modint_impl();

    template <class T, typename = enable_if_t<is_integral_ext<T>>>
    modint_impl(T v);

    M val() const;

    friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }
    friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }
  
    friend void rd1(mint &x)
    {
      long long a;
      fastio::rd1(a);
      x = a;
    }
    friend void wt1(const mint &x)
    {
      fastio::wt1(x.val());
    }

  };

};

template <int mod>
using static_modint32 = internal::modint_impl<internal::policy_static<mod>>;
template <int id>
using dynamic_modint32 = internal::modint_impl<internal::policy_barrett32<id>>;
template <int id>
using dynamic_modint64_odd = internal::modint_impl<internal::policy_montgomery64_odd<id>>;
template <int id>
using dynamic_modint64 = internal::modint_impl<internal::policy_montgomery64<id>>;

using modint998244353 = static_modint32<998244353>;

template <class T>
struct is_modint : std::false_type
{
};
template <class Policy, class PowInv>
struct is_modint<internal::modint_impl<Policy, PowInv>> : std::true_type
{
};
template <class T>
inline constexpr bool is_modint_v = is_modint<T>::value;

template <class T>
struct is_static_modint : false_type {};
template <int m, class PowInv>
struct is_static_modint<internal::modint_impl<internal::policy_static<m>, PowInv>> : true_type {};
template <ll m, class PowInv>
struct is_static_modint<internal::modint_impl<internal::policy_static<m>, PowInv>> : true_type {};
template <class T>
inline constexpr bool is_static_modint_v = is_static_modint<T>::value;

template <class T>
struct is_dynamic_modint : false_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint32<id>> : true_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint64_odd<id>> : true_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint64<id>> : true_type {};
template <class T>
inline constexpr bool is_dynamic_modint_v = is_dynamic_modint<T>::value;

// https://github.com/miscalculation53/library/tree/wip/math/modint/power_table.hpp

// https://github.com/miscalculation53/library/tree/wip/math/modint/binomial.hpp

template <class T>
struct Binomial
{
private:
  inline static decltype(T::mod()) mod;
  
public:
  inline static vc<T> fac_, finv_, inv_;

};
// https://github.com/miscalculation53/library/tree/wip/math/modint/stom.hpp

// https://github.com/miscalculation53/library/tree/wip/math/modint/to_rational.hpp

// https://github.com/miscalculation53/library/tree/wip/math/svp2d.hpp

namespace cpp_dump
{
  template <class T>
  struct rat_value
  {
    T p, q;

    friend ostream &operator<<(ostream &os, const rat_value &x)
    {
      os << x.p;
      if (x.q != 1)
        os << '/' << x.q;
      return os;
    }
  };

  template <class T>
  inline constexpr bool rat_is_map = false;
  template <class... Args>
  inline constexpr bool rat_is_map<std::map<Args...>> = true;
  template <class... Args>
  inline constexpr bool rat_is_map<std::multimap<Args...>> = true;
  template <class... Args>
  inline constexpr bool rat_is_map<std::unordered_map<Args...>> = true;
  template <class... Args>
  inline constexpr bool rat_is_map<std::unordered_multimap<Args...>> = true;

}

using mint = modint998244353;
// using mint = modint1000000007;
// using mint = static_modint<1000000000>;
// using mint = modint;

void init()
{
  oj(mt.seed(random_device()()));
}

// https://github.com/miscalculation53/library/tree/wip/ds/segtree/segtree.hpp

template <class M>
struct SegmentTree
{
  using S = typename M::S;

private:
  int n, siz;
  vc<S> dat;
  void update(int i) { dat[i] = M::op(dat[2 * i], dat[2 * i + 1]); }

public:
  SegmentTree(int n) : SegmentTree(vc<S>(n, M::e())) {}
  template <class T>
  SegmentTree(const vc<T> &vec) : n(vec.size()), siz(bit_ceil(vec.size())), dat(2 * siz, M::e())
  {
    repi(i, vec.size()) dat[siz + i] = vec[i];
    repi(i, siz - 1, 0, -1) update(i);
  }

  void set(int p, const S &x)
  {
    assert(0 <= p && p < n);
    p += siz;
    dat[p] = x;
    while (p > 1)
      p >>= 1, update(p);
  }

  S get(int p) const
  {
    assert(0 <= p && p < n);
    return dat[siz + p];
  }
  S prod(int l, int r) const
  {
    assert(0 <= l && l <= r && r <= n);
    l += siz, r += siz;
    S sml = M::e(), smr = M::e();
    while (l < r)
    {
      if (l & 1)
        sml = M::op(sml, dat[l++]);
      if (r & 1)
        smr = M::op(dat[--r], smr);
      l >>= 1, r >>= 1;
    }
    return M::op(sml, smr);
  }

};

void main2()
{
  LL(N, B, C);
  VEC(ll, N, A);
  A.insert(A.begin(), 0);
  A.eb(0);

  // dp[i]: i 日目を休むときの最大値
  SegmentTree<MonoidMax<ll>> dp(SZ(A));
  dp.set(0, SUM(A));
  rep(i, 1, SZ(A))
  {
    // B == 2 のとき i-1 からきてはいけない (ただし i==1 や i==SZ(A)-1 のときは ok)
    // i-C-1, ..., (B == 2 && i > 1 ? i-2 : i-1)
    dp.set(i, dp.prod(max(0LL, i - C - 1), B == 2 && i != 1 && i != SZ(A) - 1 ? i - 1 : i) - A[i]);
  }
  dump(dp.content() | cp::index());
  PRINT(dp.get(SZ(A) - 1));
}

void test()
{

}

// https://github.com/miscalculation53/library/tree/wip/template/template_main.hpp

template <auto init, auto main2, auto test>
struct Main
{
  Main()
  {
    cauto CERR = [](string val, string color)
    {
      string s = "\033[" + color + "m" + val + "\033[m";
      
    };
  
    CERR("\n[FAST_IO]\n\n", "32");
    
    cout << fixed << setprecision(20);
  
    init();
    
    CERR("\n[SINGLE_TESTCASE]\n\n", "36");
    main2();
  }
};
Main<init, main2, test> main_dummy;
}
int main() {}