#702283 (C++17) No.1688 Veterinarian

• 問題: No.1688 Veterinarian
• ユーザー: kaikey
• 提出日時: 2021-09-24 22:06:54
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 83 ms / 3,000 ms
• コード長: 5,178 bytes
• コンパイル時間: 2,338 ms
• コンパイル使用メモリ: 218,516 KB
• 実行使用メモリ: 5,888 KB
• 最終ジャッジ日時: 2024-07-05 10:38:51
• 合計ジャッジ時間: 2,750 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	5 ms; 5,888 KB
testcase_08	AC	83 ms; 5,504 KB
testcase_09	AC	78 ms; 5,780 KB
testcase_10	AC	8 ms; 5,376 KB
testcase_11	AC	9 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB
testcase_15	AC	5 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB

ソースコード

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
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 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
    F f;
    rec(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
        return f(*this, std::forward<Args>(args)...);
    }
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 8e18;
lint dx[8] = { 0, -1, 0, 1, 1, -1, 1, -1 }, dy[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost;
    Edge() {

    }
    Edge(lint u, lint v, lint c) {
        cost = c;
        from = u;
        to = v;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c = 1) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<plint, lint> tlint;
typedef pair<Vl, Vl> pVl;
typedef pair<tlint, plint> qlint;
typedef pair<lint, char> valc;

int main() {
    Vl arr(4);
    cin >> arr;
    vector dp(arr[0] + 1, vector(arr[1] + 1, vector(arr[2] + 1, 0.)));
    dp[arr[0]][arr[1]][arr[2]] = 1;
    REP(_, arr[3]) {
        vector tmp(arr[0] + 1, vector(arr[1] + 1, vector(arr[2] + 1, 0.)));
        IREP(i, arr[0] + 1) {
            IREP(j, arr[1] + 1) {
                IREP(k, arr[2] + 1) {
                    ld prb = 1.;
                    if (i >= 2) {
                        ld pb1 = (ld)i * (i - 1) / (i + j + k) / (i + j + k - 1);
                        tmp[i - 1][j][k] += dp[i][j][k] * pb1;
                        prb -= pb1;
                    }
                    if (j >= 2) {
                        ld pb2 = (ld)j * (j - 1) / (i + j + k) / (i + j + k - 1);
                        tmp[i][j - 1][k] += dp[i][j][k] * pb2;
                        prb -= pb2;
                    }
                    if (k >= 2) {
                        ld pb3 = (ld)k * (k - 1) / (i + j + k) / (i + j + k - 1);
                        tmp[i][j][k - 1] += dp[i][j][k] * pb3;
                        prb -= pb3;
                    }
                    tmp[i][j][k] += dp[i][j][k] * prb;
                }
            }
        }
        swap(dp, tmp);
    }
    V<ld> ans(3);
    REP(i, arr[0] + 1) {
        REP(j, arr[1] + 1) {
            REP(k, arr[2] + 1) {
                ans[0] += dp[i][j][k] * (arr[0] - i);
                ans[1] += dp[i][j][k] * (arr[1] - j);
                ans[2] += dp[i][j][k] * (arr[2] - k);
            }
        }
    }
    cout << ans << endk;
}