#1023946 (C++23(gcc13)) No.2711 Connecting Lights

• 問題: No.2711 Connecting Lights
• ユーザー: commy
• 提出日時: 2024-11-01 20:56:48
• 言語: C++23(gcc13) (gcc 13.2.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 5,120 bytes
• コンパイル時間: 1,217 ms
• コンパイル使用メモリ: 107,496 KB
• 実行使用メモリ: 8,960 KB
• 最終ジャッジ日時: 2024-11-01 20:56:52
• 合計ジャッジ時間: 3,438 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	1 ms; 6,816 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	4 ms; 6,816 KB
testcase_06	AC	2 ms; 6,820 KB
testcase_07	AC	3 ms; 6,820 KB
testcase_08	AC	3 ms; 6,816 KB
testcase_09	AC	76 ms; 6,816 KB
testcase_10	AC	57 ms; 6,816 KB
testcase_11	AC	102 ms; 8,064 KB
testcase_12	AC	28 ms; 6,816 KB
testcase_13	AC	31 ms; 6,816 KB
testcase_14	AC	5 ms; 6,820 KB
testcase_15	AC	17 ms; 6,816 KB
testcase_16	AC	4 ms; 6,816 KB
testcase_17	AC	4 ms; 6,820 KB
testcase_18	AC	6 ms; 6,820 KB
testcase_19	AC	81 ms; 7,040 KB
testcase_20	AC	34 ms; 6,820 KB
testcase_21	AC	4 ms; 6,816 KB
testcase_22	AC	2 ms; 6,820 KB
testcase_23	AC	3 ms; 6,816 KB
testcase_24	AC	47 ms; 6,820 KB
testcase_25	AC	59 ms; 6,820 KB
testcase_26	AC	129 ms; 8,960 KB
testcase_27	AC	127 ms; 8,832 KB
testcase_28	AC	129 ms; 8,960 KB
testcase_29	AC	122 ms; 8,832 KB

ソースコード

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
constexpr static struct PositiveInfinity { template<typename T> constexpr operator T() const { return numeric_limits<T>::max() / 2; } constexpr auto operator-() const; } inf;  // NOLINT
constexpr static struct NegativeInfinity { template<typename T> constexpr operator T() const { return numeric_limits<T>::lowest() / 2; } constexpr auto operator-() const; } NegativeInfinityVal;
constexpr auto PositiveInfinity::operator-() const { return NegativeInfinityVal; }
constexpr auto NegativeInfinity::operator-() const { return inf; }
// clang-format on

#include <iostream>
template<long long tmod>
class ModInt {
    using Self = ModInt<tmod>;

    long long n;
    auto constexpr inverse() const {
        return this->pow(*this, this->mod - 2);
    }

public:
    constexpr static long long mod = tmod;  // NOLINT

    constexpr ModInt() : n(0) {}
    constexpr ModInt(const long long in) {
        n = in % Self::mod;
        if (n < 0)
            n += Self::mod;
    }
    constexpr Self &operator+=(const Self &m) {
        n += m.n;
        if (n >= Self::mod)
            n -= Self::mod;
        return *this;
    }
    constexpr Self &operator-=(const Self &m) {
        n -= m.n;
        if (n < 0)
            n += Self::mod;
        return *this;
    }
    constexpr Self &operator*=(const Self &m) {
        n *= m.n;
        if (n >= Self::mod)
            n %= Self::mod;
        return *this;
    }
    constexpr Self &operator/=(const Self &m) {
        return (*this) *= m.inverse();
    }
    friend constexpr Self operator+(const Self &lhs, const Self &rhs) {
        return Self(lhs) += rhs;
    }
    friend constexpr Self operator-(const Self &lhs, const Self &rhs) {
        return Self(lhs) -= rhs;
    }
    friend constexpr Self operator*(const Self &lhs, const Self &rhs) {
        return Self(lhs) *= rhs;
    }
    friend constexpr Self operator/(const Self &lhs, const Self &rhs) {
        return Self(lhs) /= rhs;
    }
    constexpr Self operator=(const long long in) const {
        return Self(in);
    }
    friend std::ostream &operator<<(std::ostream &out, const Self &m) {
        out << m.n;
        return out;
    }
    friend std::istream &operator>>(std::istream &in, Self &m) {
        long long l;
        in >> l;
        m = Self(l);
        return in;
    }
    friend constexpr bool operator==(const Self &lhs, const Self &rhs) {
        return lhs.n == rhs.n;
    }
    friend constexpr bool operator!=(const Self &lhs, const Self &rhs) {
        return !(lhs == rhs);
    }
    static constexpr Self pow(const Self &x, long long p) {
        Self ans = 1;
        for (Self m = x; p > 0; p /= 2, m *= m) {
            if (p % 2)
                ans *= m;
        }
        return ans;
    }
    constexpr long long raw() const {
        return n;
    }
};
using mint = ModInt<998244353>;  // NOLINT
constexpr mint operator""_m(unsigned long long m) {
    return mint(m);
}

int popcount(ll bits) {
    bits = (bits & 0x5555555555555555LL) + (bits >> 1 & 0x5555555555555555LL);
    bits = (bits & 0x3333333333333333LL) + (bits >> 2 & 0x3333333333333333LL);
    bits = (bits & 0x0f0f0f0f0f0f0f0fLL) + (bits >> 4 & 0x0f0f0f0f0f0f0f0fLL);
    bits = (bits & 0x00ff00ff00ff00ffLL) + (bits >> 8 & 0x00ff00ff00ff00ffLL);
    bits = (bits & 0x0000ffff0000ffffLL) + (bits >> 16 & 0x0000ffff0000ffffLL);
    return (bits & 0x00000000ffffffffLL) + (bits >> 32 & 0x00000000ffffffffLL);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m, k;
    cin >> n >> m >> k;
    const int bits = 1 << n;
    auto dp = make_v(m + 1, bits, 0_m);
    dp[0][bits - 1] = 1_m;
    rep(i, 0, m) {
        rep(j, 0, bits) {
            rep(l, 0, bits) {
                if (popcount(j & l) >= k) {
                    dp[i + 1][l] += dp[i][j];
                }
            }
        }
    }
    mint ans = 0;
    rep(i, 0, bits) {
        ans += dp[m][i];
    }
    print(ans);

    return 0;
}