結果
問題 | No.1392 Don't be together |
ユーザー | hitonanode |
提出日時 | 2021-02-12 22:58:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,883 ms / 2,000 ms |
コード長 | 11,057 bytes |
コンパイル時間 | 2,567 ms |
コンパイル使用メモリ | 216,056 KB |
最終ジャッジ日時 | 2025-01-18 19:33:35 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 18 ms
13,636 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 569 ms
101,248 KB |
testcase_07 | AC | 154 ms
117,648 KB |
testcase_08 | AC | 1,862 ms
117,660 KB |
testcase_09 | AC | 541 ms
101,248 KB |
testcase_10 | AC | 1,268 ms
117,780 KB |
testcase_11 | AC | 1,480 ms
103,312 KB |
testcase_12 | AC | 1,453 ms
117,524 KB |
testcase_13 | AC | 1,443 ms
117,648 KB |
testcase_14 | AC | 981 ms
117,648 KB |
testcase_15 | AC | 521 ms
117,648 KB |
testcase_16 | AC | 1,883 ms
117,644 KB |
testcase_17 | AC | 1,144 ms
117,652 KB |
testcase_18 | AC | 1,525 ms
117,520 KB |
testcase_19 | AC | 1,051 ms
117,520 KB |
testcase_20 | AC | 203 ms
49,820 KB |
testcase_21 | AC | 97 ms
29,516 KB |
testcase_22 | AC | 855 ms
86,068 KB |
testcase_23 | AC | 507 ms
51,488 KB |
testcase_24 | AC | 125 ms
55,328 KB |
testcase_25 | AC | 749 ms
64,296 KB |
testcase_26 | AC | 133 ms
22,732 KB |
testcase_27 | AC | 494 ms
48,156 KB |
testcase_28 | AC | 559 ms
41,344 KB |
testcase_29 | AC | 347 ms
39,144 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template <typename T, typename V>void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end());return vec; }template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']';return os; }#if __cplusplus >= 201703Ltemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); returnis; }template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);},tpl); return os; }#endiftemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ',';os << '}'; return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')';return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp)os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCALconst string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET <<endl#else#define dbg(x) (x)#endiftemplate <int mod> struct ModInt {#if __cplusplus >= 201402L#define MDCONST constexpr#else#define MDCONST#endifusing lint = long long;MDCONST static int get_mod() { return mod; }static int get_primitive_root() {static int primitive_root = 0;if (!primitive_root) {primitive_root = [&]() {std::set<int> fac;int v = mod - 1;for (lint i = 2; i * i <= v; i++)while (v % i == 0) fac.insert(i), v /= i;if (v > 1) fac.insert(v);for (int g = 1; g < mod; g++) {bool ok = true;for (auto i : fac)if (ModInt(g).pow((mod - 1) / i) == 1) {ok = false;break;}if (ok) return g;}return -1;}();}return primitive_root;}int val;MDCONST ModInt() : val(0) {}MDCONST ModInt &_setval(lint v) { return val = (v >= mod ? v - mod : v), *this; }MDCONST ModInt(lint v) { _setval(v % mod + mod); }MDCONST explicit operator bool() const { return val != 0; }MDCONST ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); }MDCONST ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); }MDCONST ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); }MDCONST ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); }MDCONST ModInt operator-() const { return ModInt()._setval(mod - val); }MDCONST ModInt &operator+=(const ModInt &x) { return *this = *this + x; }MDCONST ModInt &operator-=(const ModInt &x) { return *this = *this - x; }MDCONST ModInt &operator*=(const ModInt &x) { return *this = *this * x; }MDCONST ModInt &operator/=(const ModInt &x) { return *this = *this / x; }friend MDCONST ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); }friend MDCONST ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); }friend MDCONST ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); }friend MDCONST ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); }MDCONST bool operator==(const ModInt &x) const { return val == x.val; }MDCONST bool operator!=(const ModInt &x) const { return val != x.val; }MDCONST bool operator<(const ModInt &x) const { return val < x.val; } // To use std::map<ModInt, T>friend std::istream &operator>>(std::istream &is, ModInt &x) {lint t;return is >> t, x = ModInt(t), is;}MDCONST friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { return os << x.val; }MDCONST ModInt pow(lint n) const {lint ans = 1, tmp = this->val;while (n) {if (n & 1) ans = ans * tmp % mod;tmp = tmp * tmp % mod, n /= 2;}return ans;}static std::vector<long long> facs, invs;MDCONST static void _precalculation(int N) {int l0 = facs.size();if (N <= l0) return;facs.resize(N), invs.resize(N);for (int i = l0; i < N; i++) facs[i] = facs[i - 1] * i % mod;long long facinv = ModInt(facs.back()).pow(mod - 2).val;for (int i = N - 1; i >= l0; i--) {invs[i] = facinv * facs[i - 1] % mod;facinv = facinv * i % mod;}}MDCONST lint inv() const {if (this->val < 1 << 20) {while (this->val >= int(facs.size())) _precalculation(facs.size() * 2);return invs[this->val];} else {return this->pow(mod - 2).val;}}MDCONST ModInt fac() const {while (this->val >= int(facs.size())) _precalculation(facs.size() * 2);return facs[this->val];}MDCONST ModInt doublefac() const {lint k = (this->val + 1) / 2;return (this->val & 1) ? ModInt(k * 2).fac() / (ModInt(2).pow(k) * ModInt(k).fac()) : ModInt(k).fac() * ModInt(2).pow(k);}MDCONST ModInt nCr(const ModInt &r) const { return (this->val < r.val) ? 0 : this->fac() / ((*this - r).fac() * r.fac()); }ModInt sqrt() const {if (val == 0) return 0;if (mod == 2) return val;if (pow((mod - 1) / 2) != 1) return 0;ModInt b = 1;while (b.pow((mod - 1) / 2) == 1) b += 1;int e = 0, m = mod - 1;while (m % 2 == 0) m >>= 1, e++;ModInt x = pow((m - 1) / 2), y = (*this) * x * x;x *= (*this);ModInt z = b.pow(m);while (y != 1) {int j = 0;ModInt t = y;while (t != 1) j++, t *= t;z = z.pow(1LL << (e - j - 1));x *= z, z *= z, y *= z;e = j;}return ModInt(std::min(x.val, mod - x.val));}};template <int mod> std::vector<long long> ModInt<mod>::facs = {1};template <int mod> std::vector<long long> ModInt<mod>::invs = {0};using mint = ModInt<998244353>;// UnionFind Tree (0-indexed), based on size of each disjoint setstruct UnionFind {std::vector<int> par, cou;UnionFind(int N = 0) : par(N), cou(N, 1) { iota(par.begin(), par.end(), 0); }int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }bool unite(int x, int y) {x = find(x), y = find(y);if (x == y) return false;if (cou[x] < cou[y]) std::swap(x, y);par[y] = x, cou[x] += cou[y];return true;}int count(int x) { return cou[find(x)]; }bool same(int x, int y) { return find(x) == find(y); }};int main() {int N, M;cin >> N >> M;UnionFind uf(N);REP(i, N) {int p;cin >> p;uf.unite(i, p - 1);}vector<int> roots;REP(i, N) roots.push_back(uf.find(i));roots = sort_unique(roots);vector<mint> dp(N + 3);dp[0] = 1;vector<int> szz;for (auto r : roots) szz.push_back(uf.count(r));sort(szz.begin(), szz.end());int stot = 0;for (auto sz : szz) {IREP(i, stot + 1) {REP(b, sz + 1) {unsigned j = i + max(sz - b, 1);dp[j] += dp[i] * mint(sz).nCr(b) * (b % 2 ? -1 : 1);}dp[i] = 0;}stot += sz;}mint ret = 0;vector divs(N + 1, vector<mint>(N + 1));REP(i, N + 1) divs[i][1] = 1;FOR(n, 1, N + 1) FOR(m, 2, n + 1) {divs[n][m] = divs[n - 1][m - 1] + divs[n - 1][m] * m;}FOR(m, M, N + 1) {ret += divs[m][M] * dp[m];}cout << ret << '\n';}