結果

問題 No.2733 Just K-times TSP
ユーザー umimel
提出日時 2024-04-24 23:24:17
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 2,921 bytes
コンパイル時間 4,464 ms
コンパイル使用メモリ 243,944 KB
実行使用メモリ 120,804 KB
最終ジャッジ日時 2024-11-07 08:41:03
合計ジャッジ時間 12,699 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 31 TLE * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;
template<typename T>
struct edge{
int from, to;
T cost;
int id;
edge(){}
edge(int to, T cost=1) : from(-1), to(to), cost(cost){}
edge(int to, T cost, int id) : from(-1), to(to), cost(cost), id(id){}
edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id){}
};
template<typename T>
struct redge{
int from, to;
T cap, cost;
int rev;
redge(int to, T cap, T cost=(T)(1)) : from(-1), to(to), cap(cap), cost(cost){}
redge(int to, T cap, T cost, int rev) : from(-1), to(to), cap(cap), cost(cost), rev(rev){}
};
template<typename T> using Edges = vector<edge<T>>;
template<typename T> using weighted_graph = vector<Edges<T>>;
template<typename T> using tree = vector<Edges<T>>;
using unweighted_graph = vector<vector<int>>;
template<typename T> using residual_graph = vector<vector<redge<T>>>;
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
int vec_to_int(vector<int> &vec){
int v = 0;
for(int x : vec) v = 10*v + x;
return v;
}
void solve(){
int n, m, k; cin >> n >> m >> k;
unordered_map<int, mint> dp;
unweighted_graph G(n);
for(int i=0; i<m; i++){
int u, v; cin >> u >> v;
u--; v--;
G[u].pb(v);
G[v].pb(u);
}
vector<bool> check(1e7, false);
vector<int> idx(n, 0);
queue<vector<int>> Q;
for(int v=0; v<n; v++){
idx.pb(v);
idx[v] = 1;
int tmp = vec_to_int(idx);
dp[tmp] = 1;
Q.push(idx);
check[tmp]=true;
idx[v] = 0;
idx.pop_back();
}
while(!Q.empty()){
vector<int> idx = Q.front();
Q.pop();
mint value = dp[vec_to_int(idx)];
int v = idx.back();
for(int to : G[v]) if(idx[to]<k){
idx.back() = to;
idx[to]++;
int tmp = vec_to_int(idx);
dp[tmp] += value;
if(!check[tmp]) Q.push(idx);
check[tmp] = true;
idx.back() = v;
idx[to]--;
}
}
mint ans = 0;
for(int v=0; v<n; v++) idx[v] = k;
for(int v=0; v<n; v++){
idx.pb(v);
ans += dp[vec_to_int(idx)];
idx.pop_back();
}
cout << ans.val() << '\n';
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int T=1;
//cin >> T;
while(T--) solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0