結果
| 問題 | No.2907 Business Revealing Dora Tiles |
| ユーザー |
👑  amentorimaru
|
| 提出日時 | 2024-07-31 23:20:16 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,871 bytes |
| コンパイル時間 | 14,107 ms |
| コンパイル使用メモリ | 259,408 KB |
| 実行使用メモリ | 10,400 KB |
| 最終ジャッジ日時 | 2024-09-23 12:42:39 |
| 合計ジャッジ時間 | 24,692 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 8 TLE * 1 -- * 48 |
ソースコード
#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;#endiftemplate<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 = tuple<ll, ll, ll>;//using func = pair<ll, ll>;val op(val a, val b) {return max(a, b);}val e() { return make_tuple(0LL, 0LL, 0LL); }////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 NimProduct {public:NimProduct(int k = 6) {pre.resize(256, vector<int>(256));preinv.resize(256);// precalcfor (int a = 255; a > 1; a--) {for (int b = 255; b > 1; b--) {prod_impl(a, b, 3);}}for (int a = 1; a < 256; a++) {for (int b = 1; b < 256; b++) {if (pre[a][b] == 1) {preinv[a] = b;break;}}}};u64 prod_impl(u64 a, u64 b, int k = 6) {if (a <= 1 || b <= 1) {return a * b;}if (a < 256 && b < 256 && pre[a][b] != 0) {}u64 kb = 1LL << (k - 1);u64 mask = (1LL << kb) - 1;if (a <= mask && b <= mask) {return prod_impl(a, b, k - 1);}u64 au = a >> kb;u64 al = a & mask;u64 bu = b >> kb;u64 bl = b & mask;u64 l = prod_impl(au, bu, k - 1) ^ prod_impl(al, bu, k - 1) ^ prod_impl(au, bl, k - 1);u64 r = prod_impl(prod_impl(au, bu, k - 1), u64(1) << (kb - 1), k - 1) ^ prod_impl(al, bl, k - 1);u64 res = (l << kb) ^ r;if (a < 256 && b < 256)pre[a][b] = res;return res;}u64 inv_impl(u64 a, int k = 6) {if (a < 256) {return preinv[a];}u64 kb = 1LL << (k - 1);if (a < kb) {return inv_impl(a, k - 1);}u64 a_h = a >> kb;u64 a_l = a - (a_h << kb);u64 half_inv = inv_impl(prod_impl(a_h ^ a_l, a_l, k) ^ prod_impl(prod_impl(a_h, a_h, k - 1), 1ULL << (kb - 1)), k - 1);return (prod_impl(half_inv, a_h, k) << kb) ^ prod_impl(half_inv, a_h ^ a_l, k);}u64 prod(u64 a, u64 b) {return prod_impl(a, b);}u64 inv(u64 a) {return inv_impl(a);}vector<vector<int>> pre;vector<int> preinv;};void solve() {NimProduct np;ll n, t;cin >> n >> t;vector h(t, vector<u64>());REP(i, t) {h[i] = read<u64>(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;u64 inv = 0;REP(i, t) {if (use[i] || h[i][j] == 0)continue;idx = i;inv = np.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 = np.prod(inv, h[i][j]);REP(jj, n) {h[i][jj] ^= np.prod(mul, h[idx][jj]);}}}ans += __popcount(b) % 2 ? -add : add;}cout << ans.val();return;}int main() {ll t = 1;//cin >> t;while (t--) {solve();}return 0;}