結果
| 問題 | No.2907 Business Revealing Dora Tiles |
| ユーザー |
👑  amentorimaru
|
| 提出日時 | 2024-06-01 14:21:18 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 6,888 bytes |
| コンパイル時間 | 12,164 ms |
| コンパイル使用メモリ | 242,572 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-09-23 11:10:40 |
| 合計ジャッジ時間 | 29,975 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | RE | - |
| testcase_02 | RE | - |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | RE | - |
| testcase_39 | RE | - |
| testcase_40 | RE | - |
| testcase_41 | RE | - |
| testcase_42 | RE | - |
| testcase_43 | RE | - |
| testcase_44 | RE | - |
| testcase_45 | RE | - |
| testcase_46 | RE | - |
| testcase_47 | RE | - |
| testcase_48 | RE | - |
| testcase_49 | RE | - |
| testcase_50 | RE | - |
| testcase_51 | RE | - |
| testcase_52 | RE | - |
| testcase_53 | RE | - |
| testcase_54 | RE | - |
| testcase_55 | RE | - |
| testcase_56 | RE | - |
| testcase_57 | RE | - |
| testcase_58 | RE | - |
| testcase_59 | RE | - |
ソースコード
#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() {
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;
unsigned long long invpow = -2;
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 ans = 0;
ll bn = 1LL << n;
REP(b, bn) {
vector<bool> use(t);
mint2 add = 1;
REP(j, n) {
if (EXISTBIT(b, j))
continue;
ll idx = -1;
unsigned long long inv = 0;
REP(i, t) {
if (use[i] || h[i][j] == 0)
continue;
idx = i;
inv = nm.inv(h[i][j]);
break;
}
if (idx == -1) {
add *= fr;
continue;
}
use[idx] = true;
REP(i, t) {
if (i == idx || 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[idx][jj]);
}
}
}
ans += __popcount(b) % 2 ? -add : add;
}
cout << ans.val();
}
int main() {
ll t = 1;
//cin >> t;
while (t--) {
solve();
}
return 0;
}