結果
問題 | No.1503 Bitwise And Convolution Twisted |
ユーザー | tokusakurai |
提出日時 | 2021-05-08 13:25:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 349 ms / 2,000 ms |
コード長 | 4,371 bytes |
コンパイル時間 | 2,264 ms |
コンパイル使用メモリ | 203,564 KB |
実行使用メモリ | 15,488 KB |
最終ジャッジ日時 | 2024-09-16 17:33:07 |
合計ジャッジ時間 | 6,048 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 7 ms
5,376 KB |
testcase_07 | AC | 84 ms
6,144 KB |
testcase_08 | AC | 7 ms
5,376 KB |
testcase_09 | AC | 349 ms
15,488 KB |
testcase_10 | AC | 340 ms
15,488 KB |
testcase_11 | AC | 331 ms
15,488 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; //const int MOD = 1000000007; const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; template<int mod> struct Mod_Int{ int x; Mod_Int() : x(0) {} Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} Mod_Int &operator += (const Mod_Int &p){ if((x += p.x) >= mod) x -= mod; return *this; } Mod_Int &operator -= (const Mod_Int &p){ if((x += mod - p.x) >= mod) x -= mod; return *this; } Mod_Int &operator *= (const Mod_Int &p){ x = (int) (1LL * x * p.x % mod); return *this; } Mod_Int &operator /= (const Mod_Int &p){ *this *= p.inverse(); return *this; } Mod_Int &operator ++ () {return *this += Mod_Int(1);} Mod_Int operator ++ (int){ Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int &operator -- () {return *this -= Mod_Int(1);} Mod_Int operator -- (int){ Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator - () const {return Mod_Int(-x);} Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;} Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;} Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;} Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;} bool operator == (const Mod_Int &p) const {return x == p.x;} bool operator != (const Mod_Int &p) const {return x != p.x;} Mod_Int inverse() const{ assert(*this != Mod_Int(0)); return pow(mod-2); } Mod_Int pow(long long k) const{ Mod_Int now = *this, ret = 1; for(; k > 0; k >>= 1, now *= now){ if(k&1) ret *= now; } return ret; } friend ostream &operator << (ostream &os, const Mod_Int &p){ return os << p.x; } friend istream &operator >> (istream &is, Mod_Int &p){ long long a; is >> a; p = Mod_Int<mod>(a); return is; } }; using mint = Mod_Int<MOD>; template<typename T> void Fast_Zeta_Transform(vector<T> &f, bool upper){ int n = f.size(); assert((n&(n-1)) == 0); for(int i = 1; i < n; i <<= 1){ for(int j = 0; j < n; j++){ if(!(j&i)){ if(upper) f[j] += f[j|i]; else f[j|i] += f[j]; } } } } template<typename T> void Fast_Mobius_Transform(vector<T> &f, bool upper){ int n = f.size(); assert((n&(n-1)) == 0); for(int i = 1; i < n; i <<= 1){ for(int j = 0; j < n; j++){ if(!(j&i)){ if(upper) f[j] -= f[j|i]; else f[j|i] -= f[j]; } } } } template<typename T> void Fast_Hadamard_Transform(vector<T> &f, bool inverse = false){ int n = f.size(); assert((n&(n-1)) == 0); for(int i = 1; i < n; i <<= 1){ for(int j = 0; j < n; j++){ if(!(j&i)){ T x = f[j], y = f[j|i]; f[j] = x+y, f[j|i] = x-y; } } } if(inverse) for(auto &e : f) e /= n; } int main(){ int N; cin >> N; vector<mint> a(1<<N), b(1<<N); rep(i, 1<<N) cin >> a[i]; rep(i, 1<<N) cin >> b[i]; Fast_Zeta_Transform(a, true); Fast_Mobius_Transform(b, false); vector<mint> c(1<<N); rep(i, 1<<N) c[i] = a[i]*b[i]; Fast_Zeta_Transform(c, false); rep(i, 1<<N) cout << c[i] << (i == (1<<N)-1? '\n' : ' '); }