【Luogu4717】FWT快速沃尔什变换板子

Description

https://www.luogu.org/problemnew/show/P4717

---

Code

我真的只会背代码，看着和FFT差不多吧。。

/************************************************
 * Au: Hany01
 * Date: Jun 28th, 2018
 * Prob: Luogu4717 FWT-Template
 * Email: hany01@foxmail.com
 * Institute: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1 << 17, Mod = 998244353;

int a[maxn], b[maxn], A[maxn], B[maxn], n, N;
LL inv2;

inline LL Pow(LL a, LL b) {
    LL Ans = 1;
    for ( ; b; b >>= 1, (a *= a) %= Mod) if (b & 1) (Ans *= a) %= Mod;
    return Ans;
}

inline int ad(int x, int y) { if ((x += y) >= Mod) return x - Mod; return x; }

inline void FWTor(int *a, int ty) {
    for (register int i = 2; i <= N; i <<= 1)
        for (register int j = 0; j < N; j += i)
            rep(k, i >> 1)
                if (ty) a[j + (i >> 1) + k] = ad(a[j + (i >> 1) + k], a[j + k]);
                else a[j + (i >> 1) + k] = ad(a[j + (i >> 1) + k], Mod - a[j + k]);
}

inline void FWTand(int *a, int ty) {
    for (register int i = 2; i <= N; i <<= 1)
        for (register int j = 0; j < N; j += i)
            rep(k, i >> 1)
                if (ty) a[j + k] = ad(a[j + k], a[j + (i >> 1) + k]);
                else a[j + k] = ad(a[j + k], Mod - a[j + (i >> 1) + k]);
}

inline void FWTxor(int *a, int ty) {
    for (register int i = 2; i <= N; i <<= 1)
        for (register int j = 0; j < N; j += i)
            rep(k, i >> 1) {
                int x = a[j + k], y = a[j + k + (i >> 1)];
                a[j + k] = ad(x, y), a[j + k + (i >> 1)] = ad(x, Mod - y);
                if (!ty) a[j + k] = a[j + k] * inv2 % Mod, a[j + k + (i >> 1)] = a[j + k + (i >> 1)] * inv2 % Mod;
            }
}

int main()
{
#ifdef hany01
    File("luogu4717");
#endif

    n = read(), N = 1 << n, inv2 = Pow(2, Mod - 2);
    rep(i, N) A[i] = a[i] = read();
    rep(i, N) B[i] = b[i] = read();

    FWTor(A, 1), FWTor(B, 1);
    rep(i, N) A[i] = (LL)A[i] * B[i] % Mod;
    FWTor(A, 0);
    rep(i, N) printf("%d ", A[i]);
    putchar('\n');

    Cpy(A, a), Cpy(B, b), FWTand(A, 1), FWTand(B, 1);
    rep(i, N) A[i] = (LL)A[i] * B[i] % Mod;
    FWTand(A, 0);
    rep(i, N) printf("%d ", A[i]);
    putchar('\n');

    Cpy(A, a), Cpy(B, b), FWTxor(A, 1), FWTxor(B, 1);
    rep(i, N) A[i] = (LL)A[i] * B[i] % Mod;
    FWTxor(A, 0);
    rep(i, N) printf("%d ", A[i]);
    putchar('\n');

    return 0;
}
//数人世相逢，百年欢笑，能得几回又。
//    -- 何梦桂《摸鱼儿·记年时人人何处》