結果

問題 No.2485 Add to Variables (Another)
ユーザー KudeKude
提出日時 2023-09-23 00:26:02
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 104 ms / 2,000 ms
コード長 2,468 bytes
コンパイル時間 3,618 ms
コンパイル使用メモリ 283,744 KB
実行使用メモリ 11,340 KB
最終ジャッジ日時 2024-07-16 00:58:44
合計ジャッジ時間 6,520 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 39
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:49:6: warning: '{anonymous}::mint {anonymous}::perm(int, int)' defined but not used [-Wunused-function]
   49 | mint perm(int n, int k) {
      |      ^~~~
main.cpp:48:6: warning: '{anonymous}::mint {anonymous}::fact(int)' defined but not used [-Wunused-function]
   48 | mint fact(int n) {return Fact[n];}
      |      ^~~~
main.cpp:44:6: warning: '{anonymous}::mint {anonymous}::icomb(int, int)' defined but not used [-Wunused-function]
   44 | mint icomb(int n, int k) {
      |      ^~~~~
main.cpp:37:6: warning: '{anonymous}::mint {anonymous}::comb(int, int)' defined but not used [-Wunused-function]
   37 | mint comb(int n, int k) {
      |      ^~~~

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;
constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
Fact[0] = mint::raw(1);
for(int i = 1; i <= FACT_SIZE; ++i) {
Fact[i] = Fact[i-1] * i;
}
iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
for(int i = FACT_SIZE; i; --i) {
iFact[i-1] = iFact[i] * i;
}
return false;
}();
mint comb(int n, int k) {
if (k == 0) return mint::raw(1);
assert(n >= 0 && k >= 0);
if (k > n) return mint::raw(0);
return Fact[n] * iFact[n - k] * iFact[k];
}
mint icomb(int n, int k) {
return iFact[n] * Fact[n - k] * Fact[k];
}
mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
assert(0 <= n);
return Fact[n] * iFact[n - k];
}
} int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
VI a(n);
rep(i, n) cin >> a[i];
VI b(n);
int rest = m;
rep(i, n - 1) {
if (a[i] < a[i+1]) {
int d = a[i+1] - a[i];
b[i+1] += d;
rest -= d;
} else {
int d = a[i] - a[i+1];
b[0] += d;
b[i+1] -= d;
rest -= d;
}
}
rep(i, n - 1) b[i+1] += b[i];
if (b[0] > a[0]) {
cout << 0 << '\n';
return 0;
}
int T = a[0] - b[0];
vector<mint> f(m + 1);
f[0] = 1;
rep(i, n - 1) {
int d = abs(a[i+1] - a[i]);
vector<mint> g(m + 1);
rep(i, m + 1) g[i] = iFact[i] * iFact[d + i];
f = convolution(f, g);
f.resize(m + 1);
}
mint ans;
rep(i, m + 1) {
int r = rest - 2 * i;
if (r < 0) break;
int todo = T - i;
int emp = r - todo;
if (todo >= 0 && emp >= 0) {
ans += f[i] * iFact[todo] * iFact[emp];
}
}
ans *= Fact[m];
cout << ans.val() << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0