結果

問題 No.2788 4-33 Hard
ユーザー ecotteaecottea
提出日時 2024-06-16 00:44:28
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 8,607 bytes
コンパイル時間 5,265 ms
コンパイル使用メモリ 277,208 KB
実行使用メモリ 13,756 KB
最終ジャッジ日時 2024-06-16 00:44:39
合計ジャッジ時間 10,364 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3 TLE * 1
other -- * 52
権限があれば一括ダウンロードができます

ソースコード

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

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = {1, 0, -1, 0}; // 4
int DY[4] = {0, 1, 0, -1};
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
template <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
//mod 998244353O(D n log n)
/*
* n = Πns[0..D) a[0..n), b[0..n) ns ns[0]
* a, b
*/
vm multivariate_convolution(const vm& a, const vm& b, const vi& ns) {
// : https://nyaannyaan.github.io/library/ntt/multivariate-multiplication.hpp
// verify : https://judge.yosupo.jp/problem/multivariate_convolution
//
// x rank(x)
// rank(x) = Σi∈[d..D) floor(x / Πns[0..d))
// ns ns[D-1]=∞ x+y
// rank(x+y) - (rank(x) + rank(y)) ∈ [0..D)
//
//
// rank mod D
// rank(x+y) - (rank(x) + rank(y)) ≡ 0 (mod d)
//
// ns 2
// n : , D :
int n = sz(a), D = sz(ns);
// acc[i] = Πns[0..i)
vi acc(D + 1);
acc[0] = 1;
rep(d, D) acc[d + 1] = acc[d] * ns[d];
Assert(n == acc[D]);
if (D == 0) return vm{ a[0] * b[0] };
// rank[i] = Σd∈[1..D) floor(i / Πns[0..d))
vi rank(n);
rep(i, n) {
repi(d, 1, D - 1) rank[i] += i / acc[d];
rank[i] %= D;
}
// 2 rank(i) mod D
int N = 1 << (msb(acc[D] - 1) + 2);
vvm as(D, vm(N)), bs(D, vm(N));
rep(i, n) {
as[rank[i]][i] = a[i];
bs[rank[i]][i] = b[i];
}
// NTT
rep(d, D) {
internal::butterfly(as[d]);
internal::butterfly(bs[d]);
}
vm c(n); vm tmp(N);
//
rep(da, D) rep(db, D) {
//
rep(i, N) tmp[i] = as[da][i] * bs[db][i];
// INTT
internal::butterfly_inv(tmp);
// i ≧ n
rep(i, n) if ((rank[i] - da - db) % D == 0) c[i] += tmp[i];
}
// 調
mint inv = mint(N).inv();
rep(i, n) c[i] *= inv;
return c;
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
auto start = chrono::system_clock::now();
int T = 8 + 1, A = 4 + 1, B = 33 + 1;
vvl O(A, vl(B));
vvl X(A, vl(B));
cin >> O >> X;
vi ns{ B, A, T };
vm dp(T * A * B);
dp[(0 * A + 0) * B + 0] = 1;
rep(a, A) rep(b, B) {
vm pow2(T * A * B);
pow2[(0 * A + 0) * B + 0] = 1;
pow2[(1 * A + a) * B + b] = 1;
vm res(T * A * B);
res[(0 * A + 0) * B + 0] = 1;
ll n = O[a][b];
while (n > 0) {
if (n & 1) res = multivariate_convolution(res, pow2, ns);
pow2 = multivariate_convolution(pow2, pow2, ns);
n /= 2;
}
dp = multivariate_convolution(dp, res, ns);
// dump(a, b); dump(dp); exit(0);
}
dump(dp);
mint res = 0;
rep(a, A) {
int a2 = 4 - a;
res += dp[(8 * A + a2) * B + 33] * X[a][0];
}
cout << res << endl;
auto now = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(now - start).count();
cerr << endl << msec << " msec" << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0