提出 #64180799

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;
int Add(int x, int y){ return (x + y) >= mod ? (x + y - mod) : (x + y); }
int Sub(int x, int y){ return (x - y) < 0 ? (x - y + mod) : (x - y); }
int Mul(int x, int y){ return 1ll * x * y % mod; }

const int N = 1e6 + 5;
int n, m, L1, R1, L2, R2, fact[N << 1], inv[N << 1];

int binom(int n, int m){ return n < m ? 0 : Mul(fact[n], Mul(inv[m], inv[n - m])); }

int F(int n, int m){ return Sub(binom(n + m + 2, n + 1), 1); }
int G(int n, int m){ return Sub(binom(n + m + 4, n + 2), Add(Mul(n + 2, m + 2), 1)); }

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> m >> L1 >> R1 >> L2 >> R2;
    fact[0] = inv[0] = fact[1] = inv[1] = 1;
    for(int i=2;i<=(n+m+4);i++){
        fact[i] = Mul(fact[i - 1], i);
        inv[i] = Mul(inv[mod % i], mod - mod / i);
    }
    for(int i=1;i<=(n+m+4);i++) inv[i] = Mul(inv[i], inv[i - 1]);
    int ans = G(n, m);
    ans = Sub(ans, G(R1 - L1, R2 - L2));
    for(int i=L1;i<=R1;i++) ans = Sub(ans, Mul(F(i, L2 - 1), F(n - i, m - L2)));
    for(int i=L2;i<=R2;i++) ans = Sub(ans, Mul(F(L1 - 1, i), F(n - L1, m - i)));
    for(int i=L1;i<=R1;i++) ans = Sub(ans, Mul(F(n - i, m - R2 - 1), F(i - L1, R2 - L2)));
    for(int i=L2;i<=R2;i++) ans = Sub(ans, Mul(F(n - R1 - 1, m - i), F(R1 - L1, i - L2)));
    cout << ans << '\n';
    return 0;
}

// Written by xiezheyuan

提出情報

ジャッジ結果