#915278 (C++23) No.2485 Add to Variables (Another)

• 問題: No.2485 Add to Variables (Another)
• ユーザー: Kude
• 提出日時: 2023-09-22 23:52:00
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,407 bytes
• コンパイル時間: 3,700 ms
• コンパイル使用メモリ: 285,068 KB
• 実行使用メモリ: 11,468 KB
• 最終ジャッジ日時: 2024-07-16 00:26:45
• 合計ジャッジ時間: 5,391 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	14 ms; 11,208 KB
testcase_01	AC	14 ms; 11,208 KB
testcase_02	AC	14 ms; 11,084 KB
testcase_03	AC	14 ms; 11,208 KB
testcase_04	AC	15 ms; 11,336 KB
testcase_05	WA	-
testcase_06	AC	15 ms; 11,080 KB
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	AC	14 ms; 11,208 KB
testcase_12	WA	-
testcase_13	AC	14 ms; 11,468 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	14 ms; 11,208 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	14 ms; 11,332 KB
testcase_20	WA	-
testcase_21	AC	14 ms; 11,208 KB
testcase_22	AC	14 ms; 11,208 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	AC	13 ms; 11,340 KB
testcase_43	WA	-

コンパイルメッセージ

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) {
      |      ^~~~

ソースコード

#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;
  const int m0 = m;
  VI a(n);
  rep(i, n) cin >> a[i];
  int imn = min_element(all(a)) - a.begin();
  if (![&]() ->bool {
    rrep(i, imn) if (a[i] < a[i+1]) return false;
    for(int i = imn + 1; i < n; i++) {
      if (a[i-1] > a[i]) return false;
    }
    return true;
  }()) {
    cout << 0 << '\n';
    return 0;
  }
  vector<mint> f{1};
  rep(i, n - 1) {
    int d = abs(a[i+1] - a[i]);
    m -= d;
    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 rest = m - 2 * i;
    if (rest < 0) break;
    int todo = a[imn] - i;
    int emp = rest - todo;
    if (todo >= 0 && emp >= 0) {
      ans += f[i] * iFact[todo] * iFact[emp];
    }
  }
  ans *= Fact[m0];
  cout << ans.val() << '\n';
}