結果
問題 | No.2733 Just K-times TSP |
ユーザー |
👑 ![]() |
提出日時 | 2024-03-25 23:18:09 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 204 ms / 2,000 ms |
コード長 | 4,061 bytes |
コンパイル時間 | 20,139 ms |
コンパイル使用メモリ | 263,852 KB |
最終ジャッジ日時 | 2025-02-20 13:50:04 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 32 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>// using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}vector<ll> n_adic(ll i, ll n, ll N) {ll x = 1;rep(j, N) { x *= n; }vector<ll> vec(N);rep(j, N) {x /= n;vec[j] = i / x;i -= x * vec[j];}return vec;}int main() {ll N, M, K;cin >> N >> M >> K;vector<ll> u(M);vector<ll> v(M);for (ll i = 0; i < M; i++) {cin >> u[i] >> v[i];u[i]--;v[i]--;}vector<vector<ll>> graph(N, vector<ll>(N, 0));for (ll i = 0; i < M; i++) {graph[u[i]][v[i]] = 1;graph[v[i]][u[i]] = 1;}ll now = 1;for (ll i = 0; i < N; i++) {now = (now * (K + 1));}vector<ll> pow_k(N);pow_k[0] = 1;for (ll i = 0; i < N - 1; i++) {pow_k[i + 1] = pow_k[i] * (K + 1);}vector<vector<ll>> dp(now, vector<ll>(N));for (ll i = 0; i < N; i++) {dp[pow_k[i]][i] = 1;}for (ll i = 1; i < now; i++) {vector<ll> adic = n_adic(i, K + 1, N);reverse(all(adic));for (ll j = 0; j < N; j++) {for (ll k = 0; k < N; k++) {if (graph[j][k]) {if (adic[k] < K) {dp[i + pow_k[k]][k] =(dp[i + pow_k[k]][k] + dp[i][j]) % mod2;}}}}}// debug(dp);ll ans = 0;for (ll i = 0; i < N; i++) {ans = (ans + dp[now - 1][i]) % mod2;}cout << ans << endl;}