Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/unit-test/nt/lsieve2.loj6680.ss.test.cpp

Depends on

Code

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

// clang-format off
#include "../../../code/util/pair_op.hpp"
// clang-format on

#include "../../../code/nt/lsieve2.hpp"

#include "../../../code/math/mint_ss.hpp"
#include "../base.hpp"

using mint = tifa_libs::math::mint_ss<998244353>;

void test(strn const& data) {
  strn path = "src/data/loj/6680/" + data;
  std::ifstream fin(path + ".in"), fans(path + ".out");

  u32 n;
  fin >> n;
  tifa_libs::math::lsieve2 ls(n);
  ptt<mint> lst;
  vecpt<mint> g = ls.run([&](u32 p, u32 e) {
    if (e == 1) return lst = ptt<mint>(p + (p ^ 1), 1 + (p ^ 1));
    else return lst = ptt<mint>((lst.first * p + (p ^ e)), (lst.second + (p ^ e)));
  },
                         ptt<mint>{1, 1});

  vec<mint> f(n + 1);
  f[1] = 1;
  for (u32 i = 2; i <= n; ++i) f[i] = f[i - 1] + g[i].first + g[i].first - g[i].second;
  u64 got = f[1].val();
  for (u32 i = 2; i <= n; ++i) got ^= f[i].val();

  u64 want;
  fans >> want;
  check(got, want, check_param(data));
}

int main() {
  auto tcase = tifa_libs::unittest::pre_test();

  switch (tcase) {
    case tifa_libs::unittest::ts_example_00:
      test("1");
      test("2");
      break;
    case tifa_libs::unittest::ts_example_01:
      test("3");
      test("4");
      break;
    case tifa_libs::unittest::ts_random_00:
      test("5");
      test("6");
      break;
    case tifa_libs::unittest::ts_random_01:
      test("7");
      test("8");
      break;
    case tifa_libs::unittest::ts_random_02:
      test("9");
      test("10");
      break;
    case tifa_libs::unittest::ts_random_03:
      test("11");
      test("12");
      break;
    case tifa_libs::unittest::ts_random_04:
      test("13");
      test("14");
      break;
    case tifa_libs::unittest::ts_random_05:
      test("15");
      test("16");
      break;
    case tifa_libs::unittest::ts_random_06: test("17"); break;
    case tifa_libs::unittest::ts_random_07: test("18"); break;
    case tifa_libs::unittest::ts_random_08: test("19"); break;
    case tifa_libs::unittest::ts_random_09: test("20"); break;
    default: break;
  }

  tifa_libs::unittest::post_test();
}
#line 1 "src/test_cpverifier/unit-test/nt/lsieve2.loj6680.ss.test.cpp"
#define UNITTEST
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

// clang-format off
#line 1 "src/code/util/pair_op.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/pair_op.hpp"

#define OO_PTEQ_(op)                                                                                                                            \
  template <class T, class U>                                                                                                                   \
  constexpr auto operator op(std::pair<T, U> l, std::pair<T, U> const &r) { return std::pair<T, U>{l.first op r.first, l.second op r.second}; } \
  template <class T, class U>                                                                                                                   \
  constexpr std::pair<T, U> &operator op##=(std::pair<T, U> &l, std::pair<T, U> const &r) {                                                     \
    l.first op## = r.first;                                                                                                                     \
    l.second op## = r.second;                                                                                                                   \
    return l;                                                                                                                                   \
  }

OO_PTEQ_(+)
OO_PTEQ_(-)
OO_PTEQ_(*)
OO_PTEQ_(/)
OO_PTEQ_(%)
OO_PTEQ_(&)
OO_PTEQ_(|)
OO_PTEQ_(^)
OO_PTEQ_(<<)
OO_PTEQ_(>>)

#undef OO_PTEQ_


#line 6 "src/test_cpverifier/unit-test/nt/lsieve2.loj6680.ss.test.cpp"
// clang-format on

#line 1 "src/code/nt/lsieve2.hpp"



#line 5 "src/code/nt/lsieve2.hpp"

namespace tifa_libs::math {

class lsieve2 {
  vecpt<u32> pr;
  vecu fr;

 public:
  explicit constexpr lsieve2(u32 n) : fr(n + 1) {
    for (u32 i = 2, x = n / 2, p1, p2, e; i <= n; x = n / (++i)) {
      if (!fr[i]) {
        for (p1 = 1, p2 = i, e = 0; p1 <= x; p1 = p2, p2 *= i, ++e) fr[p2] = 1;
        pr.emplace_back(i, e);
      }
      for (u32 t = 0; t < pr.size(); ++t)
        if (u32 p = pr[t].first; p > x) break;
        else if (i % p) fr[p * i] = i;
        else {
          fr[p * i] = fr[i];
          break;
        }
    }
  }

  // @param F: T(u32, u32)
  // @param %fpi(p, i) = $f(p^i)$
  // @return v[i] = f(i), for i in [0, n]
  template <class T, class F>
  requires requires(F f, u32 p, u32 i) {
    { f(p, i) } -> std::same_as<T>;
  }
  constexpr vec<T> run(F fpi, T init = T{1}) {
    vec<T> v(fr.size());
    v[1] = init;
    for (u32 i = 0; i < pr.size(); ++i)
      for (u32 p = pr[i].first, e = pr[i].second, pe = p, ex = 1; ex <= e; ++ex, pe *= p) v[pe] = fpi(p, ex);
    for (u32 i = 2; i < fr.size(); ++i) v[i] = v[i / fr[i]] * v[fr[i]];
    return v;
  }
};

}  // namespace tifa_libs::math


#line 9 "src/test_cpverifier/unit-test/nt/lsieve2.loj6680.ss.test.cpp"

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



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



#line 1 "src/code/nt/inverse.hpp"



#line 1 "src/code/nt/inv_gcd.hpp"



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



#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<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/math/safe_mod.hpp"

namespace tifa_libs::math {

template <sint_c T>
constexpr T safe_mod(T x, to_uint_t<T> mod) { return ((x %= (T)mod) < 0 ? x + (T)mod : x); }

}  // namespace tifa_libs::math


#line 1 "src/code/nt/exgcd.hpp"



#line 5 "src/code/nt/exgcd.hpp"

namespace tifa_libs::math {

// @return tuple(g, x, y) s.t. g = gcd(a, b), xa + yb = g, |x| + |y| is the minimal (primary) and x <= y (secondarily)
template <sint_c T>
constexpr auto exgcd(T a, T b) {
  T x1 = 1, x2 = 0, x3 = 0, x4 = 1;
  while (b) {
    T c = a / b;
    std::tie(x1, x2, x3, x4, a, b) = std::make_tuple(x3, x4, x1 - x3 * c, x2 - x4 * c, b, a - b * c);
  }
  return std::make_tuple(to_uint_t<T>(a), x1, x2);
}

}  // namespace tifa_libs::math


#line 6 "src/code/nt/inv_gcd.hpp"

namespace tifa_libs::math {

template <uint_c T>
constexpr ptt<T> inv_gcd(T n, T mod) {
  using U = to_sint_t<T>;
  auto [g, x, y] = exgcd(U(n % mod), (U)mod);
  return {g, safe_mod(x, mod)};
}

}  // namespace tifa_libs::math


#line 5 "src/code/nt/inverse.hpp"

namespace tifa_libs::math {

template <uint_c T, uint_c U>
constexpr U inverse(T n, U mod) {
  auto [g, x] = inv_gcd(U(n % mod), mod);
  assert(g == 1);
  return x;
}

}  // namespace tifa_libs::math


#line 6 "src/code/math/mint.hpp"

namespace tifa_libs::math {

template <class D, uint_c Rt>
class mint {
  constexpr D const &d() const { return static_cast<D const &>(*this); }
  constexpr D &d() { return static_cast<D &>(*this); }

 protected:
  Rt v_{};

 public:
  constexpr mint() {}
  template <int_c T>
  constexpr mint(T v) : v_(D::mod_(v)) {}
  constexpr operator D() { return d(); }

  using raw_type = Rt;
  using sraw_type = to_sint_t<Rt>;
  static constexpr raw_type mod() { return D::mod_(); }
  static constexpr sraw_type smod() { return (sraw_type)D::mod_(); }
  constexpr raw_type val() const { return d().val_(); }
  constexpr sraw_type sval() const { return (sraw_type)d().val_(); }
  constexpr raw_type &data() { return d().data_(); }

  template <int_c T>
  explicit constexpr operator T() const { return (T)val(); }
  constexpr mint &operator+=(mint const &r) { return d().adde_(r.d()); }
  constexpr mint &operator-=(mint const &r) { return d().sube_(r.d()); }
  constexpr mint &operator*=(mint const &r) { return d().mule_(r.d()); }
  constexpr mint &operator/=(mint const &r) { return *this = *this * r.inv(); }
  constexpr mint const &operator+() const { return *this; }
  constexpr mint operator-() const { return d().neg_(); }
  constexpr mint inv() const { return inverse(val(), mod()); }
  friend constexpr mint operator+(mint l, mint const &r) { return l += r; }
  friend constexpr mint operator-(mint l, mint const &r) { return l -= r; }
  friend constexpr mint operator*(mint l, mint const &r) { return l *= r; }
  friend constexpr mint operator/(mint l, mint const &r) { return l /= r; }
  friend constexpr bool operator==(mint const &l, mint const &r) { return l.val() == r.val(); }
  friend constexpr auto operator<=>(mint const &l, mint const &r) { return l.sval() - r.sval(); }
  friend std::istream &operator>>(std::istream &is, mint &x) {
    i64 _;
    is >> _;
    x = mint(_);
    return is;
  }
  friend std::ostream &operator<<(std::ostream &os, mint const &x) { return os << x.val(); }
  friend constexpr mint abs(mint const &x) { return x.val(); }
};

}  // namespace tifa_libs::math


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

namespace tifa_libs::math {

template <u32 MOD>
class mint_ss : public mint<mint_ss<MOD>, u32> {
  using base = mint<mint_ss<MOD>, u32>;
  friend base;
  static_assert(MOD >= 1);

 public:
  static constexpr bool FIXED_MOD = true;
  constexpr mint_ss() {}
  template <int_c T>
  constexpr mint_ss(T v) { this->v_ = mod_(v); }

 private:
  using raw_t = typename base::raw_type;
  using sraw_t = typename base::sraw_type;
  template <sint_c T>
  static constexpr raw_t mod_(T v) {
    i64 x = i64(v % (i64)mod_());
    return raw_t(x + (x < 0 ? mod_() : 0));
  }
  template <uint_c T>
  static constexpr raw_t mod_(T v) { return raw_t(v % mod_()); }
  static constexpr raw_t mod_() { return MOD; }
  constexpr raw_t val_() const { return this->v_; }
  constexpr raw_t &data_() { return this->v_; }

  constexpr mint_ss neg_() const { return -(sraw_t)val_(); }
  constexpr mint_ss &adde_(mint_ss const &r) {
    data_() += r.val_();
    if (val_() >= mod_()) data_() -= mod_();
    return *this;
  }
  constexpr mint_ss &sube_(mint_ss const &r) {
    data_() -= r.val_();
    if (val_() >= mod_()) data_() += mod_();
    return *this;
  }
  constexpr mint_ss &mule_(mint_ss const &r) {
    data_() = u32((u64)val_() * r.val_() % mod_());
    return *this;
  }
};

}  // namespace tifa_libs::math


#line 1 "src/test_cpverifier/unit-test/base.hpp"



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



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

inline std::istream &operator>>(std::istream &is, i128 &n) {
  bool neg = false;
  while (!neg && !isdigit(is.peek())) {
    if (is.peek() == '-') neg = true;
    is.get();
  }
  n = 0;
  while (isdigit(is.peek())) (n *= 10) += is.get() & 15;
  if (neg) n = -n;
  return is;
}
inline std::istream &operator>>(std::istream &is, u128 &n) {
  while (!isdigit(is.peek())) is.get();
  n = 0;
  while (isdigit(is.peek())) (n *= 10) += is.get() & 15;
  return is;
}
inline std::ostream &operator<<(std::ostream &os, u128 n) {
  if (n > 9) os << n / 10;
  os << (uint_fast32_t)(n % 10);
  return os;
}
inline std::ostream &operator<<(std::ostream &os, i128 n) {
  if (n < 0) {
    os << '-';
    n = -n;
  }
  return os << (u128)n;
}


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



#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/io/ios_pair.hpp"



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

template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) { return is >> p.first >> p.second; }
template <class T, class U>
std::ostream &operator<<(std::ostream &os, std::pair<T, U> const &p) { return os << p.first << ' ' << p.second; }


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



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

template <class... Ts>
std::istream &operator>>(std::istream &is, std::tuple<Ts...> &p) {
  std::apply([&](Ts &...targs) { ((is >> targs), ...); }, p);
  return is;
}
template <class... Ts>
std::ostream &operator<<(std::ostream &os, std::tuple<Ts...> const &p) {
  std::apply(
      [&](Ts const &...targs) {
        usz n = 0;
        ((os << targs << (++n != sizeof...(Ts) ? " " : "")), ...);
      },
      p);
  return os;
}


#line 1 "src/code/rand/gen.hpp"



#line 5 "src/code/rand/gen.hpp"

namespace tifa_libs::rand {

template <class Distri>
class Gen {
  std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::mt19937, std::mt19937_64> re;
  Distri dist;

 public:
  using random_engine = decltype(re);
  using distribution = Distri;
  using result_type = typename Distri::result_type;

  constexpr Gen() : re(std::random_device{}()), dist() {}
  constexpr Gen(result_type a, result_type b) : re(std::random_device{}()), dist(a, b) {}

  constexpr void set_range(result_type a, result_type b) { dist = Distri(a, b); }
  constexpr random_engine& rand_eng() { return re; }
  constexpr Distri& distrib() { return dist; }

  void reset_seed() { re.seed((result_type)std::chrono::duration_cast<std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::chrono::seconds, std::chrono::nanoseconds>>(std::chrono::high_resolution_clock::now().time_since_epoch()).count()); }
  constexpr result_type operator()() { return dist(re); }
  result_type next() { return dist(re); }
};

}  // namespace tifa_libs::rand


#line 10 "src/test_cpverifier/unit-test/base.hpp"

namespace tifa_libs::unittest {

namespace detail__ {

template <class T>
strn to_str(T const &x) {
  std::stringstream ss;
  ss << std::fixed << std::setprecision(12) << x;
  return ss.str();
}

template <class T, class... Ts>
void check_(strn const &pretty_func, strn const &got_str, T const &got, strn const &want_str, T const &want, Ts... param) {
  if constexpr (sizeof...(param) == 0) {
    if (got != want) throw std::runtime_error(pretty_func + ": got \"" + got_str + "\" = " + to_str(got) + ", want \"" + want_str + "\" = " + to_str(want));
  } else {
    if (got != want) throw std::runtime_error(pretty_func + ": got \"" + got_str + "\" = " + to_str(got) + ", want \"" + want_str + "\" = " + to_str(want) + " with" + ((" " + param.first + " = " + ::tifa_libs::unittest::detail__::to_str(param.second) + " ;") + ...));
  }
}

template <class... Ts>
void check_bool_(strn const &pretty_func, strn const &expression, bool res, Ts... param) {
  if constexpr (sizeof...(param) == 0) {
    if (!res) throw std::runtime_error(pretty_func + " :\"" + expression + "\" failed");
  } else {
    if (!res) throw std::runtime_error(pretty_func + " :\"" + expression + "\" failed with" + ((" " + param.first + " = " + ::tifa_libs::unittest::detail__::to_str(param.second) + " ;") + ...));
  }
}

}  // namespace detail__

enum TESTCASE { ts_local,
                ts_example_00,
                ts_example_01,
                ts_random_00,
                ts_random_01,
                ts_random_02,
                ts_random_03,
                ts_random_04,
                ts_random_05,
                ts_random_06,
                ts_random_07,
                ts_random_08,
                ts_random_09 };

inline const std::map<ptt<u32>, TESTCASE> testcase_id{
    {{1234, 5678}, ts_example_00},
    {{1000000000, 1000000000}, ts_example_01},
    {{192279220, 156648746}, ts_random_00},
    {{264704197, 120999146}, ts_random_01},
    {{682152023, 451794314}, ts_random_02},
    {{627477696, 504915182}, ts_random_03},
    {{729561619, 415335212}, ts_random_04},
    {{173330281, 220603612}, ts_random_05},
    {{841413509, 58432763}, ts_random_06},
    {{251229786, 256388306}, ts_random_07},
    {{118232767, 222490630}, ts_random_08},
    {{907649120, 290651129}, ts_random_09}};

inline void post_test([[maybe_unused]] ptt<u32> const &p = {0, 0}) {
#ifndef LOCAL_
  static ptt<u32> p_{0, 0};
  if (p.first || p.second) {
    p_ = p;
    return;
  }
  std::cout << p_.first + p_.second << '\n';
  exit(0);
#endif
}

inline TESTCASE pre_test() {
#ifndef LOCAL_
  ptt<u32> p;
  std::cin >> p.first >> p.second;
  post_test(p);
  return testcase_id.at(p);
#else
  return ts_local;
#endif
}

#define check(got, want, ...) ::tifa_libs::unittest::detail__::check_(__PRETTY_FUNCTION__, #got, got, #want, want __VA_OPT__(, ) __VA_ARGS__)
#define check_bool(expression, ...) ::tifa_libs::unittest::detail__::check_bool_(__PRETTY_FUNCTION__, #expression, expression __VA_OPT__(, ) __VA_ARGS__)
#define check_param(x) \
  std::pair<std::string, decltype(x)> { #x " = ", x }

}  // namespace tifa_libs::unittest


#line 12 "src/test_cpverifier/unit-test/nt/lsieve2.loj6680.ss.test.cpp"

using mint = tifa_libs::math::mint_ss<998244353>;

void test(strn const& data) {
  strn path = "src/data/loj/6680/" + data;
  std::ifstream fin(path + ".in"), fans(path + ".out");

  u32 n;
  fin >> n;
  tifa_libs::math::lsieve2 ls(n);
  ptt<mint> lst;
  vecpt<mint> g = ls.run([&](u32 p, u32 e) {
    if (e == 1) return lst = ptt<mint>(p + (p ^ 1), 1 + (p ^ 1));
    else return lst = ptt<mint>((lst.first * p + (p ^ e)), (lst.second + (p ^ e)));
  },
                         ptt<mint>{1, 1});

  vec<mint> f(n + 1);
  f[1] = 1;
  for (u32 i = 2; i <= n; ++i) f[i] = f[i - 1] + g[i].first + g[i].first - g[i].second;
  u64 got = f[1].val();
  for (u32 i = 2; i <= n; ++i) got ^= f[i].val();

  u64 want;
  fans >> want;
  check(got, want, check_param(data));
}

int main() {
  auto tcase = tifa_libs::unittest::pre_test();

  switch (tcase) {
    case tifa_libs::unittest::ts_example_00:
      test("1");
      test("2");
      break;
    case tifa_libs::unittest::ts_example_01:
      test("3");
      test("4");
      break;
    case tifa_libs::unittest::ts_random_00:
      test("5");
      test("6");
      break;
    case tifa_libs::unittest::ts_random_01:
      test("7");
      test("8");
      break;
    case tifa_libs::unittest::ts_random_02:
      test("9");
      test("10");
      break;
    case tifa_libs::unittest::ts_random_03:
      test("11");
      test("12");
      break;
    case tifa_libs::unittest::ts_random_04:
      test("13");
      test("14");
      break;
    case tifa_libs::unittest::ts_random_05:
      test("15");
      test("16");
      break;
    case tifa_libs::unittest::ts_random_06: test("17"); break;
    case tifa_libs::unittest::ts_random_07: test("18"); break;
    case tifa_libs::unittest::ts_random_08: test("19"); break;
    case tifa_libs::unittest::ts_random_09: test("20"); break;
    default: break;
  }

  tifa_libs::unittest::post_test();
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 10 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 12 ms 4 MB
g++-12 random_00 :heavy_check_mark: AC 12 ms 4 MB
g++-12 random_01 :heavy_check_mark: AC 40 ms 21 MB
g++-12 random_02 :heavy_check_mark: AC 38 ms 19 MB
g++-12 random_03 :heavy_check_mark: AC 299 ms 165 MB
g++-12 random_04 :heavy_check_mark: AC 292 ms 170 MB
g++-12 random_05 :heavy_check_mark: AC 291 ms 173 MB
g++-12 random_06 :heavy_check_mark: AC 159 ms 160 MB
g++-12 random_07 :heavy_check_mark: AC 170 ms 155 MB
g++-12 random_08 :heavy_check_mark: AC 164 ms 146 MB
g++-12 random_09 :heavy_check_mark: AC 175 ms 130 MB
Back to top page