#1149110 (C++23) No.147 試験監督（2）

提出ソース

結果

問題	No.147 試験監督（2）
コンテスト
ユーザー	zeta
提出日時	2026-02-23 06:30:16
言語	C++23 (gcc 15.2.0 + boost 1.89.0) コンパイル: `g++-15 -O2 -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_` 実行: `./a.out`
結果	WA
実行時間	-
コード長	20,012 bytes
記録記録タグの例: 初AC ショートコード純ショートコード純主流ショートコード最速実行時間
コンパイル時間	2,742 ms
コンパイル使用メモリ	274,484 KB
実行使用メモリ	7,844 KB
最終ジャッジ日時	2026-02-23 11:39:53
合計ジャッジ時間	6,354 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

ファイルパターン	結果
other	WA * 4

権限があれば一括ダウンロードができます

コンパイルメッセージ

In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/deque:67,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/queue:68,
                 from YRS/aa/head.hpp:10:
In function '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = mint_t<1000000007>*; _ForwardIterator = mint_t<1000000007>*]',
    inlined from 'constexpr _ForwardIterator std::__uninitialized_copy_a(_InputIterator, _Sentinel, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = mint_t<1000000007>*; _Sentinel = mint_t<1000000007>*; _ForwardIterator = mint_t<1000000007>*; _Tp = mint_t<1000000007>]' at /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_uninitialized.h:635:32,
    inlined from 'constexpr std::vector<_Tp, _Alloc>& std::vector< <template-parameter-1-1>, <template-parameter-1-2> >::operator=(const std::vector< <template-parameter-1-1>, <template-parameter-1-2> >&) [with _Tp = mint_t<1000000007>; _Alloc = std::allocator<mint_t<1000000007> >]' at /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/vector.tcc:257:35,
    inlined from 'constexpr retsu<mint_t<1000000007> >& retsu<mint_t<1000000007> >::operator=(const retsu<mint_t<1000000007> >&)' at YRS/ds/basic/retsu.hpp:3:11,
    inlined from 'constexpr mat<mint_t<1000000007> >& mat<mint_t<1000000007> >::operator=(const mat<mint_t<1000000007> >&)' at YRS/line/mat.hpp:9:11,
    inlined from 'mat<T>::mt& mat<T>::operator*=(const mt&) [with T = mint_t<1000000007>]' at YRS/line/mat.hpp:25:18,
    inlined from 'mat<T>::mt mat<T>::pow(ll) const [with T = mint_t<1000000007>]' at YRS/line/mat.hpp:72:26,
    inlined from 'void Yorisou()' at No_147_試験監督_2.cpp:25:14:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_uninitialized.h:273:31: warning: 'void* __builtin_memcpy(void*, const void*, long unsigned int)' writing 12 bytes into a region of size 0 overflows th

ソースコード

raw source code

#line 1 "No_147_\u8a66\u9a13\u76e3\u7763_2.cpp"
#define YRSD
#line 2 "YRS/all.hpp"

#line 2 "YRS/aa/head.hpp"

#include <iostream>
#include <algorithm>

#include <array>
#include <bitset>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>

#include <bit>
#include <chrono>
#include <functional>
#include <iomanip>
#include <utility>
#include <type_traits>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <limits>
#include <ranges>
#include <concepts>

#define TE template <typename T>
#define TES template <typename T, typename ...S>
#define Z auto
#define ep emplace_back
#define eb emplace
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()

#define OV4(a, b, c, d, e, ...) e
#define FOR1(a) for (int _ = 0; _ < (a); ++_)
#define FOR2(i, a) for (int i = 0; i < (a); ++i)
#define FOR3(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (int i = (a); i < (b); i += (c))
#define FOR(...) OV4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR1_R(a) for (int _ = (a) - 1; _ >= 0; --_)
#define FOR2_R(i, a) for (int i = (a) - 1; i >= 0; --i)
#define FOR3_R(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define FOR4_R(i, a, b, c) for (int i = (b) - 1; i >= (a); i -= (c))
#define FOR_R(...) OV4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (int t = (s); t > -1; t = (t == 0 ? -1 : (t - 1) & s))

#define sort ranges::sort

using namespace std;

TE using vc = vector<T>;
TE using vvc = vc<vc<T>>;
TE using T1 = tuple<T>;
TE using T2 = tuple<T, T>;
TE using T3 = tuple<T, T, T>;
TE using T4 = tuple<T, T, T, T>;
TE using max_heap = priority_queue<T>;
TE using min_heap = priority_queue<T, vc<T>, greater<T>>;
using u8 = unsigned char; using uint = unsigned int; using ll = long long;      using ull = unsigned long long;
using ld = long double;   using i128 = __int128;     using u128 = __uint128_t;  using f128 = __float128;
using u16 = uint16_t;
using PII = pair<int, int>;   using PLL = pair<ll, ll>;

#ifdef YRSD
constexpr bool dbg = 1;
#else
constexpr bool dbg = 0;
#endif
#line 2 "YRS/IO/IO.hpp"

istream &operator>>(istream &I, i128 &x) {
  static string s;
  I >> s;
  int f = s[0] == '-';
  x = 0;
  const int N = (int)s.size();
  FOR(i, f, N) x = x * 10 + s[i] - '0';
  if (f) x = -x;
  return I;
}
ostream &operator<<(ostream &O, i128 x) {
  static string s;
  s.clear();
  bool f = x < 0;
  if (f) x = -x;
  while (x) s += '0' + x % 10, x /= 10;
  if (s.empty()) s += '0';
  if (f) s += '-';
  reverse(all(s));
  return O << s;
}
istream &operator>>(istream &I, f128 &x) {
  static string s;
  I >> s, x = stold(s);
  return I;
}
ostream &operator<<(ostream &O, const f128 x) { return O << ld(x); }
template <typename... S>
istream &operator>>(istream &I, tuple<S...> &t) {
  return apply([&I](Z &...s) { ((I >> s), ...); }, t), I;
}
template <typename T, typename U>
istream &operator>>(istream &I, pair<T, U> &x) {
  return I >> x.fi >> x.se;
}
template <typename T, typename U>
ostream &operator<<(ostream &O, const pair<T, U> &x) {
  return O << x.fi << ' ' << x.se;
}
TE requires requires(T &c) { begin(c); end(c); } and 
                          (not is_same_v<decay_t<T>, string>)
istream &operator>>(istream &I, T &c) {
  for (Z &e : c) I >> e;
  return I;
}
TE requires requires(const T &c) { begin(c); end(c); } and 
  (not is_same_v<decay_t<T>, const char*>) and 
  (not is_same_v<decay_t<T>, string>) and 
  (not is_array_v<remove_reference_t<T>> or 
   not is_same_v<remove_extent_t<remove_reference_t<T>>, char>)
ostream &operator<<(ostream &O, const T &a) {
  if (a.empty()) return O;
  Z i = a.begin();
  O << *i++;
  for (; i != a.end(); ++i) O << ' ' << *i;
  return O;
}
void IN() {}
TE void IN(T &x, Z &...s) { cin >> x, IN(s...); }
void print() { cout << '\n'; }
TES void print(T &&x, S &&...y) {
  cout << x;
  if constexpr (sizeof...(S)) cout << ' ';
  print(forward<S>(y)...);
}
void put() { cout << ' '; }
TES void put(T &&x, S &&...y) {
  cout << x;
  if constexpr (sizeof...(S)) cout << ' ';
  put(forward<S>(y)...);
}

#define INT(...)  int    __VA_ARGS__; IN(__VA_ARGS__)
#define UINT(...) uint   __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...)   ll     __VA_ARGS__; IN(__VA_ARGS__)
#define ULL(...)  ull    __VA_ARGS__; IN(__VA_ARGS__)
#define I128(...) i128   __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...)  string __VA_ARGS__; IN(__VA_ARGS__)
#define CH(...)   char   __VA_ARGS__; IN(__VA_ARGS__)
#define REAL(...) re     __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(T, a, n) vc<T> a(n); IN(a)

void YES(bool o = 1) { print(o ? "YES" : "NO"); }
void Yes(bool o = 1) { print(o ? "Yes" : "No"); }
void yes(bool o = 1) { print(o ? "yes" : "no"); }
void NO(bool o = 1) { YES(not o); }
void No(bool o = 1) { Yes(not o); }
void no(bool o = 1) { yes(not o); }
void ALICE(bool o = 1) { print(o ? "ALICE" : "BOB"); }
void Alice(bool o = 1) { print(o ? "Alice" : "Bob"); }
void alice(bool o = 1) { print(o ? "alice" : "bob"); }
void BOB(bool o = 1) { ALICE(not o); }
void Bob(bool o = 1) { Alice(not o); }
void bob(bool o = 1) { alice(not o); }
void POSSIBLE(bool o = 1) { print(o ? "POSSIBLE" : "IMPOSSIBLE"); }
void Possible(bool o = 1) { print(o ? "Possible" : "Impossible"); }
void possible(bool o = 1) { print(o ? "possible" : "impossible"); }
void IMPOSSIBLE(bool o = 1) { POSSIBLE(not o); }
void Impossible(bool o = 1) { Possible(not o); }
void impossible(bool o = 1) { possible(not o); }
void TAK(bool o = 1) { print(o ? "TAK" : "NIE"); }
void NIE(bool o = 1) { TAK(not o); }
#line 5 "YRS/all.hpp"

#if (__cplusplus >= 202002L)
#include <numbers>
constexpr ld pi = numbers::pi;
#endif
TE constexpr T inf = numeric_limits<T>::max();
template <> constexpr i128 inf<i128> = i128(inf<ll>) * 2'000'000'000'000'000'000;
template <typename T, typename U>
constexpr pair<T, U> inf<pair<T, U>> = {inf<T>, inf<U>};

TE constexpr static inline int pc(T x) { return popcount(make_unsigned_t<T>(x)); }
constexpr static inline ll len(const Z &a) { return a.size(); }

void reverse(Z &a) { reverse(all(a)); }

void unique(Z &a) {
  sort(a);
  a.erase(unique(all(a)), a.end());
}
TE vc<int> inverse(const vc<T> &a) {
  int N = len(a);
  vc<int> b(N, -1);
  FOR(i, N) if (a[i] != -1) b[a[i]] = i;
  return b;
}

Z QMAX(const Z &a) { return *max_element(all(a)); }
Z QMIN(const Z &a) { return *min_element(all(a)); }
TE Z QMAX(T l, T r) { return *max_element(l, r); }
TE Z QMIN(T l, T r) { return *min_element(l, r); }
constexpr bool chmax(Z &a, const Z &b) { return (a < b ? a = b, 1 : 0); }
constexpr bool chmin(Z &a, const Z &b) { return (a > b ? a = b, 1 : 0); }

vc<int> argsort(const Z &a) {
  vc<int> I(len(a));
  iota(all(I), 0);
  sort(I, [&](int i, int k) { return a[i] < a[k] or (a[i] == a[k] and i < k); });
  return I;
}
TE vc<T> rearrange(const vc<T> &a, const vc<int> &I) {
  int N = len(I);
  vc<T> b(N);
  FOR(i, N) b[i] = a[I[i]];
  return b;
}
template <int of = 1, typename T> 
vc<T> pre_sum(const vc<T> &a) {
  int N = len(a);
  vc<T> c(N + 1);
  FOR(i, N) c[i + 1] = c[i] + a[i];
  if (of == 0) c.erase(c.begin());
  return c;
}

TE constexpr static int topbit(T x) {
  if (x == 0) return - 1;
  if constexpr (sizeof(T) <= 4) return 31 - __builtin_clz(x);
  else return 63 - __builtin_clzll(x);
}
TE constexpr static int lowbit(T x) {
  if (x == 0) return -1;
  if constexpr (sizeof(T) <= 4) return __builtin_ctz(x);
  else return __builtin_ctzll(x);
}

TE constexpr T floor(T x, T y) { return x / y - (x % y and (x ^ y) < 0); }
TE constexpr T ceil(T x, T y) { return floor(x + y - 1, y); }
TE constexpr T bmod(T x, T y) { return x - floor(x, y) * y; }
TE constexpr pair<T, T> divmod(T x, T y) {
  T q = floor(x, y);
  return pair{q, x - q * y};
}
template <typename T = ll>
T SUM(const Z &v) {
  return accumulate(all(v), T(0));
}
int lb(const Z &a, Z x) { return lower_bound(all(a), x) - a.begin(); }
TE int lb(T l, T r, Z x) { return lower_bound(l, r, x) - l; }
int ub(const Z &a, Z x) { return upper_bound(all(a), x) - a.begin(); }
TE int ub(T l, T r, Z x) { return upper_bound(l, r, x) - l; }

template <bool ck = 1>
ll bina(Z f, ll l, ll r) {
  if constexpr (ck) assert(f(l));
  while (abs(l - r) > 1) {
    ll x = (r + l) >> 1;
    (f(x) ? l : r) = x;
  }
  return l;
}
TE T bina_real(Z f, T l, T r, int c = 100) {
  while (c--) {
    T x = (l + r) / 2;
    (f(x) ? l : r) = x;
  }
  return (l + r) / 2;
}

Z pop(Z &s) {
  if constexpr (requires { s.pop_back(); }) {
    Z x = s.back();
    return s.pop_back(), x;
  } else if constexpr (requires { s.top(); }) {
    Z x = s.top();
    return s.pop(), x;
  } else {
    Z x = s.front();
    return s.pop(), x;
  }
}
void setp(int x) { cout << fixed << setprecision(x); }

TE inline void sh(vc<T> &a, int N, T b = {}) {
  a.resize(N, b);
}
#line 1 "YRS/debug.hpp"
#ifdef YRSD
void DBG() { cerr << "]" << endl; }
TES void DBG(T &&x, S &&...y) {
  cerr << x;
  if constexpr (sizeof...(S)) cerr << ", ";
  DBG(forward<S>(y)...);
}
#define debug(...) cerr << "[" << __LINE__ << "]: [" #__VA_ARGS__ "] = [", DBG(__VA_ARGS__)
void ERR() { cerr << endl; }
TES void ERR(T &&x, S &&...y) {
  cerr << x;
  if constexpr (sizeof...(S)) cerr << ", ";
  ERR(forward<S>(y)...);
}
#define err(...) cerr << "[" << __LINE__ << "]: ", ERR(__VA_ARGS__)
#define asser assert
#else
#define debug(...) void(0721)
#define err(...)   void(0721)
#define asser(...) void(0721)
#endif
#line 4 "No_147_\u8a66\u9a13\u76e3\u7763_2.cpp"
// #include "YRS/IO/fast_io.hpp"
// #include "YRS/random/rng.hpp"
// #include "YRS/ds/basic/retsu.hpp"
#line 2 "YRS/mod/mint.hpp"

#line 2 "YRS/mod/modint_common.hpp"

TE concept is_mint = requires(T x) {
  { T::get_mod() };
  { T::gen(0ull) } -> same_as<T>;
  x.val;
};
TE concept has_const_mod =
    requires { integral_constant<int, (int)T::get_mod()> {}; };

TE static vc<T> &invs() {
  static vc<T> a{0, 1};
  return a;
}
TE static vc<T> &fac() {
  static vc<T> a{1, 1};
  return a;
}
TE static vc<T> &ifac() {
  static vc<T> a{1, 1};
  return a;
}

TE static int Set_inv(int N) {
  static vc<T> &inv = invs<T>();
  if (len(inv) >= N) return N;
  inv.resize(N + 1);
  inv[0] = 1, inv[1] = 1;
  FOR(i, 1, N) inv[i + 1] = inv[i] * i;
  T t = pop(inv).inv();
  FOR_R(i, N) inv[i] *= t, t *= i;
  return N;
}
TE static int Set_comb(int N) {
  static vc<T> &fa = fac<T>(), &ifa = ifac<T>();
  if (len(fa) >= N) return N;
  fa.resize(N);
  ifa.resize(N);
  FOR(i, 1, N) fa[i] = fa[i - 1] * i;
  ifa[N - 1] = fa[N - 1].inv();
  FOR_R(i, N - 1) ifa[i] = ifa[i + 1] * (i + 1);
  return N;
}

template <typename mint>
mint inv(int n) {
  static const int mod = mint::get_mod();
  static vc<mint> &a = invs<mint>();
  assert(0 <= n);
  while (len(a) <= n) {
    int k = len(a);
    int q = (mod + k - 1) / k;
    int r = k * q - mod;
    a.ep(a[r] * mint(q));
  }
  return a[n];
}
template <typename mint>
mint fact(int n) {
  static const int mod = mint::get_mod();
  static vc<mint> &a = fac<mint>();
  assert(0 <= n);
  if (n >= mod) return 0;
  while (len(a) <= n) {
    int k = len(a);
    a.ep(a[k - 1] * mint(k));
  }
  return a[n];
}

template <typename mint>
mint fact_inv(int n) {
  static vc<mint> &a = ifac<mint>();
  if (n < 0) return mint(0);
  while (len(a) <= n)
    a.ep(a[len(a) - 1] * inv<mint>(len(a)));
  return a[n];
}

template <typename mint, typename... Ts>
mint fact_invs(Ts... xs) {
  return (mint(1) * ... * fact_inv<mint>(xs));
}

template <typename mint, typename X, typename... S>
mint multinomial(X&& a, S&&... b) {
  return fact<mint>(a) * fact_invs<mint>(forward<S>(b)...);
}

template <typename mint>
mint C_dense(int n, int k) {
  assert(n >= 0);
  if (k < 0 or n < k) return 0;
  static vc<vc<mint>> C;
  static int H = 0, W = 0;
  Z calc = [&](int i, int j) -> mint {
    if (i == 0) return(j == 0 ? mint(1) : mint(0));
    return C[i - 1][j] + (j ? C[i - 1][j - 1] : 0);
  };
  if (W <= k) {
    for (int i = 0; i < H; ++i) {
      C[i].resize(k + 1);
      for (int j = W; j < k + 1; ++j) {
        C[i][j] = calc(i, j);
      }
    }
    W = k + 1;
  }
  if (H <= n) {
    C.resize(n + 1);
    for (int i = H; i < n + 1; ++i) {
      C[i].resize(W);
      for (int j = 0; j < W; ++j) {
        C[i][j] = calc(i, j);
      }
    }
    H = n + 1;
  }
  return C[n][k];
}

template <typename mint>
mint C(int N, int K) {
  assert(N >= 0);
  if (K < 0 or N < K) return 0;
  return fact<mint>(N) * fact_inv<mint>(K) * fact_inv<mint>(N - K);
}

template <typename mint>
mint lucas(ll N, ll K) {
  static constexpr int P = mint::get_mod();
  if (K > N) return 0;
  if (K == 0) return 1;
  return C<mint>(N % P, K % P) * lucas<mint>(N / P, K / P);
}

template <typename mint, bool large = false, bool dense = false>
mint binom(ll n, ll k) {
  assert(n >= 0);
  if (k < 0 or n < k) return 0;
  if constexpr (dense) return C_dense<mint>(n, k);
  if constexpr (not large) return multinomial<mint>(n, k, n - k);
  k = min(k, n - k);
  mint x(1);
  FOR(i, k) x *= mint(n - i);
  return x * fact_inv<mint>(k);
}

template <typename mint, bool large = false>
mint C_inv(ll n, ll k) {
  assert(n >= 0);
  assert(0 <= k and k <= n);
  if (not large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);
  return mint(1) / binom<mint, 1>(n, k);
}

// [x^d](1-x)^{-n}
template <typename mint, bool large = false, bool dense = false>
mint C_negative(ll n, ll d) {
  assert(n >= 0);
  if (d < 0) return mint(0);
  if (n == 0) return (d == 0 ? mint(1) : mint(0));
  return binom<mint, large, dense>(n + d - 1, d);
}

#define CC C<mint>
#define fac fact<mint>
#define ifac fact_inv<mint>
#define set_comb Set_comb<mint>
#define set_inv Set_inv<mint>
#line 4 "YRS/mod/mint.hpp"

#define C constexpr
template <int mod>
struct mint_t {
  using mint = mint_t;
  static C uint m = mod;
  uint x;

  C uint val() const { return x; }

  C mint_t() : x(0) {}
  C mint_t(uint x) : x(x % m) {}
  C mint_t(ull x) : x(x % m) {}
  C mint_t(u128 x) : x(x % m) {}
  C mint_t(int x) : x((x %= mod) < 0 ? x + mod : x) {}
  C mint_t(ll x) : x((x %= mod) < 0 ? x + mod : x) {}
  C mint_t(i128 x) : x((x %= mod) < 0 ? x + mod : x) {}

  C mint &operator+=(mint p) {
    if ((x += p.x) >= m) x -= m;
    return *this;
  }
  C mint &operator-=(mint p) {
    if ((x += m - p.x) >= m) x -= m;
    return *this;
  }
  C mint operator+(mint p) const { return mint(*this) += p; }
  C mint operator-(mint p) const { return mint(*this) -= p; }

  C mint &operator*=(mint p) {
    x = ull(x) * p.x % m;
    return *this;
  }
  C mint operator*(mint p) const { return mint(*this) *= p; }

  C mint &operator/=(mint p) { return *this *= p.inv(); }
  C mint operator/(mint p) const { return mint(*this) /= p; }

  C mint operator-() const { return mint::gen(x ? mod - x : 0); }

  C mint inv() const {
    int a = x, b = mod, x = 1, y = 0;
    while (b > 0) {
      int t = a / b;
      swap(a -= t * b, b);
      swap(x -= t * y, y);
    }
    return mint(x);
  }

  C mint pow(ll k) const {
    if (k < 0) return inv().pow(-k);
    mint s(1), a(x);
    for (; k; k >>= 1, a *= a)
      if (k & 1) s *= a;
    return s;
  }

  C bool operator<(mint p) const { return x < p.x; }
  C bool operator==(mint p) const { return x == p.x; }
  C bool operator!=(mint p) const { return x != p.x; }

  static C mint gen(uint x) {
    mint s;
    s.x = x;
    return s;
  }

  friend istream &operator>>(istream &cin, mint &p) {
    ll t;
    cin >> t;
    p = t;
    return cin;
  }
  friend ostream &operator<<(ostream &cout, mint p) { return cout << p.x; }

  static C int get_mod() { return mod; }

  static C PII ntt_info() {
    if (mod == 167772161) return {25, 17};
    if (mod == 469762049) return {26, 30};
    if (mod == 754974721) return {24, 362};
    if (mod == 998244353) return {23, 31};
    if (mod == 120586241) return {20, 74066978};
    if (mod == 880803841) return {23, 211};
    if (mod == 943718401) return {22, 663003469};
    if (mod == 1004535809) return {21, 582313106};
    if (mod == 1012924417) return {21, 368093570};
    return {-1, -1};
  }
  
  static C bool can_ntt() { return ntt_info().fi != -1; }
};
#undef C

using M99 = mint_t<998244353>;
using M17 = mint_t<1000000007>;

#ifdef FIO
template <int mod>
void rd(mint_t<mod> &x) {
  LL(y);
  x = y;
}
template <int mod>
void wt(mint_t<mod> x) {
  wt(x.x);
}
#endif
#line 2 "YRS/line/mat.hpp"

#line 2 "YRS/ds/basic/retsu.hpp"

TE struct retsu {
  int N, M;
  vc<T> a;

  retsu(int N, int M, T bs = T()) : N(N), M(M), a(N * M, bs) {}

  T* operator[](int i) { return a.data() + i * M; }
  const T* operator[](int i) const { return a.data() + i * M; }

  void fill(T x) { std::fill(all(a), x); }

  T max() const { return QMAX(a); }

  T min() const { return QMIN(a); }

  vc<vc<T>> to_vector() const {
    vector res(N, vc<T>(M));
    FOR(i, N) FOR(k, M) res[i][k] = a[i * M + k];
    return res;
  }
};

TE istream &operator>>(istream &I, retsu<T> &a) {
  for (Z &e : a.a) I >> e;
  return I;
}
TE ostream &operator<<(ostream &O, retsu<T> &a) {
  FOR(i, a.N) FOR(k, a.M) O << a[i][k] << " \n"[k + 1 == a.M and i + 1 != a.N];
  return O;
}

#ifdef FIO
TE inline void rd(retsu<T> &a) {
  for (T &x : a.a) rd(x);
}
TE inline void wt(retsu<T> &a) {
  FOR(i, a.N) {
    FOR(k, a.M) {
      if (k) wt(' ');
      wt(a[i][k]);
    }
    if (i != a.M) wt('\n');
  }
}
#endif
#line 4 "YRS/line/mat.hpp"

// https://codeforces.com/contest/2065/problem/H  *
// https://www.luogu.com.cn/problem/P3390 pow
// https://www.luogu.com.cn/problem/P1939 pow

TE struct mat {
  using mt = mat;
  int N;
  retsu<T> a;
  
  mat(int N, T x = 0, T bs = 0) : N(N), a(N, N, bs) {
    if (x != bs) FOR(i, N) a[i][i] = x;
  }

  Z operator[](int i) { return a[i]; }
  Z operator[](int i) const { return a[i]; }

  mt &operator*=(const mt &b) {
    assert(N == b.N);
    mt c(N);
    FOR(i, N) FOR(j, N) FOR(k, N) c[i][j] += a[i][k] * b[k][j];
    return *this = c;
  }

  mt &operator+=(const mt &b) {
    assert(N == b.N);
    FOR(i, N) FOR(k, N) a[i][k] += b[i][k];
    return *this;
  }

  mt &operator-=(const mt &b) {
    assert(N == b.N);
    FOR(i, N) FOR(k, N) a[i][k] -= b[i][k];
    return *this;
  }
  
  mt operator*(const mt &b) const { return mt(*this) *= b; }
  mt operator+(const mt &b) const { return mt(*this) += b; }
  mt operator-(const mt &b) const { return mt(*this) -= b; }

  // ok, det, invm
  tuple<bool, T, mt> inv() const {
    T d = 1;
    vc<vc<T>> b(N, vc<T>(N)), a = this->a.to_vector();
    FOR(i, N) b[i][i] = 1;
    FOR(i, N) {
      FOR(k, i, N) if (a[k][i] != 0) {
        if (i != k) swap(a[i], a[k]), swap(b[i], b[k]), d = -d;
        break;
      }
      if (a[i][i] == 0) return {0, 0, mt(0)};
      T c = T(1) / a[i][i];
      d *= a[i][i];
      FOR(j, i, N) a[i][j] *= c;
      FOR(j, N) b[i][j] *= c;
      FOR(k, N) if (i != k) {
        T c = a[k][i];
        FOR(j, i, N) a[k][j] -= a[i][j] * c;
        FOR(j, N) b[k][j] -= b[i][j] * c;
      }
    }
    mt c(N);
    FOR(i, N) FOR(k, N) c[i][k] = b[i][k];
    return {1, d, c};
  }

  mt pow(ll k) const {
    mt s(N, 1), a(*this);
    for (; k; k >>= 1, a *= a) {
      if (k & 1) s *= a;
    }
    return s;
  }
};
#line 9 "No_147_\u8a66\u9a13\u76e3\u7763_2.cpp"

using mint = M17;
using M = mat<mint>;
void Yorisou() {
  INT(N);
  mint s = 1;
  FOR(N) {
    mint a;
    mint_t<mint::get_mod() - 1> b;
    STR(sa, sb);
    for (int x : sa) a = a * 10 + x - '0';
    for (int x : sb) b = b * 10 + x - '0';
    debug(a, b);
    M g(2);
    g[0][0] = 1, g[0][1] = 1;
    g[1][0] = 1;
    g = g.pow((a - 1).val());
    cerr << g.a << '\n';
    s *= (g[0][0] + g[0][1] + g[1][0] + g[1][1]).pow(b.val());
  }
  print(s);
}
constexpr int tests = 0, fl = 0, DB = 10;
#line 1 "YRS/aa/main.hpp"
int main() {
  cin.tie(nullptr)->sync_with_stdio(0);
  int T = 1;
  if (fl) cerr.tie(0);
  if (tests and not fl) IN(T);
  for (int i = 0; i < T or fl; ++i) {
    Yorisou();
    if (fl and i % DB == 0) cerr << "Case: " << i << '\n';
  }
  return 0;
}
#line 33 "No_147_\u8a66\u9a13\u76e3\u7763_2.cpp"

yukicoder

結果

コンパイルメッセージ

ソースコード