結果
問題 | No.2907 Business Revealing Dora Tiles |
ユーザー |
![]() |
提出日時 | 2024-09-30 20:51:51 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 166 ms / 3,000 ms |
コード長 | 24,274 bytes |
コンパイル時間 | 7,519 ms |
コンパイル使用メモリ | 358,988 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-09-30 20:52:06 |
合計ジャッジ時間 | 12,520 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 57 |
ソースコード
#line 1 "main.cpp"#define PROBLEM "https://yukicoder.me/problems/no/2907"#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else// https://codeforces.com/blog/entry/96344#pragma GCC optimize("Ofast,unroll-loops")// いまの CF だとこれ入れると動かない?// #pragma GCC target("avx2,popcnt")#include <bits/stdc++.h>using namespace std;using ll = long long;using u8 = uint8_t;using u16 = uint16_t;using u32 = uint32_t;using u64 = uint64_t;using i128 = __int128;using u128 = unsigned __int128;using f128 = __float128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'010'000'000;template <>constexpr ll infty<ll> = 2'020'000'000'000'000'000;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * 2'000'000'000'000'000'000;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }int popcnt_mod_2(int x) { return __builtin_parity(x); }int popcnt_mod_2(u32 x) { return __builtin_parity(x); }int popcnt_mod_2(ll x) { return __builtin_parityll(x); }int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sm = 0;for (auto &&a: A) sm += a;return sm;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;(check(x) ? ok : ng) = x;}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;(check(x) ? ok : ng) = x;}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids), [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}template <typename T, typename... Vectors>void concat(vc<T> &first, const Vectors &... others) {vc<T> &res = first;(res.insert(res.end(), others.begin(), others.end()), ...);}#endif#line 1 "/home/maspy/compro/library/other/io.hpp"#define FASTIO#include <unistd.h>// https://judge.yosupo.jp/submission/21623namespace fastio {static constexpr uint32_t SZ = 1 << 17;char ibuf[SZ];char obuf[SZ];char out[100];// pointer of ibuf, obufuint32_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, SZ - pir + pil, stdin);pil = 0;if (pir < SZ) ibuf[pir++] = '\n';}inline void flush() {fwrite(obuf, 1, por, stdout);por = 0;}void rd(char &c) {do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));}void rd(string &x) {x.clear();char c;do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));do {x += c;if (pil == pir) load();c = ibuf[pil++];} while (!isspace(c));}template <typename T>void rd_real(T &x) {string s;rd(s);x = stod(s);}template <typename T>void rd_integer(T &x) {if (pil + 100 > pir) load();char c;doc = ibuf[pil++];while (c < '-');bool minus = 0;if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (c == '-') { minus = 1, c = ibuf[pil++]; }}x = 0;while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (minus) x = -x;}}void rd(int &x) { rd_integer(x); }void rd(ll &x) { rd_integer(x); }void rd(i128 &x) { rd_integer(x); }void rd(u32 &x) { rd_integer(x); }void rd(u64 &x) { rd_integer(x); }void rd(u128 &x) { rd_integer(x); }void rd(double &x) { rd_real(x); }void rd(long double &x) { rd_real(x); }void rd(f128 &x) { rd_real(x); }template <class T, class U>void rd(pair<T, U> &p) {return rd(p.first), rd(p.second);}template <size_t N = 0, typename T>void rd_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);rd(x);rd_tuple<N + 1>(t);}}template <class... T>void rd(tuple<T...> &tpl) {rd_tuple(tpl);}template <size_t N = 0, typename T>void rd(array<T, N> &x) {for (auto &d: x) rd(d);}template <class T>void rd(vc<T> &x) {for (auto &d: x) rd(d);}void read() {}template <class H, class... T>void read(H &h, T &... t) {rd(h), read(t...);}void wt(const char c) {if (por == SZ) flush();obuf[por++] = c;}void wt(const string s) {for (char c: s) wt(c);}void wt(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) wt(s[i]);}template <typename T>void wt_integer(T x) {if (por > SZ - 100) flush();if (x < 0) { obuf[por++] = '-', x = -x; }int outi;for (outi = 96; x >= 10000; outi -= 4) {memcpy(out + outi, pre.num[x % 10000], 4);x /= 10000;}if (x >= 1000) {memcpy(obuf + por, pre.num[x], 4);por += 4;} else if (x >= 100) {memcpy(obuf + por, pre.num[x] + 1, 3);por += 3;} else if (x >= 10) {int q = (x * 103) >> 10;obuf[por] = q | '0';obuf[por + 1] = (x - q * 10) | '0';por += 2;} elseobuf[por++] = x | '0';memcpy(obuf + por, out + outi + 4, 96 - outi);por += 96 - outi;}template <typename T>void wt_real(T x) {ostringstream oss;oss << fixed << setprecision(15) << double(x);string s = oss.str();wt(s);}void wt(int x) { wt_integer(x); }void wt(ll x) { wt_integer(x); }void wt(i128 x) { wt_integer(x); }void wt(u32 x) { wt_integer(x); }void wt(u64 x) { wt_integer(x); }void wt(u128 x) { wt_integer(x); }void wt(double x) { wt_real(x); }void wt(long double x) { wt_real(x); }void wt(f128 x) { wt_real(x); }template <class T, class U>void wt(const pair<T, U> val) {wt(val.first);wt(' ');wt(val.second);}template <size_t N = 0, typename T>void wt_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { wt(' '); }const auto x = std::get<N>(t);wt(x);wt_tuple<N + 1>(t);}}template <class... T>void wt(tuple<T...> tpl) {wt_tuple(tpl);}template <class T, size_t S>void wt(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}template <class T>void wt(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}void print() { wt('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {wt(head);if (sizeof...(Tail)) wt(' ');print(forward<Tail>(tail)...);}// gcc expansion. called automaticall after main.void __attribute__((destructor)) _d() { flush(); }} // namespace fastiousing fastio::read;using fastio::print;using fastio::flush;#if defined(LOCAL)#define SHOW(...) SHOW_IMPL(__VA_ARGS__, SHOW6, SHOW5, SHOW4, SHOW3, SHOW2, SHOW1)(__VA_ARGS__)#define SHOW_IMPL(_1, _2, _3, _4, _5, _6, NAME, ...) NAME#define SHOW1(x) print(#x, "=", (x)), flush()#define SHOW2(x, y) print(#x, "=", (x), #y, "=", (y)), flush()#define SHOW3(x, y, z) print(#x, "=", (x), #y, "=", (y), #z, "=", (z)), flush()#define SHOW4(x, y, z, w) print(#x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w)), flush()#define SHOW5(x, y, z, w, v) print(#x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w), #v, "=", (v)), flush()#define SHOW6(x, y, z, w, v, u) print(#x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w), #v, "=", (v), #u, "=", (u)), flush()#else#define SHOW(...)#endif#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define U32(...) \u32 __VA_ARGS__; \read(__VA_ARGS__)#define U64(...) \u64 __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 4 "main.cpp"#line 2 "/home/maspy/compro/library/mod/modint_common.hpp"struct has_mod_impl {template <class T>static auto check(T &&x) -> decltype(x.get_mod(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_mod : public decltype(has_mod_impl::check<T>(std::declval<T>())) {};template <typename mint>mint inv(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {0, 1};assert(0 <= n);if (n >= mod) n %= mod;while (len(dat) <= n) {int k = len(dat);int q = (mod + k - 1) / k;dat.eb(dat[k * q - mod] * mint::raw(q));}return dat[n];}template <typename mint>mint fact(int n) {static const int mod = mint::get_mod();assert(0 <= n && n < mod);static vector<mint> dat = {1, 1};while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * mint::raw(len(dat)));return dat[n];}template <typename mint>mint fact_inv(int n) {static vector<mint> dat = {1, 1};if (n < 0) return mint(0);while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * inv<mint>(len(dat)));return dat[n];}template <class mint, class... Ts>mint fact_invs(Ts... xs) {return (mint(1) * ... * fact_inv<mint>(xs));}template <typename mint, class Head, class... Tail>mint multinomial(Head &&head, Tail &&... tail) {return fact<mint>(head) * fact_invs<mint>(std::forward<Tail>(tail)...);}template <typename mint>mint C_dense(int n, int k) {static vvc<mint> C;static int H = 0, W = 0;auto 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(i, H) {C[i].resize(k + 1);FOR(j, W, k + 1) { C[i][j] = calc(i, j); }}W = k + 1;}if (H <= n) {C.resize(n + 1);FOR(i, H, n + 1) {C[i].resize(W);FOR(j, W) { C[i][j] = calc(i, j); }}H = n + 1;}return C[n][k];}template <typename mint, bool large = false, bool dense = false>mint C(ll n, ll k) {assert(n >= 0);if (k < 0 || n < k) return 0;if constexpr (dense) return C_dense<mint>(n, k);if constexpr (!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 && k <= n);if (!large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);return mint(1) / C<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 C<mint, large, dense>(n + d - 1, d);}#line 3 "/home/maspy/compro/library/mod/modint.hpp"template <int mod>struct modint {static constexpr u32 umod = u32(mod);static_assert(umod < u32(1) << 31);u32 val;static modint raw(u32 v) {modint x;x.val = v;return x;}constexpr modint() : val(0) {}constexpr modint(u32 x) : val(x % umod) {}constexpr modint(u64 x) : val(x % umod) {}constexpr modint(u128 x) : val(x % umod) {}constexpr modint(int x) : val((x %= mod) < 0 ? x + mod : x){};constexpr modint(ll x) : val((x %= mod) < 0 ? x + mod : x){};constexpr modint(i128 x) : val((x %= mod) < 0 ? x + mod : x){};bool operator<(const modint &other) const { return val < other.val; }modint &operator+=(const modint &p) {if ((val += p.val) >= umod) val -= umod;return *this;}modint &operator-=(const modint &p) {if ((val += umod - p.val) >= umod) val -= umod;return *this;}modint &operator*=(const modint &p) {val = u64(val) * p.val % umod;return *this;}modint &operator/=(const modint &p) {*this *= p.inverse();return *this;}modint operator-() const { return modint::raw(val ? mod - val : u32(0)); }modint operator+(const modint &p) const { return modint(*this) += p; }modint operator-(const modint &p) const { return modint(*this) -= p; }modint operator*(const modint &p) const { return modint(*this) *= p; }modint operator/(const modint &p) const { return modint(*this) /= p; }bool operator==(const modint &p) const { return val == p.val; }bool operator!=(const modint &p) const { return val != p.val; }modint inverse() const {int a = val, b = mod, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b), swap(u -= t * v, v);}return modint(u);}modint pow(ll n) const {assert(n >= 0);modint ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}static constexpr int get_mod() { return mod; }// (n, r), r は 1 の 2^n 乗根static constexpr pair<int, int> ntt_info() {if (mod == 120586241) return {20, 74066978};if (mod == 167772161) return {25, 17};if (mod == 469762049) return {26, 30};if (mod == 754974721) return {24, 362};if (mod == 880803841) return {23, 211};if (mod == 943718401) return {22, 663003469};if (mod == 998244353) return {23, 31};if (mod == 1004535809) return {21, 836905998};if (mod == 1045430273) return {20, 363};if (mod == 1051721729) return {20, 330};if (mod == 1053818881) return {20, 2789};return {-1, -1};}static constexpr bool can_ntt() { return ntt_info().fi != -1; }};#ifdef FASTIOtemplate <int mod>void rd(modint<mod> &x) {fastio::rd(x.val);x.val %= mod;// assert(0 <= x.val && x.val < mod);}template <int mod>void wt(modint<mod> x) {fastio::wt(x.val);}#endifusing modint107 = modint<1000000007>;using modint998 = modint<998244353>;#line 1 "/home/maspy/compro/library/nt/nim_product.hpp"namespace NIM_PRODUCT {u16 E[65535 * 2 + 7];u16 L[65536];void __attribute__((constructor)) init_nim_table() {// 2^16 未満のところについて原始根 10279 での指数対数表を作る// 2^k との積u16 tmp[] = {10279, 15417, 35722, 52687, 44124, 62628, 15661, 5686, 3862, 1323, 334, 647, 61560, 20636, 4267, 8445};u16 nxt[65536];FOR(i, 16) {FOR(s, 1 << i) { nxt[s | 1 << i] = nxt[s] ^ tmp[i]; }}E[0] = 1;FOR(i, 65534) E[i + 1] = nxt[E[i]];memcpy(E + 65535, E, 131070);memcpy(E + 131070, E, 14);FOR(i, 65535) L[E[i]] = i;}u16 p16(u16 a, u16 b) { return (a && b ? E[u32(L[a]) + L[b]] : 0); }u16 p16_15(u16 a, u16 b) { return (a && b ? E[u32(L[a]) + L[b] + 3] : 0); }u16 p16_15_15(u16 a, u16 b) { return (a && b ? E[u32(L[a]) + L[b] + 6] : 0); }u16 mul_15(u16 a) { return (a ? E[3 + L[a]] : 0); }u32 p32(u32 a, u32 b) {u16 al = a & 65535, ah = a >> 16, bl = b & 65535, bh = b >> 16;u16 c = p16(al, bl);return u32(p16(al ^ ah, bl ^ bh) ^ c) << 16 | (p16_15(ah, bh) ^ c);}u32 p32_mul_31(u32 a, u32 b) {u16 al = a & 65535, ah = a >> 16, bl = b & 65535, bh = b >> 16;u16 x = p16_15(al, bl);u16 y = p16_15_15(ah, bh);u16 z = p16_15(al ^ ah, bl ^ bh);return u32(y ^ z) << 16 | mul_15(z ^ x);}u64 p64(u64 a, u64 b) {u32 al = a & 0xffffffff, ah = a >> 32, bl = b & 0xffffffff, bh = b >> 32;u32 c = p32(al, bl);return u64(p32(al ^ ah, bl ^ bh) ^ c) << 32 ^ (p32_mul_31(ah, bh) ^ c);}} // namespace NIM_PRODUCTu64 nim_product(u64 a, u64 b) { return NIM_PRODUCT::p64(a, b); }#line 2 "/home/maspy/compro/library/nt/nimber.hpp"struct Nimber64 {using F = Nimber64;u64 val;constexpr Nimber64(u64 x = 0) : val(x) {}F &operator+=(const F &p) {val ^= p.val;return *this;}F &operator-=(const F &p) {val ^= p.val;return *this;}F &operator*=(const F &p) {val = NIM_PRODUCT::p64(val, p.val);return *this;}F &operator/=(const F &p) {*this *= p.inverse();return *this;}F operator-() const { return *this; }F operator+(const F &p) const { return F(*this) += p; }F operator-(const F &p) const { return F(*this) -= p; }F operator*(const F &p) const { return F(*this) *= p; }F operator/(const F &p) const { return F(*this) /= p; }bool operator==(const F &p) const { return val == p.val; }bool operator!=(const F &p) const { return val != p.val; }F inverse() const { return pow(u64(-2)); }F pow(u64 n) const {assert(n >= 0);u64 ret = 1, mul = val;while (n > 0) {if (n & 1) ret = NIM_PRODUCT::p64(ret, mul);mul = NIM_PRODUCT::p64(mul, mul);n >>= 1;}return F(ret);}};#line 7 "main.cpp"// return: 2^M integerstemplate <typename T>vc<int> rank_for_all_column_subset(vvc<T> A, int N, int M) {assert(len(A) == N);FOR(i, N) assert(len(A[i]) == M);int rk = 0;FOR(j, M) {if (rk == N) break;FOR(i, rk, N) if (A[i][j] != 0) {swap(A[rk], A[i]);break;}if (A[rk][j] == 0) continue;T c = T(1) / A[rk][j];for (auto&& x: A[rk]) x *= c;FOR(i, N) if (i != rk) {T c = A[i][j];FOR(k, j, M) { A[i][k] -= A[rk][k] * c; }}++rk;}A.resize(rk);/*ある行(M,M) matrix の対角に置く1**00*0*000000000000000000010*0*00001*0*000000000000001*00000000先頭列から順に処理する.*/N = M;vv(T, work, N, N);vvv(T, memo, N, N, N);for (auto& X: A) {int p = 0;FOR_R(i, N) if (X[i] != 0) p = i;work[p] = X;}vc<int> ANS(1 << M);auto dfs = [&](auto& dfs, int s, int k, int r) -> void {if (k == N) {ANS[s] = r;return;}if (work[k][k] == T(0)) {// 使うにしても使わないにしても rank には影響しないdfs(dfs, s, k + 1, r);dfs(dfs, s | 1 << k, k + 1, r);return;}assert(work[k][k] == T(1));// 使う場合 : そのまま submatrix について解くdfs(dfs, s | 1 << k, k + 1, r + 1);// 使わない場合int p = -1;FOR(i, k + 1, N) {if (work[k][i] != T(0)) {p = i;break;}}if (p == -1) { return dfs(dfs, s, k + 1, r); }// snapshotFOR(i, k + 1, N) FOR(j, k + 1, N) memo[k][i][j] = work[i][j];T c = T(1) / work[k][p];FOR(j, p, N) work[p][j] = work[k][j] * c;FOR(i, k + 1, p) {T c = work[i][p];FOR(j, p, N) work[i][j] -= c * work[p][j];}dfs(dfs, s, k + 1, r);// rollbackFOR(i, k + 1, N) FOR(j, k + 1, N) work[i][j] = memo[k][i][j];};dfs(dfs, 0, 0, 0);return ANS;}using F = Nimber64;using mint = modint998;void solve() {LL(W, H);vv(F, A, H, W, F(0));FOR(x, H) FOR(y, W) {U64(w);A[x][y] = F(w - 1);}// vc<int> R = rank_for_all_column_subset(A, H, W);vc<int> R = rank_for_all_column_subset(A, H, W);ll N = W;mint ANS = 0;vc<mint> POW(N + 1);FOR(n, N + 1) POW[n] = mint(2).pow(64 * n);FOR(s, 1 << N) {ll r = R[s];ll n = popcnt(s) - r;mint x = POW[n];if ((N - popcnt(s)) % 2 == 0) {ANS += x;} else {ANS -= x;}}print(ANS);}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}