#432879 (C++14) No.997 Jumping Kangaroo

提出ソース

結果

問題	No.997 Jumping Kangaroo
ユーザー	haruki_K
提出日時	2020-02-21 22:16:22
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	2 ms / 2,000 ms
コード長	9,661 bytes
コンパイル時間	2,059 ms
コンパイル使用メモリ	176,388 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-04-17 07:41:14
合計ジャッジ時間	2,770 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	2 ms 6,944 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	AC	2 ms 6,940 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF32 (numeric_limits<int32_t>::max()/2-1)
#define INF64 (numeric_limits<int64_t>::max()/2-1)
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
// <<<
// >>> modint
template <int32_t md>
class modint {
    static_assert(md > 0, "");
    using M = modint;
    using ll = int64_t;
    int32_t x;
public:
    static constexpr int32_t mod = md;
    constexpr modint(ll x = 0) : x((x%=mod) < 0 ? x+mod : x) { }
    constexpr ll val() const { return x; }
    constexpr explicit operator ll() const { return x; }
    constexpr bool operator==(M const& r) const { return x == r.x; }
    constexpr bool operator!=(M const& r) const { return x != r.x; }
    constexpr M operator+() const { return *this; }
    constexpr M operator-() const { return M()-*this; }
    constexpr M& operator+=(M const& r) { ll t = ll(x) + r.x; if (t >= mod) t -= mod; x = t; return *this; }
    constexpr M& operator-=(M const& r) { ll t = ll(x) + mod-r.x; if (t >= mod) t -= mod; x = t; return *this; }
    constexpr M& operator*=(M const& r) { return *this = *this * r; }
    constexpr M operator*(M const& r) const { M t; t.x = (ll(x)*r.x) % mod; return t; }
    constexpr M& operator/=(M const& r) { return *this *= r.inv(); }
    constexpr M operator+(M const& r) const { return M(*this) += r; }
    constexpr M operator-(M const& r) const { return M(*this) -= r; }
    constexpr M operator/(M const& r) const { return M(*this) /= r; }
    friend constexpr M operator+(ll x, M const& y) { return M(x)+y; }
    friend constexpr M operator-(ll x, M const& y) { return M(x)-y; }
    friend constexpr M operator*(ll x, M const& y) { return M(x)*y; }
    friend constexpr M operator/(ll x, M const& y) { return M(x)/y; }
    constexpr M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }
    constexpr M inv() const {
        assert(x > 0);
        ll t = 1, v = x, q = 0, r = 0;
        while (v != 1) {
            q = mod / v; r = mod % v;
            if (r * 2 < v) {
                t *= -q; t %= mod; v = r;
            } else {
                t *= q + 1; t %= mod; v -= r;
            }
        }
        if (t < 0) t += mod;
        M y; y.x = t; return y;
    }
#ifdef LOCAL
    friend string to_s(M r) { return to_s(r.val(), mod); }
#endif
    friend ostream& operator<<(ostream& os, M r) { return os << r.val(); }
    friend istream& operator>>(istream& is, M &r) { int64_t x; is >> x; r = x; return is; }
};
// <<<
//constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9+7;
using mint = modint<(int32_t)MOD>;
// >>> matrix
template <class T>
struct Matrix {
    int n,m;
    vector<vector<T> > a;
    Matrix() {}
    Matrix(int n, int m) : n(n), m(m), a(n) {
        assert(n > 0 && m > 0);
        rep (i,n) a[i].resize(m);
    }
    Matrix(initializer_list<initializer_list<T> > init) {
        for (auto ls : init) {
            a.emplace_back();
            for (auto x : ls) a.back().emplace_back(x);
        }
        n = a.size(); assert(n > 0);
        m = a[0].size(); assert(m > 0);
    }
    vector<T> const& operator[](int i) const {
        assert(0 <= i && i < n);
        return a[i];
    }
    vector<T> & operator[](int i) {
        assert(0 <= i && i < n);
        return a[i];
    }
    bool operator==(Matrix const& x) const {
        if (n != x.n || m != x.m) return false;
        rep (i,n) rep (j,m) if (a[i][j] != x[i][j]) return false;
        return true;
    }
    bool operator!=(Matrix const& x) const {
        return !(*this == x);
    }
    Matrix& operator+=(Matrix const& x) {
        assert(n == x.n && m == x.m);
        rep (i,n) rep (j,m) a[i][j] += x[i][j];
        return *this;
    }
    Matrix& operator-=(Matrix const& x) {
        assert(n == x.n && m == x.m);
        rep (i,n) rep (j,m) a[i][j] -= x[i][j];
        return *this;
    }
    Matrix operator+(Matrix const& x) const { return Matrix(*this) += x; }
    Matrix operator-(Matrix const& x) const { return Matrix(*this) -= x; }
    Matrix operator*(Matrix const& x) const {
        assert(m == x.n);
        Matrix ret(n,x.m);
        rep (i,n) rep (j,m) rep (k,x.m) ret[i][k] += a[i][j] * x[j][k];
        return ret;
    }
    Matrix& operator*=(Matrix const& x) {
        auto res = (*this)*x;
        swap(a, res.a);
        return *this;
    }
	Matrix operator+() const { return *this; }
	Matrix operator-() const {
		Matrix x = *this;
        rep (i,n) rep (j,m) x[i][j] = -x[i][j];
		return x;
	}
    Matrix& operator*=(T const& c) {
        rep (i,n) rep (j,m) a[i][j] *= c;
        return *this;
    }
    Matrix operator*(T const& c) const { return Matrix(*this) *= c; }
    friend Matrix operator*(T const& c, Matrix const& x) {
        Matrix ret = x;
        rep (i,x.n) rep (j,x.m) ret[i][j] = c*x[i][j];
        return ret;
    }
    Matrix& operator/=(T const& c) {
        rep (i,n) rep (j,m) a[i][j] /= c;
        return *this;
    }
    Matrix operator/(T const& c) const {
        return Matrix(*this) /= c;
    }
    static Matrix identity(int n) {
        Matrix ret(n,n);
        rep (i,n) ret[i][i] = 1;
        return ret;
    }
    Matrix pow(ll k) const {
        assert(n == m); assert(k >= 0);
        Matrix v = *this, r = Matrix::identity(n);
        for (; k > 0; k >>= 1, v *= v) if (k&1) r *= v;
        return r;
    }
    friend istream& operator>>(istream& is, Matrix& x) {
        rep (i,x.n) rep (j,x.m) is >> x[i][j];
        return is;
    }
#ifdef LOCAL
    friend string to_s(Matrix const& x) {
        string ret;
        rep (i,x.n) {
            ret += "\n(";
            rep (j,x.m) ret += " " + to_s(x[i][j]);
            ret += " )";
        }
        return ret += "\n";
    }
#endif
};
// <<<

int32_t main() {
    int n,w,k; cin >> n >> w >> k;
    vector<int> a(n); cin >> a;

    vector<mint> dp(2*w+1);
    dp[0] = 1;
    rep (i,sz(dp)) rep (j,n) {
        if (i+a[j] < sz(dp)) dp[i+a[j]] += dp[i];
    }

    Matrix<mint> mat = {
        { dp[w], dp[2*w]-dp[w]*dp[w] },
        { 1, 0 }
    };

    auto res = mat.pow(k-1);
    cout << res[0][0]*dp[w] + res[0][1]*1 << endl;


}

yukicoder

結果

テストケース

ソースコード