#1154175 (C++23) No.3486 Draw a Rainbow

• 問題: No.3486 Draw a Rainbow
• ユーザー: risujiroh
• 提出日時: 2026-03-27 22:15:09
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 305 ms / 4,000 ms
• コード長: 6,163 bytes
• コンパイル時間: 37,085 ms
• コンパイル使用メモリ: 342,324 KB
• 実行使用メモリ: 6,144 KB
• 最終ジャッジ日時: 2026-03-30 15:18:08
• 合計ジャッジ時間: 11,638 ms
• ジャッジサーバーID （参考情報）: judge2_1 / judge3_1

ファイルパターン	結果
sample	AC * 3
other	AC * 28

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

using Mint = atcoder::modint998244353;

void Solve() {
  int m, n1, n2;
  IN(m, n1, n2);
  Array2D<int> cnt(n1, n2);
  while (m--) {
    int i, j;
    IN(i, j);
    i -= 1;
    j -= 1 + n1;
    ++cnt[i][j];
  }

  Mint ans = 0;
  for (uint32_t mask : Rep(0, 1 << n2)) {
    Mint cur = 1;
    for (int i : Rep(0, n1)) {
      int sum = 0;
      for (int j : Bits(~mask)) {
        if (j == n2)
          break;
        sum += cnt[i][j];
      }
      cur *= Mint(2).pow(sum) - 1;
    }
    ans += popcount(mask) & 1 ? -cur : cur;
  }
  OUT(ans);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  Solve();
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

#include <atcoder/modint.hpp>

template <class T>
class Array2D {
 public:
  Array2D() : Array2D(0, 0) {}
  Array2D(int h, int w, T v = {}) : h_(h), w_(w), data_(h * w, std::move(v)) {}

  auto operator[](int i) { return std::span<T>(data_.data() + i * w_, w_); }
  auto operator[](int i) const { return std::span<const T>(data_.data() + i * w_, w_); }

 private:
  int h_;
  int w_;
  std::vector<T> data_;
};

template <class D>
class Operators {
  friend D operator++(D& a, int) requires requires(D a) { ++a; }
  {
    D r = a;
    ++a;
    return r;
  }

  friend D operator--(D& a, int) requires requires(D a) { --a; }
  {
    D r = a;
    --a;
    return r;
  }

  template <class T>
  friend D operator+(const D& a, const T& b) requires requires(D a, T b) { a += b; }
  {
    D r = a;
    r += b;
    return r;
  }

  template <class T>
  friend D operator-(const D& a, const T& b) requires requires(D a, T b) { a -= b; }
  {
    D r = a;
    r -= b;
    return r;
  }

  friend auto operator<=>(const Operators&, const Operators&) = default;
};

template <class D, class T, class N = ptrdiff_t>
class RangeFacade {
 public:
  class iterator : private Operators<iterator> {
   public:
    using value_type = T;
    using difference_type = N;

    decltype(auto) operator*() const {
      return r_.Current();
    }

    bool operator==(int) const {
      return !r_.HasMore();
    }

    iterator& operator++() {
      r_.Advance();
      return *this;
    }

    iterator() = default;

    friend bool operator==(const iterator&, const iterator&) = default;

    iterator& operator--() {
      r_.Advance(-1);
      return *this;
    }

    friend auto operator<=>(const iterator&, const iterator&) = default;

    difference_type operator-(const iterator& o) const {
      return o.r_.Distance(r_);
    }

    iterator& operator+=(difference_type n) {
      r_.Advance(n);
      return *this;
    }

    friend iterator operator+(difference_type n, const iterator& i) {
      return i + n;
    }

    iterator& operator-=(difference_type n) {
      r_.Advance(-n);
      return *this;
    }

    decltype(auto) operator[](difference_type n) const {
      return *(*this + n);
    }

   private:
    friend RangeFacade;

    iterator(const D& r) : r_{r} {}

    D r_;
  };

  iterator begin() const {
    return static_cast<const D&>(*this);
  }

  int end() const {
    return 0;
  }

  friend auto operator<=>(const RangeFacade&, const RangeFacade&) = default;
};

template <std::unsigned_integral T>
class Bits : public RangeFacade<Bits<T>, int> {
 public:
  explicit Bits(T mask) : mask_(mask) {}

 private:
  friend RangeFacade<Bits<T>, int>;

  int Current() const {
    return std::countr_zero(mask_);
  }

  bool HasMore() const {
    return mask_;
  }

  void Advance() {
    mask_ &= mask_ - 1;
  }

  T mask_;
};

template <class T>
concept MyRange =
    std::ranges::range<T> &&
    !std::convertible_to<T, std::string_view> &&
    !std::convertible_to<T, std::filesystem::path>;

template <class T>
concept MyTuple = std::__is_tuple_like<T>::value && !MyRange<T>;

namespace std {

istream& operator>>(istream& is, MyRange auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, MyTuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, MyRange auto&& r) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << forward<decltype(e)>(e);
  }
  return os;
}

ostream& operator<<(ostream& os, MyTuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

template <class T, atcoder::internal::is_modint_t<T>* = nullptr>
istream& operator>>(istream& is, T& x) {
  int v;
  is >> v;
  x = T::raw(v);
  return is;
}

template <class T, atcoder::internal::is_modint_t<T>* = nullptr>
ostream& operator<<(ostream& os, const T& x) {
  return os << x.val();
}

}  // namespace std

template <class T>
class OneBased {
 public:
  explicit OneBased(T&& x) : ref_(std::forward<T>(x)) {}

  template <class... Ts>
  requires(sizeof...(Ts) > 1)
      OneBased(Ts&&... xs) : ref_(std::forward_as_tuple(std::forward<Ts>(xs)...)) {}

  friend std::istream& operator>>(std::istream& is, OneBased x) {
    if constexpr (MyRange<T>) {
      for (auto&& e : x.ref_) {
        is >> ::OneBased(e);
      }
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { (is >> ... >> ::OneBased(xs)); }, x.ref_);
    } else {
      is >> x.ref_;
      --x.ref_;
    }
    return is;
  }

  friend std::ostream& operator<<(std::ostream& os, OneBased x) {
    if constexpr (MyRange<T>) {
      auto f = [](auto&& e) { return ::OneBased(std::forward<decltype(e)>(e)); };
      os << (x.ref_ | std::views::transform(f));
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { os << std::tuple(::OneBased(xs)...); }, x.ref_);
    } else {
      os << ++x.ref_;
      --x.ref_;
    }
    return os;
  }

 private:
  T ref_;
};

template <class T>
OneBased(T&&) -> OneBased<T>;

template <class... Ts>
OneBased(Ts&&...) -> OneBased<std::tuple<Ts...>>;

using namespace std;

#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1