結果
問題 | No.2485 Add to Variables (Another) |
ユーザー |
|
提出日時 | 2023-09-22 22:56:09 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,162 ms / 2,000 ms |
コード長 | 2,831 bytes |
コンパイル時間 | 4,472 ms |
コンパイル使用メモリ | 268,040 KB |
最終ジャッジ日時 | 2025-02-17 01:00:13 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 39 |
ソースコード
#include <bits/stdc++.h>using namespace std;#include <atcoder/all>#include <time.h>using namespace atcoder;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;#define all(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll modPow(long long a, long long n, long long p) {if (n == 0) return 1; // 0乗にも対応する場合if (n == 1) return a % p;if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;long long t = modPow(a, n / 2, p);return (t * t) % p;}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}using mint = modint998244353;using vm = vector<mint>;using vvm = vector<vm>;using vvvm = vector<vvm>;vector<mint> fact, factinv, inv;const ll mod = 998244353;void prenCkModp(ll n) {fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact[0] = fact[1] = 1;factinv[0] = factinv[1] = 1;inv[1] = 1;for (ll i = 2; i < n + 5; i++) {fact[i] = (fact[i - 1] * i);inv[i] = (mod - ((inv[mod % i] * (mod / i))));factinv[i] = (factinv[i - 1] * inv[i]);}}mint nCk(ll n, ll k) {if (n < k || k < 0) return 0;return (fact[n] * ((factinv[k] * factinv[n - k])));}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll N,M;cin>>N>>M;vll B(N);rep(i,N)cin>>B[i];vvm P(N,vm(M+1,0));prenCkModp(M+10);rep(i,N){ll d;if(i==0)d=M-B[0]-B[N-1];else d=B[i-1]-B[i];for(ll a=0;a<=M;a++){ll b=a+d;if(0<=b&&b<=M&&0<=a+b&&a+b<=M){P[i][a+b]+=factinv[a]*factinv[b];}}}queue<vm> Q;rep(i,N)Q.push(P[i]);while(Q.size()>1){auto D=Q.front();Q.pop();auto E=Q.front();Q.pop();auto DE=convolution(D,E);DE.resize(M+1);Q.push(convolution(D,E));}auto D=Q.front();D[M]*=fact[M];cout<<D[M].val()<<endl;}