Bitwise畳み込みAND
(library/polynomial/fft/convolution_bitwise_and.hpp)

• View this file on GitHub
• Last update: 2026-01-20 20:11:22+09:00
• Include: #include "library/polynomial/fft/convolution_bitwise_and.hpp"

Bitwise畳み込みAND

できること

$h_k = \sum_{i AND j=k}　f_i \cdot g_j$

• Bitwise畳み込み AND を計算する

計算量

$O(NlogN)$

使い方

auto c = convolution_bitwise_and(a, b);

Depends on

• 上位集合のゼータ・メビウス変換 (library/polynomial/fft/superset_zeta_moebius_transform.hpp)

Verified with

• Bitwise畳み込みANDのテスト (tests/polynomial.fft.convolution_bitwise_and.test.cpp)

Code

#pragma once
#include "library/polynomial/fft/superset_zeta_moebius_transform.hpp"
template <typename T>
vector<T> convolution_bitwise_and(vector<T> f, vector<T> g) {
    const int n = (int)f.size();
    assert(f.size() == g.size());
    assert((n & (n - 1)) == 0);
    superset_zeta_transform(f);
    superset_zeta_transform(g);
    for (int i = 0; i < n; i++) f[i] *= g[i];
    superset_moebius_transform(f);
    return f;
}

#line 2 "library/polynomial/fft/superset_zeta_moebius_transform.hpp"
template <typename T> void superset_zeta_transform(vector<T> &f) {
    const int n = (int)f.size();
    assert((n & (n - 1)) == 0ll);
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j += i << 1) {
            for (int k = 0; k < i; k++) {
                f[j + k] += f[j + k + i];
            }
        }
    }
}
template <typename T> void superset_moebius_transform(vector<T> &f) {
    const int n = (int)f.size();
    assert((n & (n - 1)) == 0ll);
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j += i << 1) {
            for (int k = 0; k < i; k++) {
                f[j + k] -= f[j + k + i];
            }
        }
    }
}
#line 3 "library/polynomial/fft/convolution_bitwise_and.hpp"
template <typename T>
vector<T> convolution_bitwise_and(vector<T> f, vector<T> g) {
    const int n = (int)f.size();
    assert(f.size() == g.size());
    assert((n & (n - 1)) == 0);
    superset_zeta_transform(f);
    superset_zeta_transform(g);
    for (int i = 0; i < n; i++) f[i] *= g[i];
    superset_moebius_transform(f);
    return f;
}

Back to top page