結果

問題 No.2303 Frog on Grid
ユーザー noya2noya2
提出日時 2023-05-12 22:24:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 61 ms / 2,000 ms
コード長 6,104 bytes
コンパイル時間 5,105 ms
コンパイル使用メモリ 275,448 KB
実行使用メモリ 14,860 KB
最終ジャッジ日時 2024-11-28 18:53:48
合計ジャッジ時間 6,886 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
7,264 KB
testcase_01 AC 10 ms
7,140 KB
testcase_02 AC 52 ms
12,772 KB
testcase_03 AC 30 ms
9,696 KB
testcase_04 AC 51 ms
12,648 KB
testcase_05 AC 53 ms
13,156 KB
testcase_06 AC 30 ms
9,700 KB
testcase_07 AC 51 ms
12,644 KB
testcase_08 AC 51 ms
12,644 KB
testcase_09 AC 20 ms
8,036 KB
testcase_10 AC 29 ms
9,444 KB
testcase_11 AC 20 ms
8,036 KB
testcase_12 AC 31 ms
10,084 KB
testcase_13 AC 10 ms
7,268 KB
testcase_14 AC 11 ms
7,152 KB
testcase_15 AC 10 ms
7,268 KB
testcase_16 AC 11 ms
7,268 KB
testcase_17 AC 11 ms
7,140 KB
testcase_18 AC 61 ms
14,732 KB
testcase_19 AC 61 ms
14,608 KB
testcase_20 AC 61 ms
14,604 KB
testcase_21 AC 60 ms
14,860 KB
testcase_22 AC 61 ms
14,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "c.cpp"
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,m,n) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}

#line 2 "binom.hpp"

#line 4 "binom.hpp"

namespace noya2{

template<typename T>
struct Binom{
    Binom(int lim = 300000){ extend(lim); }
    static T fact(int x) {
        if (x < 0) return T(0);
        extend(x);
        return kaijo[x];
    }
    static T ifact(int x){
        if (x < 0) return T(0);
        extend(x);
        return kainv[x];
    }
    static T C(int n, int r){
        if (n < 0 || n < r || r < 0) return T(0);
        extend(n);
        return kaijo[n] * kainv[r] * kainv[n-r];
    }
    static T P(int n, int r){
        if (n < 0 || n < r || r < 0) return T(0);
        extend(n);
        return kaijo[n] * kainv[n-r];
    }
    static T H(int n, int r){
        if (n < 0 || r < 0) return T(0);
        return (r == 0 ? T(1) : C(n+r-1,r-1));
    }
    static T Inv(int n){
        assert(0 < n);
        return ifact(n) * fact(n-1);
    }
    T operator()(int n, int r){ return C(n,r); }
    template<class... Cnts> static T M(const Cnts&... cnts){
        return multinomial(0,T(1),cnts...);
    }
  private:
    static T multinomial(const int& sum, const T& div_prod){
        if (sum < 0) return T(0);
        return fact(sum) * div_prod;
    }
    template<class... Tail> static T multinomial(const int& sum, const T& div_prod, const int& n1, const Tail&... tail){
        if (n1 < 0) return T(0);
        return multinomial(sum+n1,div_prod*ifact(n1),tail...);
    }
    static std::vector<T> kaijo, kainv;
    static void extend(int lim){
        if (kaijo.empty()){
            kaijo = {1,1};
            kainv = {1,1};
        }
        int siz = kaijo.size();
        if (siz > lim) return ;
        int nsiz = siz * 2;
        kaijo.resize(nsiz+1), kainv.resize(nsiz+1);
        for (int i = siz; i <= nsiz; i++) kaijo[i] = kaijo[i-1] * T(i);
        kainv[nsiz] = kaijo[nsiz].inv();
        for (int i = nsiz-1; i >= siz; i--) kainv[i] = kainv[i+1] * T(i+1);
        extend(lim);
    }
};
template<typename T>
std::vector<T>Binom<T>::kaijo = vector<T>(2,T(1));
template<typename T>
std::vector<T>Binom<T>::kainv = vector<T>(2,T(1));

} // namespace noya2
#line 77 "c.cpp"

void solve(){
    int h, w; cin >> h >> w;
    Binom<mint> bnm;
    vector<mint> f(h+1,0), g(w+1,0);
    for (int i = (h+1)/2; i <= h; i++){
        f[i] = bnm.ifact(i) * bnm(i,h-i);
    }
    for (int j = (w+1)/2; j <= w; j++){
        g[j] = bnm.ifact(j) * bnm(j,w-j);
    }
    vector<mint> fg = convolution(f,g);
    mint ans = 0;
    int siz = fg.size();
    rep(i,siz) ans += fg[i] * bnm.fact(i);
    out(ans);
}

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
}
0