結果

問題 No.2733 Just K-times TSP
コンテスト
ユーザー Today03
提出日時 2024-04-19 22:53:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,283 bytes
コンパイル時間 2,348 ms
コンパイル使用メモリ 208,052 KB
最終ジャッジ日時 2025-02-21 05:07:48
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 22 TLE * 1 -- * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

template <ll MOD>
struct modint {
    ll value;
    modint(ll x = 0) {
        if (x >= 0) {
            value = x % MOD;
        } else {
            value = MOD - (-x) % MOD;
        }
    }
    modint operator-() const {
        return modint(-value);
    }
    modint operator+() const {
        return modint(*this);
    }
    modint &operator+=(const modint &other) {
        value += other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator-=(const modint &other) {
        value += MOD - other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator*=(const modint other) {
        value = value * other.value % MOD;
        return *this;
    }
    modint &operator/=(modint other) {
        (*this) *= other.inv();
        return *this;
    }
    modint operator+(const modint &other) const {
        return modint(*this) += other;
    }
    modint operator-(const modint &other) const {
        return modint(*this) -= other;
    }
    modint operator*(const modint &other) const {
        return modint(*this) *= other;
    }
    modint operator/(const modint &other) const {
        return modint(*this) /= other;
    }
    modint pow(ll x) const {
        modint ret(1), mul(value);
        while (x) {
            if (x & 1) {
                ret *= mul;
            }
            mul *= mul;
            x >>= 1;
        }
        return ret;
    }
    modint inv() const {
        return pow(MOD - 2);
    }
    bool operator==(const modint &other) const {
        return value == other.value;
    }
    bool operator!=(const modint &other) const {
        return value != other.value;
    }
    friend ostream &operator<<(ostream &os, const modint &x) {
        return os << x.value;
    }
    friend istream &operator>>(istream &is, modint &x) {
        ll v;
        is >> v;
        x = modint<MOD>(v);
        return is;
    }
};
using mod998 = modint<998244353>;
using mod107 = modint<1000000007>;

using mint = mod998;

int main() {
    int N, M, K;
    cin >> N >> M >> K;
    vector<vector<int>> G(N);
    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    map<pair<int, vector<int>>, mint> dp;
    auto F = [&](auto &&F, int now, vector<int> &v) -> mint {
        if (dp.count({now, v})) {
            return dp[{now, v}];
        }

        bool ok = true;
        for (int i = 0; i < N; i++) {
            if (v[i] != K) {
                ok = false;
                break;
            }
        }

        if (ok) {
            return dp[{now, v}] = 1;
        }

        mint ret = 0;
        for (int nxt : G[now]) {
            if (v[nxt] == K) {
                continue;
            }

            v[nxt]++;
            ret += F(F, nxt, v);
            v[nxt]--;
        }

        return dp[{now, v}] = ret;
    };

    vector<int> v(N, 0);

    mint ans = 0;
    for (int i = 0; i < N; i++) {
        v[i]++;
        ans += F(F, i, v);
        v[i]--;
    }

    cout << ans << endl;
}
0