結果

問題 No.1354 Sambo's Treasure
コンテスト
ユーザー tokusakurai
提出日時 2021-01-17 14:32:39
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,107 bytes
コンパイル時間 3,432 ms
コンパイル使用メモリ 211,944 KB
最終ジャッジ日時 2025-01-18 00:52:29
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36 WA * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
//const int MOD = 1000000007;
const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template<int mod>
struct Mod_Int{
    int x;

    Mod_Int() : x(0) {}

    Mod_Int(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p){
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p){
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += Mod_Int(1);}

    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= Mod_Int(1);}

    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }

    Mod_Int pow(ll k) const{
        Mod_Int now = *this, ret = 1;
        for(; k; k >>= 1, now *= now){
            if(k&1) ret *= now;
        }
        return ret;
    }

    friend ostream &operator << (ostream &os, const Mod_Int &p){
        return os << p.x;
    }

    friend istream &operator >> (istream &is, Mod_Int &p){
        ll a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

template<int mod>
struct Combination{
    using T = Mod_Int<mod>;
    vector<T> _fac, _ifac;

    Combination(int n){
        _fac.resize(n+1), _ifac.resize(n+1);
        _fac[0] = 1;
        rep2(i, 1, n) _fac[i] = _fac[i-1]*i;
        _ifac[n] = _fac[n].inverse();
        rep3(i, n, 1) _ifac[i-1] = _ifac[i]*i;
    }

    T fac(int k) const {return _fac[k];}

    T ifac(int k) const {return _ifac[k];}

    T comb(int n, int k) const{
        if(k < 0 || n < k) return 0;
        return fac(n)*ifac(n-k)*ifac(k);
    }

    T comb2(int x, int y) const{
        if(x < 0 || y < 0) return 0;
        return comb(x+y, x);
    }

    T perm(int n, int k) const{
        if(k < 0 || n < k) return 0;
        return fac(n)*ifac(n-k);
    }

    T second_stirling_number(int n, int k) const{
        T ret = 0;
        rep(i, k+1){
            T tmp = comb(k, i)*T(i).pow(n);
            ret += ((k-i)&1)? -tmp : tmp;
        }
        return ret*ifac(k);
    }

    T bell_number(int n, int k) const{
        if(n == 0) return 1;
        chmin(k, n);
        vector<T> pref(k+1);
        pref[0] = 1;
        rep2(i, 1, k){
            if(i&1) pref[i] = pref[i-1]-ifac(i);
            else pref[i] = pref[i-1]+ifac(i);   
        }
        T ret = 0;
        rep2(i, 1, k){
            ret += T(i).pow(n)*ifac(i)*pref[k-i];
        }
        return ret;
    }
};

using comb = Combination<MOD>;

int main(){
    int N, M, L, J;
    cin >> N >> M >> L >> J;
    vector<int> cx(M+2), cy(M+2), tx(L), ty(L);
    cx[0] = 0, cx[M+1] = N, cy[0] = 0, cy[M+1] = N;

    rep2(i, 1, M) cin >> cx[i] >> cy[i];
    rep(i, L) cin >> tx[i] >> ty[i];

    comb C(2*(N+1));
    vector<mint> ans(L+1, 0);
    ans[0] = 1;

    rep(i, M+1){
        vector<pii> ps;
        ps.eb(cx[i], cy[i]), ps.eb(cx[i+1], cy[i+1]);

        rep(j, L){
            if(cx[i] <= tx[j] && tx[j] <= cx[i+1] && cy[i] <= ty[j] && ty[j] <= cy[i+1]){
                ps.eb(tx[j], ty[j]);
            }
        }
        sort(all(ps), [](pii a, pii b){
            if(a.first != b.first) return a.first < b.first;
            return a.second < b.second;
        });

        int flag = 1, K = sz(ps);
        if(ps[K-1] == ps[K-2]) ps.pop_back(), flag = 0;
        vector<int> xs(K), ys(K);
        rep(j, K) tie(xs[j], ys[j]) = ps[j];

        vector<vector<mint>> dp(K, vector<mint>(K, 0));
        dp[0][0] = 1;
        rep(j, K){
            vector<mint> tmp(K, 0);
            rep2(k, j+1, K-1){
                tmp[k] = C.comb2(xs[k]-xs[j], ys[k]-ys[j]);
                rep(l, k){
                    tmp[k] -= tmp[l]*C.comb2(xs[k]-xs[l], ys[k]-ys[l]);
                }
                rep(l, K){
                    if(dp[j][l] == 0) continue;
                    int nl = l+1;
                    if(k == K-1) nl -= flag;
                    dp[k][nl] += dp[j][l]*tmp[k];
                }
            }
        }

        vector<mint> tmp(L+1, 0);
        rep(i, L+1){
            rep(j, K){
                if(i+j > L) continue;
                tmp[i+j] += ans[i]*dp[K-1][j];
            }
        }
        swap(ans, tmp);
    }

    mint S = 0;
    rep(i, min(J, L)+1) S += ans[i];
    cout << S << '\n';
}
0