結果
| 問題 | No.1688 Veterinarian |
| ユーザー |
 leaf_1415
|
| 提出日時 | 2021-09-24 21:36:15 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
AC
|
| 実行時間 | 130 ms / 3,000 ms |
| コード長 | 7,670 bytes |
| コンパイル時間 | 1,194 ms |
| コンパイル使用メモリ | 102,860 KB |
| 実行使用メモリ | 64,000 KB |
| 最終ジャッジ日時 | 2024-07-05 10:11:16 |
| 合計ジャッジ時間 | 2,078 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 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 | 2 ms
5,376 KB |
| testcase_05 | AC | 1 ms
5,376 KB |
| testcase_06 | AC | 5 ms
6,016 KB |
| testcase_07 | AC | 4 ms
5,376 KB |
| testcase_08 | AC | 130 ms
64,000 KB |
| testcase_09 | AC | 113 ms
61,568 KB |
| testcase_10 | AC | 16 ms
12,928 KB |
| testcase_11 | AC | 15 ms
10,752 KB |
| testcase_12 | AC | 3 ms
5,376 KB |
| testcase_13 | AC | 5 ms
6,400 KB |
| testcase_14 | AC | 4 ms
5,376 KB |
| testcase_15 | AC | 11 ms
9,088 KB |
| testcase_16 | AC | 3 ms
5,376 KB |
ソースコード
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;
using namespace std;
typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{
ll to, cost;
edge(){}
edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int mod = 1000000007;
//int mod = 998244353;
struct mint{
int x;
mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
mint(const mint &ope) {x = ope.x;}
mint operator-(){return mint(-x);}
mint operator+(const mint &ope){return mint(x) += ope;}
mint operator-(const mint &ope){return mint(x) -= ope;}
mint operator*(const mint &ope){return mint(x) *= ope;}
mint operator/(const mint &ope){return mint(x) /= ope;}
mint& operator+=(const mint &ope){
x += ope.x;
if(x >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint &ope){
x += mod - ope.x;
if(x >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint &ope){
ll tmp = x;
tmp *= ope.x, tmp %= mod;
x = tmp;
return *this;
}
mint& operator/=(const mint &ope){
ll n = mod-2; mint mul = ope;
while(n){
if(n & 1) *this *= mul;
mul *= mul;
n >>= 1;
}
return *this;
}
mint inverse(){return mint(1) / *this;}
bool operator ==(const mint &ope){return x == ope.x;}
bool operator !=(const mint &ope){return x != ope.x;}
bool operator <(const mint &ope){return x < ope.x;}
};
mint modpow(mint a, ll n){
if(n == 0) return mint(1);
if(n % 2) return a * modpow(a, n-1);
else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
ll t; is >> t, ope.x = t;
return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}
vector<mint> fact, fact_inv;
void make_fact(int n){
fact.resize(n+1), fact_inv.resize(n+1);
fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
vector<int> prime, pvec;
void make_prime(int n){
prime.resize(n+1);
rep(i, 2, n){
if(prime[i]) continue;
for(int j = i; j <= n; j+=i) prime[j] = i;
}
rep(i, 2, n) if(prime[i] == i) pvec.push_back(i);
}
bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}
template<class S, class T> pair<S, T>& operator+=(pair<S,T> &s, const pair<S,T> &t){
s.first += t.first, s.second += t.second;
return s;
}
template<class S, class T> pair<S, T>& operator-=(pair<S,T> &s, const pair<S,T> &t){
s.first -= t.first, s.second -= t.second;
return s;
}
template<class S, class T> pair<S, T> operator+(const pair<S,T> &s, const pair<S,T> &t){
return pair<S,T>(s.first+t.first, s.second+t.second);
}
template<class S, class T> pair<S, T> operator-(const pair<S,T> &s, const pair<S,T> &t){
return pair<S,T>(s.first-t.first, s.second-t.second);
}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
reps(i, vec) os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os;
}
template<typename T>
ostream& operator << (ostream& os, const vector<T>& vec) {
reps(i, vec) os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
reps(i, deq) os << deq[i] << (i + 1 == deq.size() ? "" : " "); return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")";
itr++; if(itr != map_var.end()) os << ","; itr--;
}
return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
}
return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
}
return os;
}
template<typename T>
void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";}cout << endl;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
cout << head;
if(sizeof...(Tail) > 0) cout << " ";
dump_func(std::move(tail)...);
}
ll a, b, c, n;
double dp[55][55][55][55];
double get(ll x, ll y)
{
if(x < 2) return 0;
double ret = y*(y-1)/2;
ret /= x*(x-1)/2;
return ret;
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> a >> b >> c >> n;
dp[0][a][b][c] = 1;
rep(i, 0, n-1){
rep(j, 0, a) rep(k, 0, b) rep(l, 0, c){
if(j-1 >= 0) dp[i+1][j-1][k][l] += dp[i][j][k][l] * get(j+k+l, j);
if(k-1 >= 0) dp[i+1][j][k-1][l] += dp[i][j][k][l] * get(j+k+l, k);
if(l-1 >= 0) dp[i+1][j][k][l-1] += dp[i][j][k][l] * get(j+k+l, l);
dp[i+1][j][k][l] += dp[i][j][k][l] * (1 - get(j+k+l, j) - get(j+k+l, k) - get(j+k+l, l));
}
}
double ans = 0, ans2 = 0, ans3 = 0;
rep(j, 0, a) rep(k, 0, b) rep(l, 0, c){
ans += dp[n][j][k][l] * (a-j);
ans2 += dp[n][j][k][l] * (b-k);
ans3 += dp[n][j][k][l] * (c-l);
}
printf("%.11f %.11f %.11f\n", ans, ans2, ans3);
return 0;
}