結果
問題 | No.1771 A DELETEQ |
ユーザー |
![]() |
提出日時 | 2022-01-19 05:00:13 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 251 ms / 3,500 ms |
コード長 | 2,987 bytes |
コンパイル時間 | 2,140 ms |
コンパイル使用メモリ | 200,660 KB |
最終ジャッジ日時 | 2025-01-27 13:03:35 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 WA * 12 |
ソースコード
#include <bits/stdc++.h>using namespace std;struct iofast_t {iofast_t() {ios::sync_with_stdio(false);cin.tie(nullptr);}} iofast;struct uns_t {} uns;template <typename Element, typename Head, typename ...Args>auto vec(Element init, Head arg, Args ...args) {if constexpr (sizeof...(Args) == 0) return vector(arg, init);else return vector(arg, vec(init, args...));}template <typename Element, typename Head, typename ...Args>auto vec(uns_t, Head arg, Args ...args) {return vec(Element(), arg, args...);}template <typename Container>auto distance(const Container &c, decltype(begin(c)) iter) {return distance(begin(c), iter);}template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>auto isort(RIter first, RIter last, Compare comp = Compare()) {vector<int> i(distance(first, last));iota(begin(i), end(i), 0);sort(begin(i), end(i), [&](auto x, auto y) {return comp(*(first + x), *(first + y));});return i;}template <typename, template <typename> typename, typename = void_t<>>struct detect : false_type {};template <typename T, template <typename> typename Check>struct detect<T, Check, void_t<Check<T>>> : true_type {};template <typename T, template <typename> typename Check>constexpr inline bool detect_v = detect<T, Check>::value;template <typename T>using has_member_sort = decltype(declval<T>().sort());template <typename Container, typename Compare = less<typename Container::value_type>>auto sorted(Container c, Compare comp = Compare()) {if constexpr (detect_v<Container, has_member_sort>) {c.sort(comp);return c;}else {sort(begin(c), end(c), comp);return c;}}template <typename Container, typename Compare = equal_to<typename Container::value_type>>auto uniqued(Container c, Compare comp = Compare()) {c.erase(unique(begin(c), end(c), comp), end(c));return c;}template <typename T, typename Compare = less<T>>T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }template <typename T, typename Compare = less<T>>T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }#include <atcoder/modint>using mint = atcoder::modint998244353;int main() {constexpr auto lim = 4000;int x, y; cin >> x >> y;if (lim < max(x, y)) {return 0;}auto dp = vec<mint>(0, x + 1, y + 1);dp[0][0] = 1;for (int i = 0; i <= x; ++i) {for (int j = 0; j <= y; ++j) {if (0 <= i - 1) {dp[i][j] += dp[i - 1][j];}if (0 <= j - 1) {dp[i][j] += dp[i][j - 1];}if (0 <= min(i - 1, j - 1)) {dp[i][j] += 2 * dp[i - 1][j - 1];if (i == j) {dp[i][j] += 1;}}}}cout << dp[x][y].val() << endl;}