#974666 (C++23) No.2733 Just K-times TSP

• 問題: No.2733 Just K-times TSP
• ユーザー: MMRZ
• 提出日時: 2024-04-19 23:44:34
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 288 ms / 2,000 ms
• コード長: 4,259 bytes
• コンパイル時間: 3,288 ms
• コンパイル使用メモリ: 255,284 KB
• 実行使用メモリ: 48,780 KB
• 最終ジャッジ日時: 2024-10-11 18:30:45
• 合計ジャッジ時間: 5,202 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	3 ms; 5,248 KB
testcase_15	AC	4 ms; 5,248 KB
testcase_16	AC	3 ms; 5,248 KB
testcase_17	AC	16 ms; 7,296 KB
testcase_18	AC	19 ms; 7,424 KB
testcase_19	AC	20 ms; 7,296 KB
testcase_20	AC	6 ms; 5,248 KB
testcase_21	AC	15 ms; 7,296 KB
testcase_22	AC	159 ms; 48,780 KB
testcase_23	AC	18 ms; 7,296 KB
testcase_24	AC	121 ms; 25,728 KB
testcase_25	AC	108 ms; 25,728 KB
testcase_26	AC	3 ms; 5,248 KB
testcase_27	AC	2 ms; 5,248 KB
testcase_28	AC	4 ms; 5,248 KB
testcase_29	AC	10 ms; 5,248 KB
testcase_30	AC	27 ms; 7,296 KB
testcase_31	AC	66 ms; 13,312 KB
testcase_32	AC	143 ms; 25,728 KB
testcase_33	AC	288 ms; 48,768 KB

ソースコード

# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
template<class T> bool is_sqare(T a) { if(floor(sqrt(a)) * floor(sqrt(a)) == a){ return true; }return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define exists(c, e)         ((c).find(e) != (c).end())
#ifdef LOCAL
#  include "_debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

template <std::uint_fast64_t Modulus> class modint {
	using u64 = std::uint_fast64_t;
public:
	u64 a;
	constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
	constexpr u64 &value() noexcept { return a; }
	constexpr const u64 &value() const noexcept { return a; }
	constexpr modint operator+(const modint rhs) const noexcept {
		return modint(*this) += rhs;
	}
	constexpr modint operator-(const modint rhs) const noexcept {
		return modint(*this) -= rhs;
	}
	constexpr modint operator*(const modint rhs) const noexcept {
    	return modint(*this) *= rhs;
	}
	constexpr modint operator/(const modint rhs) const noexcept {
		return modint(*this) /= rhs;
	}
	constexpr modint &operator+=(const modint rhs) noexcept {
		a += rhs.a;
		if (a >= Modulus) {
			a -= Modulus;
		}
    	return *this;
	}
	constexpr modint &operator-=(const modint rhs) noexcept {
		if (a < rhs.a) {
			a += Modulus;
		}
		a -= rhs.a;
		return *this;
	}
	constexpr modint &operator*=(const modint rhs) noexcept {
    	a = a * rhs.a % Modulus;
    	return *this;
	}
	constexpr modint &operator/=(modint rhs) noexcept {
		u64 exp = Modulus - 2;
		while (exp) {
			if (exp % 2) {
				*this *= rhs;
			}
			rhs *= rhs;
			exp /= 2;
		}
    	return *this;
	}

    friend std::ostream& operator<<(std::ostream& os, const modint& rhs) {
        os << rhs.a;
        return os;
    }
};

using mint = modint<998244353>;

void solve(){
	int n, m, k;
	cin >> n >> m >> k;
	
	vector<vector<int>> g(n);
	rep(i, m){
		int a, b;
		cin >> a >> b;
		a--, b--;
		g[a].pb(b);
		g[b].pb(a);
	}

	vector<int> kth_pow(n+1);
	kth_pow[0] = 1;
	for(int i = 1;i <= n;i++)kth_pow[i] = kth_pow[i-1]*(k+1);

	vector dp(kth_pow[n], vector(n, mint(0)));
	rep(i, n)dp[kth_pow[i]][i] = 1;

	auto kth_num = [&](int x, int y) -> int {
		while(y--){
			x /= (k+1);
		}
		return x%(k+1);
	};

	rep(subset, kth_pow[n]){
		rep(i, n){
			for(auto to : g[i]){
				if(kth_num(subset, to) == k)continue;
				dp[subset + kth_pow[to]][to] += dp[subset][i];
			}
		}
	}
	mint ans = 0;
	rep(i, n)ans += dp[kth_pow[n]-1][i];
	cout << ans << endl;
}

int main(){
    int t = 1;
    //cin >> t;
    while(t--)solve();
}