結果
問題 | No.2839 AND Constraint |
ユーザー |
![]() |
提出日時 | 2024-08-05 00:30:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 304 ms / 2,000 ms |
コード長 | 4,290 bytes |
コンパイル時間 | 4,052 ms |
コンパイル使用メモリ | 254,164 KB |
最終ジャッジ日時 | 2025-02-23 21:01:56 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 16 |
ソースコード
#include <bits/stdc++.h>#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endifusing namespace std;// #include "boost/multiprecision/cpp_int.hpp"// using namespace boost::multiprecision;// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#define ll long long#define rep(i, n) for (ll i = 0; i < n; ++i)#define rep_up(i, a, n) for (ll i = a; i < n; ++i)#define rep_down(i, a, n) for (ll i = a; i >= n; --i)#define P pair<ll, ll>#define pb push_back#define bit_count(x) __builtin_popcountll(x)#define gcd(a, b) __gcd(a, b)#define lcm(a, b) a / gcd(a, b) * b// #define endl "\n"#define all(v) v.begin(), v.end()#define fi first#define se second#define vll vector<ll>#define vvll vector<vll>#define vvvll vector<vvll>#define vvvvll vector<vvvll>#define pqll priority_queue<ll>#define pqllg priority_queue<ll, vector<ll>, greater<ll>>template <class T>inline void vin(vector<T> &v) { rep(i, v.size()) cin >> v.at(i); }template <class T>using V = vector<T>;constexpr ll INF = (1ll << 60);// constexpr ll mod = 1000000007;constexpr ll mod = 998244353;// using mint = atcoder::modint;// using mint = atcoder::modint998244353;// using mint = atcoder::modint1000000007;#define vmint vector<mint>#define vvmint vector<vmint>#define vvvmint vector<vvmint>#define vvvvmint vector<vvvmint>constexpr double pi = 3.14159265358979323846;random_device seed_gen;mt19937 engine(seed_gen());template <typename T>inline bool chmax(T &a, T b){if (a < b){a = b;return 1;}return 0;}template <typename T>inline bool chmin(T &a, T b){if (a > b){a = b;return 1;}return 0;}template <typename T>void pt(T val){cout << val << "\n";}template <typename T>void pt_vll(vector<T> &v){ll vs = v.size();rep(i, vs){cout << v[i];if (i == vs - 1)cout << "\n";elsecout << " ";}}template <typename T>void pt_vmint(vector<T> &v){ll vs = v.size();rep(i, vs){cout << v[i].val();if (i == vs - 1)cout << "\n";elsecout << " ";}}ll mypow(ll a, ll n){ll ret = 1;if (n == 0)return 1;if (a == 0)return 0;rep(i, n){if (ret > (ll)(9e18 + 10) / a)return -1;ret *= a;}return ret;}long long modpow(long long a, long long n, long long mod){long long res = 1;while (n > 0){if (n & 1)res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}long long modinv(long long a, long long m){long long b = m, u = 1, v = 0;while (b){long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}u %= m;if (u < 0)u += m;return u;}void solve();// ここまでテンプレint main(){ios::sync_with_stdio(false);cin.tie(nullptr);// cout << fixed << setprecision(16);// ll T;// cin >> T;// rep(ca, T)solve();}const int MAX = 3010000;ll fac[MAX], finv[MAX], inv[MAX];// テーブルを作る前処理void COMinit(){fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (ll i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % mod;inv[i] = mod - inv[mod % i] * (mod / i) % mod;finv[i] = finv[i - 1] * inv[i] % mod;}}// 二項係数計算ll COM(ll n, ll k){if (n < k)return 0;if (n < 0 || k < 0)return 0;return fac[n] * (finv[k] * finv[n - k] % mod) % mod;}void solve(){ll n, m, k, cnt = 0, sum = 0, ans = 0;cin >> n >> m;assert(1 <= n && n <= 500);assert(1 <= m && m <= 500);vvll dp(n + 1, vll(m + 2));dp[0][1] = 1;COMinit();rep(i, n){rep(j, m + 2){rep(k, j + 1){if (j + k >= m + 2)continue;dp[i + 1][j + k] += dp[i][j] * COM(j, k);dp[i + 1][j + k] %= mod;}}}// pt_vll(dp[n]);pt(dp[n][m + 1]);}