結果

問題 No.2907 Business Revealing Dora Tiles
ユーザー 👑 amentorimaru
提出日時 2024-09-16 13:47:04
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 133 ms / 3,000 ms
コード長 7,579 bytes
コンパイル時間 13,500 ms
コンパイル使用メモリ 251,140 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-09-23 12:57:59
合計ジャッジ時間 23,407 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define ATCODER
#define _USE_MATH_DEFINES
#include <bit>
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
#include <list>
#include <random>
#include <iterator>
#include <bitset>
#include <chrono>
#include <type_traits>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
//template<claLR T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, b) for(ll i=(a); i<(b);i++)
#define REP(i, n) for(ll i=0; i<(n);i++)
#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)
#define PER(i, n) for(ll i=n-1; i>=0;i--)
#define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++)
#define VV(type) vector< vector<type> >
#define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m)
#define vec(type) vector<type>
#define VEC(type,n,val) vector<type> val;val.resize(n)
#define VL vector<ll>
#define VVL vector< vector<ll> >
#define VP vector< pair<ll,ll> >
#define SZ size()
#define all(i) begin(i),end(i)
#define SORT(i) sort(all(i))
#define BITI(i) (1<<i)
#define BITSET(x,i) x | (ll(1)<<i)
#define BITCUT(x,i) x & ~(ll(1)<<i)
#define EXISTBIT(x,i) (((x>>i) & 1) != 0)
#define ALLBIT(n) (ll(1)<<n-1)
#define CHMAX(n,v) n=n<v?v:n
#define CHMIN(n,v) n=n>v?v:n
#define MP(a,b) make_pair(a,b)
#define DET2(x1,y1,x2,y2) (x1)*(y2)-(x2)*(y1)
#define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) (x1)*(y2)*(z3)+(x2)*(y3)*(z1)+(x3)*(y1)*(z2)-(z1)*(y2)*(x3)-(z2)*(y3)*(x1)-(z3)*(y1)*(x2)
#define INC(a) for(auto& v:a)v++;
#define DEC(a) for(auto& v:a)v--;
#define SQU(x) (x)*(x)
#define L0 ll(0)
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using mint2 = modint998244353;
#endif
template<typename T = ll>
vector<T> read(size_t n) {
  vector<T> ts(n);
  for (size_t i = 0; i < n; i++) cin >> ts[i];
  return ts;
}
template<typename TV, const ll N> void read_tuple_impl(TV&) {}
template<typename TV, const ll N, typename Head, typename... Tail>
void read_tuple_impl(TV& ts) {
  get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));
  read_tuple_impl<TV, N + 1, Tail...>(ts);
}
template<typename... Ts> decltype(auto) read_tuple(size_t n) {
  tuple<vector<Ts>...> ts;
  for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);
  return ts;
}
using val = ll;
//using func = pair<ll, ll>;
val op(val a, val b) {
  return min(a, b);
}
val e() { return 1e18; }
using val2 = mint2;
//using func = pair<ll, ll>;
val2 op2(val2 a, val2 b) {
  return a * b;
}
val2 e2() { return 1; }
//
//val mp(func f, val a)
//{
//  if (f.first < 0)
//    return a;
//  return f;
//}
//func comp(func f, func g) {
//  if (g.first < 0)
//    return f;
//  return g;
//}
//
//func id() {
//  return MP(-1, -1);
//}
ll di[4] = { 1,0,-1,0 };
ll dj[4] = { 0,1,0,-1 };
ll si[4] = { 0,3,3,0 };
ll sj[4] = { 0,0,3,3 };
//ll di[4] = { -1,-1,1,1 };
//ll dj[4] = { -1,1,-1,1 };
ll di8[8] = { 0,-1,-1,-1,0,1,1,1 };
ll dj8[8] = { -1,-1,0,1,1,1,0,-1 };
using u64 = unsigned long long;
class NimberManager {
private:
  using u32 = unsigned int;
  std::vector<u32> precalc1;
  std::vector<u32> inv_precalc1;
  void fill_precalc1() {
    precalc1.assign(1 << 16, 0);
    precalc1[(1 << 8) ^ 1] = 1;
    for (int dd = 1; dd < 8; dd <<= 1) {
      int d = 1 << dd;
      int c = d >> 1;
      for (int a0 = 0; a0 < d; a0++) for (int a1 = 0; a1 < d; a1++) if (a0 | a1) {
        for (int b0 = 0; b0 < d; b0++) for (int b1 = 0; b1 < d; b1++) if (b0 | b1) {
          u64 buf = 0;
          buf ^= precalc1[(a1 << 8) ^ b1];
          buf ^= precalc1[(a1 << 8) ^ b0];
          buf ^= precalc1[(a0 << 8) ^ b1];
          buf <<= dd;
          buf ^= precalc1[(c << 8) ^ precalc1[(a1 << 8) ^ b1]];
          buf ^= precalc1[(a0 << 8) ^ b0];
          precalc1[(((a1 << dd) ^ a0) << 8) ^ ((b1 << dd) ^ b0)] = buf;
        }
      }
    }
  }
  void inv_precalc() {
    inv_precalc1.resize(256);
    for (int i = 0; i < 256; ++i) {
      for (int j = 0; j < 256; ++j) {
        if (precalc1[(i << 8) ^ j] == 1) {
          inv_precalc1[i] = j;
          break;
        }
      }
    }
  }
  u64 product_full(u64 a, u64 b, int d = 6) noexcept {
    if (!(a && b)) return 0;
    if (d == 3) { return precalc1[(a << 8) ^ b]; }
    d--;
    u64 lm = ((u64)1 << (1 << d)) - 1;
    u64 us = ((u64)1 << d);
    u64 buf = 0;
    u64 a1b1 = product_full(a >> us, b >> us, d);
    u64 a2b2 = product_full(a & lm, b & lm, d);
    u64 aabb = product_full((a & lm) ^ (a >> us), (b & lm) ^ (b >> us), d);
    buf ^= (aabb ^ a2b2);
    buf <<= us;
    buf ^= a2b2;
    buf ^= product_full((u64)1 << (us - 1), a1b1, d);
    return buf;
  }
  u64 inv_full(u64 a, int d = 6) {
    if (a < 256) {
      return inv_precalc1[a];
    }
    u64 p = 1 << (d - 1);
    u64 a_h = a >> p;
    u64 a_l = a - (a_h << p);
    u64 half_inv = inv_full(product_full(a_h ^ a_l, a_l, d) ^ product_full(product_full(a_h, a_h, d - 1), 1ULL << (p - 1)), d - 1);
    return (product_full(half_inv, a_h, d) << p) ^ product_full(half_inv, a_h ^ a_l, d);
    return (product_full(half_inv, a_h, d) << p) ^ product_full(half_inv, a_h ^ a_l, d);
  }
public:
  NimberManager() { fill_precalc1(); inv_precalc(); }
  u64 product(u64 a, u64 b) noexcept { return product_full(a, b); }
  u64 pow(u64 a, u64 idx) noexcept {
    if (idx == 0) return 1;
    auto b = pow(product(a, a), idx / 2);
    if (idx & 1) b = product(b, a);
    return b;
  }
  u64 inv(u64 a) noexcept { return inv_full(a); }
};
void solve() {
  NimberManager nm;
  ll n, t;
  cin >> n >> t;
  vector h(t, vector<u64>());
  REP(i, t) {
    h[i] = read<u64>(n);
    DEC(h[i]);
  }
  vector<bool> use(t);
  REP(j, n) {
    u64 inv = 0;
    ll id = -1;
    REP(i, t) {
      if (h[i][j] == 0 || use[i])
        continue;
      inv = nm.inv(h[i][j]);
      use[i]=true;
      id=i;
      break;
    }
    if (id == -1) {
      continue;
    }
    REP(i, t) {
      if (i == id || h[i][j] == 0)
        continue;
      u64 mul = nm.product(inv, h[i][j]);
      REP(jj, n) {
        h[i][jj] ^= nm.product(mul, h[id][jj]);
      }
    }
  }
  vector abase(n,vector<u64>(n));
  REP(i,t){
    REP(j,n){
      if(h[i][j]){
        abase[j]=h[i];
        break;
      }
    }
  }
  reverse(all(abase));
  for(auto&r:abase)reverse(all(r));
  mint2 ans = 0;
  mint2 fr = mint2(2).pow(64);
  auto dfs=[&](auto self, vector<vector<u64>>& a, mint2 add, ll pc, ll id) -> void {
    if(id < 0){
      ans += pc%2 ? -add : add;
      return;
    }
    auto a0=a;
    mint2 add0 = a0.back().back() ? add : add * fr;
    a0.pop_back();
    for(auto& r:a0)r.pop_back();
    self(self,a0,add0,pc,id-1);
    auto a1=a;
    for(auto& r:a1)r.pop_back();
    PER(j0,a1.back().size()){
      if(a1.back()[j0]){
        u64 ainv=nm.inv(a1.back()[j0]);
        for(auto&v:a1.back())v=nm.product(v,ainv);
        REP(i,a1.size()){
          REP(j,a1[i].size()){
            if(i==j0){
              if(a1[j0][j0]!=a1.back()[j0])
                a1[i][j]^=a1.back()[j];
            }
            else
              a1[i][j]^=nm.product(a1.back()[j],a1[i][j0]);
          }
        }
        break;
      }
    }
    a1.pop_back();
    self(self,a1,add,pc+1,id-1);
    return;
  };
  dfs(dfs,abase,1,0,n-1);
  cout<<ans.val();
}
int main() {
  ll t = 1;
  //cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0