#606668 (C++17) No.1354 Sambo's Treasure

提出ソース

結果

問題	No.1354 Sambo's Treasure
ユーザー	minato
提出日時	2021-01-17 14:46:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	77 ms / 2,000 ms
コード長	10,191 bytes
コンパイル時間	3,065 ms
コンパイル使用メモリ	220,840 KB
実行使用メモリ	11,872 KB
最終ジャッジ日時	2024-12-16 03:50:58
合計ジャッジ時間	6,517 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	14 ms 11,056 KB
testcase_01	AC	13 ms 11,032 KB
testcase_02	AC	14 ms 11,076 KB
testcase_03	AC	13 ms 11,064 KB
testcase_04	AC	14 ms 10,920 KB
testcase_05	AC	13 ms 10,992 KB
testcase_06	AC	13 ms 11,080 KB
testcase_07	AC	13 ms 10,864 KB
testcase_08	AC	14 ms 11,040 KB
testcase_09	AC	15 ms 10,956 KB
testcase_10	AC	12 ms 11,048 KB
testcase_11	AC	13 ms 10,864 KB
testcase_12	AC	14 ms 11,028 KB
testcase_13	AC	12 ms 11,032 KB
testcase_14	AC	13 ms 10,928 KB
testcase_15	AC	13 ms 11,004 KB
testcase_16	AC	13 ms 10,992 KB
testcase_17	AC	14 ms 10,864 KB
testcase_18	AC	13 ms 11,020 KB
testcase_19	AC	14 ms 11,100 KB
testcase_20	AC	14 ms 11,040 KB
testcase_21	AC	12 ms 11,040 KB
testcase_22	AC	13 ms 11,076 KB
testcase_23	AC	65 ms 11,660 KB
testcase_24	AC	70 ms 11,696 KB
testcase_25	AC	70 ms 11,800 KB
testcase_26	AC	72 ms 11,804 KB
testcase_27	AC	77 ms 11,812 KB
testcase_28	AC	72 ms 11,780 KB
testcase_29	AC	72 ms 11,832 KB
testcase_30	AC	68 ms 11,808 KB
testcase_31	AC	68 ms 11,788 KB
testcase_32	AC	69 ms 11,848 KB
testcase_33	AC	70 ms 11,872 KB
testcase_34	AC	70 ms 11,804 KB
testcase_35	AC	69 ms 11,832 KB
testcase_36	AC	67 ms 11,788 KB
testcase_37	AC	73 ms 11,848 KB
testcase_38	AC	67 ms 11,788 KB
testcase_39	AC	68 ms 11,828 KB
testcase_40	AC	67 ms 11,832 KB
testcase_41	AC	69 ms 11,812 KB
testcase_42	AC	66 ms 11,852 KB
testcase_43	AC	16 ms 11,032 KB
testcase_44	AC	16 ms 11,204 KB
testcase_45	AC	15 ms 11,052 KB
testcase_46	AC	14 ms 11,084 KB
testcase_47	AC	14 ms 11,104 KB
testcase_48	AC	15 ms 11,056 KB
testcase_49	AC	15 ms 11,116 KB
testcase_50	AC	16 ms 11,048 KB
testcase_51	AC	16 ms 10,992 KB
testcase_52	AC	15 ms 11,044 KB
testcase_53	AC	15 ms 11,112 KB
testcase_54	AC	15 ms 11,072 KB
testcase_55	AC	14 ms 11,120 KB
testcase_56	AC	15 ms 10,960 KB
testcase_57	AC	14 ms 11,068 KB
testcase_58	AC	14 ms 10,996 KB
testcase_59	AC	14 ms 11,036 KB
testcase_60	AC	15 ms 10,988 KB
testcase_61	AC	14 ms 11,092 KB
testcase_62	AC	15 ms 11,048 KB
testcase_63	AC	65 ms 11,840 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template<class T> 
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    for (int i = 0; i < int(v.size()); i++) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        if (i) cout << " ";
        cout << v[i];
    }
    print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
    cerr << " " << x;
    debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

template<int m> 
struct ModInt {
  public:
    static constexpr int mod() { return m; }
    static ModInt raw(int v) {
        ModInt x;
        x._v = v;
        return x;
    }

    ModInt() : _v(0) {}
    ModInt(long long v) {
        long long x = (long long)(v % (long long)(umod()));
        if (x < 0) x += umod();
        _v = (unsigned int)(x);
    }

    unsigned int val() const { return _v; }

    ModInt& operator++() {
        _v++;
        if (_v == umod()) _v = 0;
        return *this;
    }
    ModInt& operator--() {
        if (_v == 0) _v = umod();
        _v--;
        return *this;
    }
    ModInt operator++(int) {
        ModInt result = *this;
        ++*this;
        return result;
    }
    ModInt operator--(int) {
        ModInt result = *this;
        --*this;
        return result;
    }

    ModInt& operator+=(const ModInt& rhs) {
        _v += rhs._v;
        if (_v >= umod()) _v -= umod();
        return *this;
    }
    ModInt& operator-=(const ModInt& rhs) {
        _v -= rhs._v;
        if (_v >= umod()) _v += umod();
        return *this;
    }
    ModInt& operator*=(const ModInt& rhs) {
        unsigned long long z = _v;
        z *= rhs._v;
        _v = (unsigned int)(z % umod());
        return *this;
    }
    ModInt& operator^=(long long n) {
        ModInt x = *this;
        *this = 1;
        if (n < 0) x = x.inv(), n = -n;
        while (n) {
            if (n & 1) *this *= x;
            x *= x;
            n >>= 1;
        }
        return *this;
    }
    ModInt& operator/=(const ModInt& rhs) { return *this = *this * rhs.inv(); }

    ModInt operator+() const { return *this; }
    ModInt operator-() const { return ModInt() - *this; }

    ModInt pow(long long n) const {
        ModInt r = *this;
        r ^= n;
        return r;
    }
    ModInt inv() const {
        int a = _v, b = umod(), y = 1, z = 0, t;
        for (; ; ) {
            t = a / b; a -= t * b;
            if (a == 0) {
                assert(b == 1 || b == -1);
                return ModInt(b * z);
            }
            y -= t * z;
            t = b / a; b -= t * a;
            if (b == 0) {
                assert(a == 1 || a == -1);
                return ModInt(a * y);
            }
            z -= t * y;
        }
    }

    friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) += rhs; }
    friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) -= rhs; }
    friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) *= rhs; }
    friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) /= rhs; }
    friend ModInt operator^(const ModInt& lhs, long long rhs) { return ModInt(lhs) ^= rhs; }
    friend bool operator==(const ModInt& lhs, const ModInt& rhs) { return lhs._v == rhs._v; }
    friend bool operator!=(const ModInt& lhs, const ModInt& rhs) { return lhs._v != rhs._v; }
    friend ModInt operator+(long long lhs, const ModInt& rhs) { return (ModInt(lhs) += rhs); }
    friend ModInt operator-(long long lhs, const ModInt& rhs) { return (ModInt(lhs) -= rhs); }
    friend ModInt operator*(long long lhs, const ModInt& rhs) { return (ModInt(lhs) *= rhs); }
    friend ostream& operator<<(ostream& os, const ModInt& M) { return os << M._v; }
    friend istream& operator>>(istream& is, ModInt& M) {
        long long x; is >> x;
        M = ModInt(x);
        return is;
    }

  private:
    unsigned int _v;
    static constexpr unsigned int umod() { return m; }
};

//constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

using mint = ModInt<MOD>;

struct ModCombination {
  private:
    int max_n;
    vector<mint> fac_,facinv_;

  public:
    ModCombination() {}
    ModCombination(int n) : max_n(n), fac_(n+1), facinv_(n+1) {
        assert(1 <= n);
        fac_[0] = 1;
        for (int i = 1; i <= n; i++) fac_[i] = fac_[i-1]*i;
        facinv_[n] = fac_[n].inv();
        for (int i = n; i >= 1; i--) facinv_[i-1] = facinv_[i]*i;
    }

    mint fac(int k) const { 
        assert(0 <= k and k <= max_n);
        return fac_[k]; 
    }
    mint facinv(int k) const {
        assert(0 <= k and k <= max_n); 
        return facinv_[k]; 
    }
    mint invs(int k) const { 
        assert(1 <= k and k <= max_n);
        return facinv_[k]*fac_[k-1]; 
    }

    mint P(int n, int k) const {
        if (k < 0 or k > n) return mint(0);
        assert(n <= max_n);
        return fac_[n]*facinv_[n-k];
    }
    mint C(int n, int k) const {
        if (k < 0 or k > n) return mint(0);
        assert(n <= max_n);
        return fac_[n]*facinv_[n-k]*facinv_[k];
    }
    mint H(int n, int k) const {
        if (n == 0 and k == 0) return mint(1);
        return C(n+k-1,k);
    }
    mint catalan(int n) const {
        if (n == 0) return mint(1);
        return C(n*2,n) - C(n*2,n-1);
    }
};

int main() {
    ModCombination MC(1000000);
    int N,M,L,K; cin >> N >> M >> L >> K;
    vec<int> X(M+2),Y(M+2),TX(L),TY(L);
    rep(i,M) cin >> X[i+1] >> Y[i+1];
    X[M+1] = N; Y[M+1] = N;
    rep(i,L) cin >> TX[i] >> TY[i];

    int cnt = 0;
    vec<mint> table = {1};
    rep(m,M+1) {
        vec<int> x = {0,X[m+1]-X[m]}, y = {0,Y[m+1]-Y[m]};
        rep(j,L) {
            if (X[m]==TX[j] and Y[m]==TY[j]) {
                cnt++;
                continue;
            }
            if (X[m+1]==TX[j] and Y[m+1]==TY[j]) {
                cnt++;
                continue;
            }
            if (X[m] <= TX[j] and TX[j] <= X[m+1] and Y[m] <= TY[j] and TY[j] <= Y[m+1]) {
                x.emplace_back(TX[j]-X[m]);
                y.emplace_back(TY[j]-Y[m]);
            }
        }
        debug(x);
        debug(y);
        int sz = x.size();
        vec<int> idx(sz);
        iota(all(idx),0);
        sort(all(idx),[&](int i, int j){
            if (x[i]==x[j]) return y[i] < y[j];
            return x[i] < x[j];
        });
        // t_num = sz-2
        vvec<mint> dp(sz-1,vec<mint>(sz-1));
        dp[0][0] = 1;
        rep(i,sz-1) {
            int u = idx[i];
            rep(k,sz-2) {
                if (dp[i][k]==0) continue;
                for (int j = i+1; j < sz-1; j++) {
                    int v = idx[j];
                    if (x[u] <= x[v] and y[u] <= y[v]) {
                        dp[j][k+1] += dp[i][k]*MC.C(x[v]-x[u]+y[v]-y[u],x[v]-x[u]);
                    }
                }
            }
        }
        vec<mint> last(sz-1);
        rep(i,sz-1) {
            rep(k,sz-1) {
                int u = idx[i];
                last[k] += dp[i][k]*MC.C(x[idx[sz-1]]-x[u]+y[idx[sz-1]]-y[u],x[idx[sz-1]]-x[u]);
            }
        }
        rep(i,sz-2) {
            for (int j = sz-3; j >= i; j--) last[j] -= last[j+1];
        }

        int sz2 = table.size();
        vec<mint> nex(sz+sz2-2);
        rep(i,sz-1) rep(j,sz2) {
            nex[i+j] += last[i]*table[j];
        }
        swap(table,nex);
    }

    cnt /= 2;
    K -= cnt;
    mint ans = 0;
    rep(i,K+1) {
        if (i >= SZ(table)) break;
        ans += table[i];
    }

    cout << ans << ln;    
}

yukicoder

結果

テストケース

ソースコード