結果
問題 | No.1392 Don't be together |
ユーザー |
![]() |
提出日時 | 2021-02-13 17:55:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 361 ms / 2,000 ms |
コード長 | 5,118 bytes |
コンパイル時間 | 1,988 ms |
コンパイル使用メモリ | 199,768 KB |
最終ジャッジ日時 | 2025-01-18 20:09:55 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
#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 LOCALvoid 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))#endiftemplate <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;}