結果

問題 No.1354 Sambo's Treasure
ユーザー AngrySadEight
提出日時 2025-03-10 22:05:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,527 bytes
コンパイル時間 3,693 ms
コンパイル使用メモリ 196,184 KB
実行使用メモリ 57,984 KB
最終ジャッジ日時 2025-03-10 22:05:51
合計ジャッジ時間 13,478 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 15 WA * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

mint comb(ll n, ll r, vector<mint> &fact, vector<mint> &finv) {
    if (n < r) {
        return mint(0);
    } else if (r < 0) {
        return mint(0);
    }
    return fact[n] * finv[n - r] * finv[r];
}

mint routes(ll dx, ll dy, vector<mint> &fact, vector<mint> &finv) {
    return comb(dx + dy, dx, fact, finv);
}

int main() {
    ll N, M, L, K;
    cin >> N >> M >> L >> K;
    vector<ll> xc(M + 2);
    vector<ll> yc(M + 2);
    for (ll i = 0; i < M; i++) {
        cin >> xc[i + 1] >> yc[i + 1];
    }
    xc[0] = 0;
    yc[0] = 0;
    xc[M + 1] = N;
    yc[M + 1] = N;
    vector<ll> xt(L);
    vector<ll> yt(L);
    for (ll i = 0; i < L; i++) {
        cin >> xt[i] >> yt[i];
    }
    vector<mint> fact(2 * N + 1);
    vector<mint> finv(2 * N + 1);
    fact[0] = 1;
    finv[0] = 1;
    for (ll i = 0; i < 2 * N; i++) {
        fact[i + 1] = fact[i] * mint(i + 1);
        finv[i + 1] = 1 / fact[i + 1];
    }

    vector<vector<pll>> p(M + 1, vector<pll>(0));
    for (ll i = 0; i < M + 1; i++) {
        p[i].push_back(make_pair(xc[i], yc[i]));
        p[i].push_back(make_pair(xc[i + 1], yc[i + 1]));
    }
    vector<bool> tigar(M + 1, false);
    for (ll i = 0; i < M + 1; i++) {
        for (ll j = 0; j < L; j++) {
            if (xc[i] <= xt[j] && xt[j] <= xc[i + 1] && yc[i] <= yt[j] &&
                yt[j] <= yc[i + 1] && !(xc[i] == xt[j] && yc[i] == yt[j]) &&
                !(xc[i + 1] == xt[j] && yc[i + 1] == yt[j])) {
                p[i].push_back(make_pair(xt[j], yt[j]));
            }
            if (xc[i + 1] == xt[j] && yc[i + 1] == yt[j]) {
                tigar[i] = true;
            }
        }
    }
    for (ll i = 0; i < M + 1; i++) {
        sort(all(p[i]));
    }
    // 素直に dp をすればよいはず
    // そのあとで包除原理を行う
    vector<vector<mint>> dp(M + 2, vector<mint>(L + 1, 0));
    dp[0][0] = 1;

    for (ll i = 0; i < M + 1; i++) {
        ll len = p[i].size();
        vector<vector<mint>> subdp(len, vector<mint>(len + 2, 0));
        if (tigar[i]) {
            subdp[0][1] = 1;
        } else {
            subdp[0][0] = 1;
        }
        for (ll j = 0; j < len; j++) {
            for (ll k = j + 1; k < len; k++) {
                for (ll m = 0; m <= len; m++) {
                    ll fx = p[i][j].first;
                    ll fy = p[i][j].second;
                    ll tx = p[i][k].first;
                    ll ty = p[i][k].second;
                    // debug_out(fx, fy, tx, ty,
                    // routes(tx - fx, ty - fy, fact, finv).val());
                    if (k == len - 1) {
                        subdp[k][m] +=
                            subdp[j][m] * routes(tx - fx, ty - fy, fact, finv);
                    } else {
                        subdp[k][m + 1] +=
                            subdp[j][m] * routes(tx - fx, ty - fy, fact, finv);
                    }
                }
            }
        }
        vector<mint> subdp2(len);
        for (ll j = 0; j < len; j++) {
            subdp2[j] = subdp[len - 1][j];
            for (ll k = j + 1; k < len; k++) {
                if ((k - j) % 2 == 1) {
                    subdp2[j] -= subdp[len - 1][k];
                } else {
                    subdp2[j] += subdp[len - 1][k];
                }
            }
        }
        for (ll j = 0; j <= L; j++) {
            for (ll k = 0; k <= len; k++) {
                if (j + k <= L) {
                    dp[i + 1][j + k] += dp[i][j] * subdp2[k];
                }
            }
        }
        // debug_mint2(subdp);
    }
    // 答えを求めたい
    mint ans = 0;
    for (ll i = 0; i <= L; i++) {
        if (i <= K) {
            ans += dp[M + 1][i];
        }
    }
    cout << ans.val() << endl;
}
0