結果
問題 | No.1392 Don't be together |
ユーザー |
|
提出日時 | 2021-02-12 22:31:52 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 362 ms / 2,000 ms |
コード長 | 6,048 bytes |
コンパイル時間 | 1,905 ms |
コンパイル使用メモリ | 201,208 KB |
最終ジャッジ日時 | 2025-01-18 19:04:32 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
//@formatter:off#include<bits/stdc++.h>#define overload4(_1,_2,_3,_4,name,...) name#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define popcount(x) __builtin_popcount(x)#define pb push_back#define eb emplace_back#ifdef __LOCAL#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }#else#define debug(...) void(0)#endif#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)using namespace std;using ll = long long;using ld = long double;using P = pair<int,int>;using LP = pair<ll,ll>;using vi = vector<int>;using vvi = vector<vector<int>>;using vl = vector<ll>;using vvl = vector<vector<ll>>;using vd = vector<double>;using vvd = vector<vector<double>>;using vs = vector<string>;using vc = vector<char>;using vvc = vector<vector<char>>;using vb = vector<bool>;using vvb = vector<vector<bool>>;using vp = vector<P>;using vvp = vector<vector<P>>;template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']';}template<class T> void vecout(const vector<T> &v,char div='\n') { rep(i,v.size()) cout<<v[i]<<(i==int(v.size()-1)?'\n':div);}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;}void scan(){}template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }template<class T> void print(const T& t){ cout << t << '\n'; }template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }template<class... T> void fin(const T&... a) { print(a...); exit(0); }const string yes[] = {"no","yes"};const string Yes[] = {"No","Yes"};const string YES[] = {"NO","YES"};const int inf = 1001001001;const ll linf = 1001001001001001001;//@formatter:on//constexpr int mod = 1000000007;constexpr int mod = 998244353;struct mint {ll x;constexpr mint(ll x = 0) : x((x % mod + mod) % mod) {}constexpr mint operator-() const { return mint(-x); }constexpr mint &operator+=(const mint &a) {if ((x += a.x) >= mod) x -= mod;return *this;}constexpr mint &operator++() { return *this += mint(1); }constexpr mint &operator-=(const mint &a) {if ((x += mod - a.x) >= mod) x -= mod;return *this;}constexpr mint &operator--() { return *this -= mint(1); }constexpr mint &operator*=(const mint &a) {(x *= a.x) %= mod;return *this;}constexpr mint operator+(const mint &a) const {mint res(*this);return res += a;}constexpr mint operator-(const mint &a) const {mint res(*this);return res -= a;}constexpr mint operator*(const mint &a) const {mint res(*this);return res *= a;}constexpr mint pow(ll t) const {mint res = mint(1), a(*this);while (t > 0) {if (t & 1) res *= a;t >>= 1;a *= a;}return res;}// for prime modconstexpr mint inv() const { return pow(mod - 2); }constexpr mint &operator/=(const mint &a) { return *this *= a.inv(); }constexpr mint operator/(const mint &a) const {mint res(*this);return res /= a;}};ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }bool operator==(const mint &a, const mint &b) { return a.x == b.x; }bool operator!=(const mint &a, const mint &b) { return a.x != b.x; }bool operator==(const mint &a, const int &b) { return a.x == b; }bool operator!=(const mint &a, const int &b) { return a.x != b; }mint dp[5010][5010][2];int main() {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);INT(n, m);vi p(n);cin >> p;rep(i, n) p[i]--;vi ls;vb seen(n);rep(i, n) {if (seen[i]) continue;int cnt = 0;int now = i;do {cnt++;seen[now] = true;now = p[now];} while (now != i);ls.pb(cnt);}int t = 0;dp[0][0][0] = 1;for (int c : ls) {rep(j, m + 1) {mint now = dp[t][j][0];if (now.x == 0) continue;dp[t + 1][j][1] += now * j;if (j < m) dp[t + 1][j + 1][1] += now;}t++;rep(i, c - 1) {rep(j, m + 1) rep(k, 2) {mint now = dp[t][j][k];if (now.x == 0) continue;assert(j > 0);if (k) {dp[t + 1][j][0] += now * (j - 1);if (j < m) dp[t + 1][j + 1][0] += now;} else {dp[t + 1][j][1] += now;dp[t + 1][j][0] += now * (j - 2);if (j < m) dp[t + 1][j + 1][0] += now;}}t++;}}print(dp[n][m][0]);}