結果
問題 | No.2485 Add to Variables (Another) |
ユーザー |
|
提出日時 | 2023-09-23 01:39:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 107 ms / 2,000 ms |
コード長 | 10,197 bytes |
コンパイル時間 | 4,834 ms |
コンパイル使用メモリ | 266,804 KB |
最終ジャッジ日時 | 2025-02-17 01:15:32 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 39 |
ソースコード
#ifndef HIDDEN_IN_VS // 折りたたみ用// 警告の抑制#define _CRT_SECURE_NO_WARNINGS// ライブラリの読み込み#include <bits/stdc++.h>using namespace std;// 型名の短縮using ll = long long; // -2^63 ~ 2^63 = 9 * 10^18(int は -2^31 ~ 2^31 = 2 * 10^9)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; using ull = unsigned long long;// 定数の定義const double PI = acos(-1);const vi DX = { 1, 0, -1, 0 }; // 4 近傍(下,右,上,左)const vi DY = { 0, 1, 0, -1 };int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;double EPS = 1e-15;// 入出力高速化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 < (1 << int(d)); ++set) // d ビット全探索(昇順)#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て(昇順)#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod#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 pow(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 get(T set, int i) { return (set >> i) & T(1); }// 演算子オーバーロード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 = 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>;#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) : -1; }inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }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; }inline int msb(__int128 n) { return (n >> 64) != 0 ? (127 - __builtin_clzll((ll)(n >> 64))) : n != 0 ? (63 - __builtin_clzll((ll)(n))) : -1; }#define gcd __gcd#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)) while (1) cout << "OLE"; }#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 mul(vi rs) : O(|rs|)* 多項係数 nC[rs] を返す.(n = Σrs)*/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://atcoder.jp/contests/abc034/tasks/abc034_cAssert(n <= n_max);if (r < 0 || n - r < 0) return 0;return fac[n] * fac_inv[r] * fac_inv[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;}};Factorial_mint fm((int)1e6);// 最小値を跨げないと思い込んでいた.全然そんなことないのに驚きの 1WA.void WA() {int n, m;cin >> n >> m;vi b(n);cin >> b;if (b == vi{ 0, 0, 0, 0 }) EXIT(1);int i_min = -1, b_min = INF;rep(i, n) if (chmin(b_min, b[i])) i_min = i;if (i_min >= 2) {reverse(all(b));i_min = n - 1 - i_min;}if (i_min == 1) {int c1 = b[0] - b_min;int c6 = b[2] - b_min;int c7 = b[3] - b[2];if (c7 < 0) EXIT(0);int c0 = 0, c4 = 0;int r = m - c1 - c6 - c7;if (r < 0) EXIT(0);if (r > b_min * 2) {c0 += r - b_min * 2;}else if (r < b_min * 2) {// r - c4 = (b_min - c4) * 2;c4 += b_min * 2 - r;if (c4 < 0) EXIT(0);b_min -= c4;if (b_min < 0) EXIT(0);}dump(c0, c1, 0, 0, c4, 0, c6, c7);vm x(b_min + 1), y(b_min + 1), z(b_min + 1), w(b_min + 1);repi(i, 0, b_min) {x[i] = fm.fact_inv(c0 + i) * fm.fact_inv(c4 + i);y[i] = fm.fact_inv(c1 + i) * fm.fact_inv(i);z[i] = fm.fact_inv(i) * fm.fact_inv(c6 + i);w[i] = fm.fact_inv(i) * fm.fact_inv(c7 + i);}auto xy = convolution(x, y);auto zw = convolution(z, w);mint res = 0;repi(i, 0, b_min) res += xy[i] * zw[b_min - i];res *= fm.fact(m);cout << res << endl;}else {int c5 = b[1] - b_min;int c6 = b[2] - b[1];int c7 = b[3] - b[2];if (c6 < 0 || c7 < 0) EXIT(0);int c0 = 0, c4 = 0;int r = m - c5 - c6 - c7;if (r < 0) EXIT(0);if (r > b_min * 2) {c0 += r - b_min * 2;}else if (r < b_min * 2) {// r - c4 = (b_min - c4) * 2;c4 += b_min * 2 - r;if (c4 < 0) EXIT(0);b_min -= c4;if (b_min < 0) EXIT(0);}dump(c0, 0, 0, 0, c4, c5, c6, c7);vm x(b_min + 1), y(b_min + 1), z(b_min + 1), w(b_min + 1);repi(i, 0, b_min) {x[i] = fm.fact_inv(c0 + i) * fm.fact_inv(c4 + i);y[i] = fm.fact_inv(i) * fm.fact_inv(c5 + i);z[i] = fm.fact_inv(i) * fm.fact_inv(c6 + i);w[i] = fm.fact_inv(i) * fm.fact_inv(c7 + i);}auto xy = convolution(x, y);auto zw = convolution(z, w);mint res = 0;repi(i, 0, b_min) res += xy[i] * zw[b_min - i];res *= fm.fact(m);cout << res << endl;}}int main() {// input_from_file("input.txt");// output_to_file("output.txt");int n, m;cin >> n >> m;vi b(n);cin >> b;int K = m - b[n - 1];if (K < 0) EXIT(0);vm x(K + 1);repi(k, 0, K) x[k] = fm.fact_inv(k) * fm.fact_inv(b[0] + b[n - 1] - m + k);repi(i, 1, n - 1) {vm y(K + 1);repi(k, 0, K) y[k] = fm.fact_inv(k) * fm.fact_inv(b[i] - b[i - 1] + k);x = convolution(x, y);x.resize(K + 1);}mint res = x[K] * fm.fact(m);cout << res << endl;}