結果

問題 No.2303 Frog on Grid
ユーザー sten_sansten_san
提出日時 2023-05-13 12:45:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 72 ms / 2,000 ms
コード長 3,373 bytes
コンパイル時間 4,188 ms
コンパイル使用メモリ 242,432 KB
実行使用メモリ 9,648 KB
最終ジャッジ日時 2024-05-06 20:07:01
合計ジャッジ時間 4,810 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 56 ms
8,472 KB
testcase_03 AC 28 ms
6,016 KB
testcase_04 AC 57 ms
8,228 KB
testcase_05 AC 67 ms
9,056 KB
testcase_06 AC 34 ms
6,144 KB
testcase_07 AC 61 ms
8,448 KB
testcase_08 AC 54 ms
8,312 KB
testcase_09 AC 16 ms
5,376 KB
testcase_10 AC 26 ms
5,760 KB
testcase_11 AC 16 ms
5,376 KB
testcase_12 AC 38 ms
6,784 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 1 ms
5,376 KB
testcase_15 AC 1 ms
5,376 KB
testcase_16 AC 1 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 72 ms
9,520 KB
testcase_19 AC 70 ms
9,520 KB
testcase_20 AC 69 ms
9,516 KB
testcase_21 AC 69 ms
9,648 KB
testcase_22 AC 69 ms
9,516 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#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); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/convolution>
#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    int h, w; cin >> h >> w;

    auto f = vec<mint>(uns, h + w + 1);
    auto g = vec<mint>(uns, h + w + 1);

    f[0] = g[0] = 1;
    for (int i = 1; i <= h + w; ++i) {
        f[i] = f[i - 1] * i;
        g[i] = 1 / f[i];
    }

    auto comb = [&](int n, int r) {
        return f[n] * g[r] * g[n - r];
    };

    auto y = vec<mint>(uns, h / 2 + 1);
    auto x = vec<mint>(uns, w / 2 + 1);

    for (int i = 0; i <= h / 2; ++i) {
        y[i] = g[i] * g[h - i - i];
    }
    for (int i = 0; i <= w / 2; ++i) {
        x[i] = g[i] * g[w - i - i];
    }

    auto z = atcoder::convolution(x, y);

    mint ans = 0;

    for (int i = 0; i <= h + w; ++i) {
        if (h + w - i < size(z)) {
            ans += f[i] * z[h + w - i];
        }
    }

    cout << ans.val() << endl;
}

0