#998879 (C++23) No.2907 Business Revealing Dora Tiles

提出ソース

結果

問題	No.2907 Business Revealing Dora Tiles
ユーザー	👑 amentorimaru
提出日時	2024-08-02 01:46:05
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,241 ms / 3,000 ms
コード長	8,462 bytes
コンパイル時間	11,684 ms
コンパイル使用メモリ	246,996 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-23 12:50:57
合計ジャッジ時間	33,767 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,812 KB
testcase_03	AC	3 ms 6,944 KB
testcase_04	AC	3 ms 6,944 KB
testcase_05	AC	4 ms 6,944 KB
testcase_06	AC	3 ms 6,940 KB
testcase_07	AC	24 ms 6,940 KB
testcase_08	AC	10 ms 6,944 KB
testcase_09	AC	3 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	73 ms 6,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	3 ms 6,940 KB
testcase_15	AC	3 ms 6,944 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	10 ms 6,940 KB
testcase_19	AC	2 ms 6,944 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	151 ms 6,940 KB
testcase_22	AC	7 ms 6,940 KB
testcase_23	AC	146 ms 6,940 KB
testcase_24	AC	303 ms 6,940 KB
testcase_25	AC	307 ms 6,940 KB
testcase_26	AC	311 ms 6,944 KB
testcase_27	AC	309 ms 6,944 KB
testcase_28	AC	312 ms 6,940 KB
testcase_29	AC	341 ms 6,940 KB
testcase_30	AC	313 ms 6,940 KB
testcase_31	AC	321 ms 6,944 KB
testcase_32	AC	313 ms 6,940 KB
testcase_33	AC	319 ms 6,940 KB
testcase_34	AC	307 ms 6,940 KB
testcase_35	AC	333 ms 6,944 KB
testcase_36	AC	314 ms 6,940 KB
testcase_37	AC	304 ms 6,940 KB
testcase_38	AC	312 ms 6,944 KB
testcase_39	AC	312 ms 6,940 KB
testcase_40	AC	307 ms 6,940 KB
testcase_41	AC	325 ms 6,940 KB
testcase_42	AC	307 ms 6,944 KB
testcase_43	AC	335 ms 6,944 KB
testcase_44	AC	629 ms 6,940 KB
testcase_45	AC	1,241 ms 6,940 KB
testcase_46	AC	626 ms 6,940 KB
testcase_47	AC	126 ms 6,944 KB
testcase_48	AC	158 ms 6,944 KB
testcase_49	AC	851 ms 6,940 KB
testcase_50	AC	960 ms 6,944 KB
testcase_51	AC	40 ms 6,940 KB
testcase_52	AC	322 ms 6,940 KB
testcase_53	AC	901 ms 6,940 KB
testcase_54	AC	113 ms 6,940 KB
testcase_55	AC	887 ms 6,944 KB
testcase_56	AC	877 ms 6,940 KB
testcase_57	AC	881 ms 6,944 KB
testcase_58	AC	734 ms 6,940 KB
testcase_59	AC	654 ms 6,944 KB

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

コンパイルメッセージ

main.cpp: In function 'void solve()':
main.cpp:308:16: warning: 'bj' may be used uninitialized [-Wmaybe-uninitialized]
  308 |         raw[i] = bj;
main.cpp:263:8: note: 'bj' was declared here
  263 |     ll bj;
      |        ^~

ソースコード

raw source code

#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 };


class NimberManager {
private:
  using u32 = unsigned int;
  using u64 = unsigned long long;

  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(); }

  unsigned long long product(unsigned long long a, unsigned long long b) noexcept { return product_full(a, b); }
  unsigned long long pow(unsigned long long a, unsigned long long idx) noexcept {
    if (idx == 0) return 1;
    auto b = pow(product(a, a), idx / 2);
    if (idx & 1) b = product(b, a);
    return b;
  }
  unsigned long long inv(unsigned long long a) noexcept { return inv_full(a); }
};

void solve() {
  NimberManager nm;
  ll n, t;
  cin >> n >> t;
  vector h(t, vector<unsigned long long>());
  REP(i, t) {
    h[i] = read<unsigned long long>(n);
    DEC(h[i]);
  }
  mint2 fr = mint2(2).pow(64);
  mint2 frinv = fr.inv();

  vector<ll> col(n, -1);
  vector<ll> raw(t, -1);
  mint2 ans = 0;
  mint2 add = 1;
  REP(j, n) {
    unsigned long long inv = 0;
    REP(i, t) {
      if (raw[i] != -1 || h[i][j] == 0)
        continue;
      col[j] = i;
      raw[i] = j;
      inv = nm.inv(h[i][j]);
      break;
    }
    if (col[j] == -1) {
      add *= fr;
      continue;
    }
    REP(i, t) {
      if (i == col[j] || h[i][j] == 0)
        continue;
      unsigned long long mul = nm.product(inv, h[i][j]);
      REP(jj, n) {
        h[i][jj] ^= nm.product(mul, h[col[j]][jj]);
      }
    }
  }
  ans += add;

  ll bn = 1LL << n;
  FOR(b, 1, bn) {
    ll gb = b ^ (b >> 1);
    ll bb = (b - 1) ^ ((b - 1) >> 1);
    // ll bj = count_zero(gb ^ bb);
    ll bj;
    ll pc = 0;
    REP(j, n) {
      if (((gb ^ bb) >> j) == 1) {
        bj = j;
      }
      pc += EXISTBIT(gb, j);
    }
    if (EXISTBIT(gb, bj)) {
      if (col[bj] != -1) {
        ll ej = raw[col[bj]];
        ll ei = col[bj];
        raw[col[bj]] = -1;
        col[bj] = -1;
        unsigned long long inv = 0;
        REP(j, n) {
          if (EXISTBIT(gb, j) || col[j] != -1 || h[ei][j] == 0)
            continue;
          col[j] = ei;
          raw[ei] = j;
          inv = nm.inv(h[ei][j]);
          break;
        }
        if (raw[ei] != -1) {
          add *= frinv;
          REP(i, t) {
            if (i == col[raw[ei]] || h[i][raw[ei]] == 0)
              continue;
            unsigned long long mul = nm.product(inv, h[i][raw[ei]]);
            REP(jj, n) {
              h[i][jj] ^= nm.product(mul, h[ei][jj]);
            }
          }
        }
      }
      else {
        add *= frinv;
      }
    }
    else {
      unsigned long long inv = 0;
      REP(i, t) {
        if (raw[i] != -1 || h[i][bj] == 0)
          continue;
        col[bj] = i;
        raw[i] = bj;
        inv = nm.inv(h[i][bj]);
        break;
      }
      if (col[bj] == -1) {
        add *= fr;        
      }
      else {
        REP(i, t) {
          if (i == col[bj] || h[i][bj] == 0)
            continue;
          unsigned long long mul = nm.product(inv, h[i][bj]);
          REP(jj, n) {
            h[i][jj] ^= nm.product(mul, h[col[bj]][jj]);
          }
        }
      }
    }
    ans += __popcount(gb) % 2 ? -add : add;
  }
  cout << ans.val();
}

int main() {
  ll t = 1;
  //cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード