結果
問題 | No.1392 Don't be together |
ユーザー | satashun |
提出日時 | 2021-02-13 17:55:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 386 ms / 2,000 ms |
コード長 | 5,118 bytes |
コンパイル時間 | 1,894 ms |
コンパイル使用メモリ | 204,308 KB |
実行使用メモリ | 199,728 KB |
最終ジャッジ日時 | 2023-09-28 02:31:41 |
合計ジャッジ時間 | 9,156 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
199,708 KB |
testcase_01 | AC | 66 ms
199,580 KB |
testcase_02 | AC | 64 ms
199,640 KB |
testcase_03 | AC | 65 ms
199,572 KB |
testcase_04 | AC | 65 ms
199,420 KB |
testcase_05 | AC | 64 ms
199,452 KB |
testcase_06 | AC | 144 ms
199,488 KB |
testcase_07 | AC | 386 ms
199,528 KB |
testcase_08 | AC | 287 ms
199,488 KB |
testcase_09 | AC | 175 ms
199,476 KB |
testcase_10 | AC | 266 ms
199,448 KB |
testcase_11 | AC | 315 ms
199,448 KB |
testcase_12 | AC | 262 ms
199,452 KB |
testcase_13 | AC | 303 ms
199,524 KB |
testcase_14 | AC | 315 ms
199,540 KB |
testcase_15 | AC | 271 ms
199,528 KB |
testcase_16 | AC | 331 ms
199,728 KB |
testcase_17 | AC | 265 ms
199,484 KB |
testcase_18 | AC | 307 ms
199,444 KB |
testcase_19 | AC | 295 ms
199,440 KB |
testcase_20 | AC | 140 ms
199,588 KB |
testcase_21 | AC | 83 ms
199,408 KB |
testcase_22 | AC | 227 ms
199,420 KB |
testcase_23 | AC | 162 ms
199,532 KB |
testcase_24 | AC | 129 ms
199,468 KB |
testcase_25 | AC | 169 ms
199,504 KB |
testcase_26 | AC | 84 ms
199,596 KB |
testcase_27 | AC | 110 ms
199,464 KB |
testcase_28 | AC | 161 ms
199,504 KB |
testcase_29 | AC | 110 ms
199,472 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; } template <class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; } template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template <unsigned int MOD> struct ModInt { using uint = unsigned int; using ull = unsigned long long; using M = ModInt; uint v; ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); } M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD) v = (_v < MOD) ? _v : _v - MOD; return *this; } explicit operator bool() const { return v != 0; } explicit operator int() const { return v; } M operator+(const M& a) const { return M().set_norm(v + a.v); } M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); } M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); } M operator/(const M& a) const { return *this * a.inv(); } M& operator+=(const M& a) { return *this = *this + a; } M& operator-=(const M& a) { return *this = *this - a; } M& operator*=(const M& a) { return *this = *this * a; } M& operator/=(const M& a) { return *this = *this / a; } M operator-() const { return M() - *this; } M& operator++(int) { return *this = *this + 1; } M& operator--(int) { return *this = *this - 1; } M pow(ll n) const { if (n < 0) return inv().pow(-n); M x = *this, res = 1; while (n) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } M inv() const { ll a = v, b = MOD, p = 1, q = 0, t; while (b != 0) { t = a / b; swap(a -= t * b, b); swap(p -= t * q, q); } return M(p); } bool operator==(const M& a) const { return v == a.v; } bool operator!=(const M& a) const { return v != a.v; } friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; } friend istream& operator>>(istream& in, M& x) { ll v_; in >> v_; x = M(v_); return in; } static uint get_mod() { return MOD; } }; using Mint = ModInt<998244353>; Mint dp[5010][5010][2]; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int N, M; cin >> N >> M; V<int> P(N); rep(i, N) cin >> P[i], --P[i]; V<bool> used(N); int now = 0; dp[0][0][1] = 1; rep(i, N) { if (used[i]) continue; int v = i; int sz = 0; while (!used[v]) { sz++; used[v] = true; v = P[v]; } rep(j, now + 1) { if (j) dp[now + 1][j][0] += dp[now][j][1] * j; if (M - j > 0) dp[now + 1][j + 1][0] += dp[now][j][1]; } now++; rep(tt, sz - 1) { rep(j, now + 1) { rep(k, 2) { if (dp[now][j][k] == 0) continue; rep(l, 2) { if (tt == sz - 2 && l == 0) continue; if (k == l) { dp[now + 1][j][l] += dp[now][j][k] * (k ? max(j - 2, 0) : 0); if (l && M - j > 0) { dp[now + 1][j + 1][l] += dp[now][j][k]; } } else { dp[now + 1][j][l] += dp[now][j][k] * (l ? j - 1 : 1); if (l && M - j > 0) { dp[now + 1][j + 1][l] += dp[now][j][k]; } } } } } now++; } debug(sz, now); } cout << dp[N][M][1] << endl; return 0; }