結果
問題 | No.2898 Update Max |
ユーザー |
|
提出日時 | 2024-09-20 22:36:51 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 10,517 bytes |
コンパイル時間 | 6,797 ms |
コンパイル使用メモリ | 308,744 KB |
実行使用メモリ | 9,088 KB |
最終ジャッジ日時 | 2024-09-20 22:37:01 |
合計ジャッジ時間 | 8,927 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 WA * 9 |
ソースコード
// QCFium 法#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#ifndef HIDDEN_IN_VS // 折りたたみ用// 警告の抑制#define _CRT_SECURE_NO_WARNINGS// ライブラリの読み込み#include <bits/stdc++.h>using namespace std;// 型名の短縮using ll = long long; using ull = unsigned long long; // -2^63 ~ 2^63 = 9e18(int は -2^31 ~ 2^31 = 2e9)using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;using Graph = vvi;// 定数の定義const double PI = acos(-1);int DX[4] = { 1, 0, -1, 0 }; // 4 近傍(下,右,上,左)int DY[4] = { 0, 1, 0, -1 };int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;// 入出力高速化struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;// 汎用マクロの定義#define all(a) (a).begin(), (a).end()#define sz(x) ((int)(x).size())#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順#define repe(v, a) for(const auto& v : (a)) // a の全要素(変更不可能)#define repea(v, a) for(auto& v : (a)) // a の全要素(変更可能)#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索(昇順)#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素(昇順)#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て(昇順)#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定// 汎用関数の定義template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら trueを返す)template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら trueを返す)template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod// 演算子オーバーロードtemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }#endif // 折りたたみ用#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#ifdef _MSC_VER#include "localACL.hpp"#endif//using mint = modint1000000007;using mint = modint998244353;//using mint = static_modint<1234567891>;//using mint = modint; // mint::set_mod(m);namespace atcoder {inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }}using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;#endif#ifdef _MSC_VER // 手元環境(Visual Studio)#include "local.hpp"#else // 提出用(gcc)inline int popcount(int n) { return __builtin_popcount(n); }inline int popcount(ll n) { return __builtin_popcountll(n); }inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }template <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }#define dump(...)#define dumpel(v)#define dump_list(v)#define dump_mat(v)#define input_from_file(f)#define output_to_file(f)#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す#endif//【階乗など(法が大きな素数)】/** Factorial_mint(int N) : O(n)* N まで計算可能として初期化する.** mint fact(int n) : O(1)* n! を返す.** mint fact_inv(int n) : O(1)* 1/n! を返す(n が負なら 0 を返す)** mint inv(int n) : O(1)* 1/n を返す.** mint perm(int n, int r) : O(1)* 順列の数 nPr を返す.** mint bin(int n, int r) : O(1)* 二項係数 nCr を返す.** mint bin_inv(int n, int r) : O(1)* 二項係数の逆数 1/nCr を返す.** mint mul(vi rs) : O(|rs|)* 多項係数 nC[rs] を返す.(n = Σrs)** mint hom(int n, int r) : O(1)* 重複組合せの数 nHr = n+r-1Cr を返す(0H0 = 1 とする)** mint neg_bin(int n, int r) : O(1)* 負の二項係数 nCr = (-1)^r -n+r-1Cr を返す(n ≦ 0, r ≧ 0)*/class Factorial_mint {int n_max;// 階乗と階乗の逆数の値を保持するテーブルvm fac, fac_inv;public:// n! までの階乗とその逆数を前計算しておく.O(n)Factorial_mint(int n) : n_max(n), fac(n + 1), fac_inv(n + 1) {// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_bfac[0] = 1;repi(i, 1, n) fac[i] = fac[i - 1] * i;fac_inv[n] = fac[n].inv();repir(i, n - 1, 0) fac_inv[i] = fac_inv[i + 1] * (i + 1);}Factorial_mint() : n_max(0) {} // ダミー// n! を返す.mint fact(int n) const {// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_bAssert(0 <= n && n <= n_max);return fac[n];}// 1/n! を返す(n が負なら 0 を返す)mint fact_inv(int n) const {// verify : https://atcoder.jp/contests/abc289/tasks/abc289_hAssert(n <= n_max);if (n < 0) return 0;return fac_inv[n];}// 1/n を返す.mint inv(int n) const {// verify : https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_dAssert(0 < n && n <= n_max);return fac[n - 1] * fac_inv[n];}// 順列の数 nPr を返す.mint perm(int n, int r) const {// verify : https://atcoder.jp/contests/abc172/tasks/abc172_eAssert(n <= n_max);if (r < 0 || n - r < 0) return 0;return fac[n] * fac_inv[n - r];}// 二項係数 nCr を返す.mint bin(int n, int r) const {// verify : https://judge.yosupo.jp/problem/binomial_coefficient_prime_modAssert(n <= n_max);if (r < 0 || n - r < 0) return 0;return fac[n] * fac_inv[r] * fac_inv[n - r];}// 二項係数の逆数 1/nCr を返す.mint bin_inv(int n, int r) const {// verify : https://www.codechef.com/problems/RANDCOLORINGAssert(n <= n_max);Assert(r >= 0 || n - r >= 0);return fac_inv[n] * fac[r] * fac[n - r];}// 多項係数 nC[rs] を返す.mint mul(const vi& rs) const {// verify : https://yukicoder.me/problems/no/2141if (*min_element(all(rs)) < 0) return 0;int n = accumulate(all(rs), 0);Assert(n <= n_max);mint res = fac[n];repe(r, rs) res *= fac_inv[r];return res;}// 重複組合せの数 nHr = n+r-1Cr を返す(0H0 = 1 とする)mint hom(int n, int r) {// verify : https://mojacoder.app/users/riantkb/problems/toj_ex_2if (n == 0) return (int)(r == 0);Assert(n + r - 1 <= n_max);if (r < 0 || n - 1 < 0) return 0;return fac[n + r - 1] * fac_inv[r] * fac_inv[n - 1];}// 負の二項係数 nCr を返す(n ≦ 0, r ≧ 0)mint neg_bin(int n, int r) {// verify : https://atcoder.jp/contests/abc345/tasks/abc345_gif (n == 0) return (int)(r == 0);Assert(-n + r - 1 <= n_max);if (r < 0 || -n - 1 < 0) return 0;return (r & 1 ? -1 : 1) * fac[-n + r - 1] * fac_inv[r] * fac_inv[-n - 1];}};int main() {// input_from_file("input.txt");// output_to_file("output.txt");int n;cin >> n;vi a(n);cin >> a;--a;Factorial_mint fm(n);vi acc_open(n + 1);rep(i, n) acc_open[i + 1] = acc_open[i] + (a[i] == -2);vi rem(n, 1);rep(i, n) if (a[i] != -2) rem[a[i]] = 0;dump(rem);vi acc_rem(n + 1);rep(i, n) acc_rem[i + 1] = acc_rem[i] + rem[i];mint res = 0; int a_max = -1;vi t0(n + 1, n);repir(i, n - 1, 0) {if (rem[i]) {t0[i] = i;}else {t0[i] = t0[i + 1];}}dump(t0);rep(i, n) {mint p = 0;if (a[i] != -2) {if (a[i] > a_max) {p = fm.bin(acc_rem[a[i]], acc_open[i]) * fm.bin_inv(acc_open[n], acc_open[i]);}chmax(a_max, a[i]);}else {//int t00 = -1;//repi(x, a_max + 1, n - 1) {// if (!rem[x]) continue;// t00 = acc_rem[x];// break;// p += fm.bin(acc_rem[x], acc_open[i]) * fm.bin_inv(acc_open[n] - 1, acc_open[i]);//}//dump("a_max:", a_max, "t00:", t00);////repi(t, acc_rem[t0[a_max + 1]], acc_rem[n - 1]) {// p += fm.bin(t, acc_open[i]) * fm.bin_inv(acc_open[n] - 1, acc_open[i]);//}p += fm.bin(acc_rem[n - 1] + 1, acc_open[i] + 1) * fm.bin_inv(acc_open[n] - 1, acc_open[i]);p -= fm.bin(acc_rem[t0[a_max + 1]], acc_open[i] + 1) * fm.bin_inv(acc_open[n] - 1, acc_open[i]);p *= fm.inv(acc_rem[n]);}dump(p);res += p;}res *= fm.fact(acc_open[n]);EXIT(res);}