#665809 (C++17) No.1547 [Cherry 2nd Tune *] 偶然の勝利の確率

提出ソース

結果

問題	No.1547 [Cherry 2nd Tune *] 偶然の勝利の確率
ユーザー	rniya
提出日時	2021-06-11 22:29:19
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	137 ms / 2,000 ms
コード長	11,377 bytes
コンパイル時間	2,528 ms
コンパイル使用メモリ	212,220 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-12-15 00:56:49
合計ジャッジ時間	5,317 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	6 ms 6,820 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	2 ms 6,820 KB
testcase_05	AC	2 ms 6,820 KB
testcase_06	AC	2 ms 6,816 KB
testcase_07	AC	2 ms 6,820 KB
testcase_08	AC	2 ms 6,820 KB
testcase_09	AC	2 ms 6,816 KB
testcase_10	AC	2 ms 6,820 KB
testcase_11	AC	2 ms 6,820 KB
testcase_12	AC	2 ms 6,816 KB
testcase_13	AC	25 ms 6,816 KB
testcase_14	AC	17 ms 6,816 KB
testcase_15	AC	8 ms 6,816 KB
testcase_16	AC	12 ms 6,816 KB
testcase_17	AC	12 ms 6,820 KB
testcase_18	AC	12 ms 6,816 KB
testcase_19	AC	4 ms 6,816 KB
testcase_20	AC	77 ms 6,816 KB
testcase_21	AC	8 ms 6,820 KB
testcase_22	AC	2 ms 6,820 KB
testcase_23	AC	135 ms 6,816 KB
testcase_24	AC	135 ms 6,816 KB
testcase_25	AC	135 ms 6,816 KB
testcase_26	AC	137 ms 6,816 KB
testcase_27	AC	135 ms 6,816 KB
testcase_28	AC	136 ms 6,820 KB
testcase_29	AC	135 ms 6,816 KB
testcase_30	AC	135 ms 6,816 KB
testcase_31	AC	135 ms 6,820 KB
testcase_32	AC	135 ms 6,820 KB
testcase_33	AC	135 ms 6,816 KB
testcase_34	AC	11 ms 6,820 KB
testcase_35	AC	12 ms 6,820 KB

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

ソースコード

raw source code

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

/**
 * @brief modint
 * @docs docs/modulo/modint.md
 */
template <uint32_t mod> class modint {
    using i64 = int64_t;
    using u32 = uint32_t;
    using u64 = uint64_t;

public:
    u32 v;
    constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}
    constexpr u32& value() noexcept { return v; }
    constexpr const u32& value() const noexcept { return v; }
    constexpr modint operator+(const modint& rhs) const noexcept { return modint(*this) += rhs; }
    constexpr modint operator-(const modint& rhs) const noexcept { return modint(*this) -= rhs; }
    constexpr modint operator*(const modint& rhs) const noexcept { return modint(*this) *= rhs; }
    constexpr modint operator/(const modint& rhs) const noexcept { return modint(*this) /= rhs; }
    constexpr modint& operator+=(const modint& rhs) noexcept {
        v += rhs.v;
        if (v >= mod) v -= mod;
        return *this;
    }
    constexpr modint& operator-=(const modint& rhs) noexcept {
        if (v < rhs.v) v += mod;
        v -= rhs.v;
        return *this;
    }
    constexpr modint& operator*=(const modint& rhs) noexcept {
        v = (u64)v * rhs.v % mod;
        return *this;
    }
    constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.pow(mod - 2); }
    constexpr modint pow(u64 exp) const noexcept {
        modint self(*this), res(1);
        while (exp > 0) {
            if (exp & 1) res *= self;
            self *= self;
            exp >>= 1;
        }
        return res;
    }
    constexpr modint& operator++() noexcept {
        if (++v == mod) v = 0;
        return *this;
    }
    constexpr modint& operator--() noexcept {
        if (v == 0) v = mod;
        return --v, *this;
    }
    constexpr modint operator++(int) noexcept {
        modint t = *this;
        return ++*this, t;
    }
    constexpr modint operator--(int) noexcept {
        modint t = *this;
        return --*this, t;
    }
    constexpr modint operator-() const noexcept { return modint(mod - v); }
    template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }
    template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }
    template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }
    template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }
    constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }
    constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }
    constexpr bool operator!() const noexcept { return !v; }
    friend istream& operator>>(istream& s, modint& rhs) noexcept {
        i64 v;
        rhs = modint{(s >> v, v)};
        return s;
    }
    friend ostream& operator<<(ostream& s, const modint& rhs) noexcept { return s << rhs.v; }
};

/**
 * @brief Matrix
 * @docs docs/linearalgebra/Matrix.md
 */
template <class T> struct Matrix {
    vector<vector<T>> A;
    Matrix(size_t n, size_t m) : A(n, vector<T>(m, 0)) {}
    Matrix(size_t n) : A(n, vector<T>(n, 0)) {}
    size_t height() const { return A.size(); }
    size_t width() const { return A[0].size(); }
    inline const vector<T>& operator[](int i) const { return A[i]; }
    inline vector<T>& operator[](int i) { return A[i]; }
    static Matrix I(size_t n) {
        Matrix res(n);
        for (int i = 0; i < n; i++) res[i][i] = 1;
        return res;
    }
    Matrix operator+(const Matrix& B) const { return Matrix(*this) += B; }
    Matrix operator-(const Matrix& B) const { return Matrix(*this) -= B; }
    Matrix operator*(const Matrix& B) const { return Matrix(*this) *= B; }
    Matrix operator^(const long long k) const { return Matrix(*this) ^= k; }
    Matrix& operator+=(const Matrix& B) {
        size_t n = height(), m = width();
        assert(n == B.height() && m == B.width());
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                (*this)[i][j] += B[i][j];
            }
        }
        return *this;
    }
    Matrix& operator-=(const Matrix& B) {
        size_t n = height(), m = width();
        assert(n == B.height() && m == B.width());
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                (*this)[i][j] -= B[i][j];
            }
        }
        return *this;
    }
    Matrix& operator*=(const Matrix& B) {
        size_t n = height(), m = B.width(), l = width();
        assert(l == B.height());
        vector<vector<T>> C(n, vector<T>(m, 0));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                for (int k = 0; k < l; k++) {
                    C[i][j] += (*this)[i][k] * B[k][j];
                }
            }
        }
        A.swap(C);
        return *this;
    }
    Matrix& operator^=(long long k) {
        Matrix res = Matrix::I(height());
        while (k > 0) {
            if (k & 1) res *= *this;
            *this *= *this;
            k >>= 1LL;
        }
        A.swap(res.A);
        return *this;
    }
    T determinant() {
        Matrix B(*this);
        T res = 1;
        for (int i = 0; i < width(); i++) {
            int pivot = -1;
            for (int j = i; j < height(); j++) {
                if (B[j][i] != 0) {
                    pivot = j;
                }
            }
            if (pivot < 0) return 0;
            if (pivot != i) {
                res *= -1;
                swap(B[i], B[pivot]);
            }
            res *= B[i][i];
            T v = T(1) / B[i][i];
            for (int j = 0; j < width(); j++) B[i][j] *= v;
            for (int j = i + 1; j < height(); j++) {
                T w = B[j][i];
                for (int k = 0; k < width(); k++) {
                    B[j][k] -= B[i][k] * w;
                }
            }
        }
        return res;
    }
};

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
// const long long MOD = 1000000007;
const long long MOD = 998244353;

using mint = modint<MOD>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<int> M(2), N(2);
    int S, T, K;
    cin >> M[0] >> N[0] >> S;
    cin >> M[1] >> N[1] >> T;
    cin >> K;

    S += T;
    vector<mint> P(2);
    for (int i = 0; i < 2; i++) P[i] = mint(M[i]) / N[i];
    vector<mint> get(S + 1, 0), lose(S + 1, 0);
    get[0] = lose[0] = 1;
    for (int i = 0; i < S; i++) get[i + 1] = get[i] * P[0];
    for (int i = 0; i < S; i++) lose[i + 1] = lose[i] * P[1];

    Matrix<mint> U(S + 1), V(S + 1);
    U[0][0] = U[S][S] = V[0][0] = V[S][S] = 1;
    for (int i = 1; i < S; i++) {
        for (int j = 0; i + j <= S; j++) {
            if (i + j == S)
                U[i][i + j] = get[j];
            else
                U[i][i + j] = get[j] * (1 - P[0]);
        }
        for (int j = 0; i - j >= 0; j++) {
            if (i - j == 0)
                V[i][i - j] = lose[j];
            else
                V[i][i - j] = lose[j] * (1 - P[1]);
        }
    }
    // for (int i = 0; i <= S; i++) {
    //     for (int j = 0; j <= S; j++) {
    //         cerr << U[i][j] << (j == S ? '\n' : ' ');
    //     }
    // }

    // for (int i = 0; i <= S; i++) {
    //     for (int j = 0; j <= S; j++) {
    //         cerr << V[i][j] << (j == S ? '\n' : ' ');
    //     }
    // }

    U *= V;
    U ^= K;

    mint a = U[T][S], b = U[T][0];
    cout << a << '\n';
    cout << b << '\n';
    return 0;
}

yukicoder

結果

テストケース

ソースコード