結果

問題 No.1688 Veterinarian
コンテスト
ユーザー Aoxiang Cui
提出日時 2021-09-25 22:21:51
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 272 ms / 3,000 ms
コード長 4,702 bytes
コンパイル時間 1,335 ms
コンパイル使用メモリ 126,060 KB
実行使用メモリ 321,152 KB
最終ジャッジ日時 2024-07-05 15:31:24
合計ジャッジ時間 6,695 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
// mt19937_64 mrand(random_device{}());
// int64 rnd(int64 x) { return mrand() % x; }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

array<double, 3> operator +(const array<double, 3>& lhs,
                            const array<double, 3>& rhs) {
  return {lhs[0] + rhs[0], lhs[1] + rhs[1], lhs[2] + rhs[2]};
}

array<double, 3> operator *(const double x,
                            const array<double, 3>& v) {
  return {x * v[0], x * v[1], x * v[2]};
}

int main() {
  int a, b, c, n;
  cin >> a >> b >> c >> n;

  const int N = 50 + 10;
  auto dp = vect<array<double, 3>>({-1, -1, -1}, N, N, N, N);

  auto C2 =
    [&](int x) {
      return 1.0 * x * (x - 1);
    };
  function<array<double, 3>(int, int, int, int)> solve =
    [&](int x, int y, int z, int rem) {
      int m = x + y + z;
      if (rem == 0 || m < 2) return array<double, 3>{0, 0, 0};
      auto& ret = dp[x][y][z][rem];
      if (ret[0] > -0.5) return ret;

      double px = C2(x) / C2(m);
      double py = C2(y) / C2(m);
      double pz = C2(z) / C2(m);
      double q = 1 - px - py - pz;
      // trace(x, y, z, px, py, pz, q);

      ret = {0, 0, 0};
      if (x >= 2) ret = ret + px * solve(x - 1, y, z, rem - 1) + array<double, 3>{px, 0.0, 0.0};
      if (y >= 2) ret = ret + py * solve(x, y - 1, z, rem - 1) + array<double, 3>{0.0, py, 0.0};
      if (z >= 2) ret = ret + pz * solve(x, y, z - 1, rem - 1) + array<double, 3>{0.0, 0.0, pz};
      ret = ret + q * solve(x, y, z, rem - 1);

      return ret;
    };
  auto ret = solve(a, b, c, n);
  cout << ret[0] << " " << ret[1] << " " << ret[2] << '\n';
  return 0;
}
0