Fast Möbius transform (Supersets)
(Mylib/Convolution/fast_mobius_transform_superset.cpp)

• View this file on GitHub
• Last update: 2021-04-23 23:44:44+09:00
• Link: View error logs on GitHub Actions

Operations

• fast_mobius_transform_superset(f[N], op = std::minus())
  • Nは2の累乗
  • $g(S) = \sum_{T \subseteq S} f(T) * (-1) ^ {\vert S \vert - \vert T \vert}$

Requirements

Notes

Problems

References

Required by

• Convolution (Index bitwise AND) (Mylib/Convolution/convolution_and.cpp)

Verified with

• test/aoj/3119/main.test.cpp
• test/yosupo-judge/bitwise_and_convolution/main.test.cpp

Code

#pragma once
#include <cassert>
#include <functional>
#include <vector>

namespace haar_lib {
  template <typename T, typename Func = std::minus<T>>
  std::vector<T> fast_mobius_transform_superset(std::vector<T> f, const Func &op = std::minus<T>()) {
    const int N = f.size();
    assert((N & (N - 1)) == 0 && "N must be a power of 2");
    for (int i = 1; i < N; i <<= 1) {
      for (int j = 0; j < N; ++j) {
        if (not(j & i)) f[j] = op(f[j], f[j ^ i]);
      }
    }
    return f;
  }
}  // namespace haar_lib

#line 2 "Mylib/Convolution/fast_mobius_transform_superset.cpp"
#include <cassert>
#include <functional>
#include <vector>

namespace haar_lib {
  template <typename T, typename Func = std::minus<T>>
  std::vector<T> fast_mobius_transform_superset(std::vector<T> f, const Func &op = std::minus<T>()) {
    const int N = f.size();
    assert((N & (N - 1)) == 0 && "N must be a power of 2");
    for (int i = 1; i < N; i <<= 1) {
      for (int j = 0; j < N; ++j) {
        if (not(j & i)) f[j] = op(f[j], f[j ^ i]);
      }
    }
    return f;
  }
}  // namespace haar_lib

Back to top page