結果

問題 No.1688 Veterinarian
ユーザー 👑 deuteridayodeuteridayo
提出日時 2021-09-24 22:28:49
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,008 bytes
コンパイル時間 3,934 ms
コンパイル使用メモリ 230,340 KB
実行使用メモリ 56,940 KB
最終ジャッジ日時 2023-09-18 21:45:07
合計ジャッジ時間 15,940 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
56,644 KB
testcase_01 AC 17 ms
56,812 KB
testcase_02 AC 21 ms
56,888 KB
testcase_03 AC 18 ms
56,940 KB
testcase_04 AC 18 ms
56,728 KB
testcase_05 AC 18 ms
56,888 KB
testcase_06 AC 31 ms
56,928 KB
testcase_07 AC 17 ms
56,920 KB
testcase_08 TLE -
testcase_09 TLE -
testcase_10 AC 1,302 ms
56,764 KB
testcase_11 AC 368 ms
56,808 KB
testcase_12 AC 18 ms
56,872 KB
testcase_13 AC 361 ms
56,876 KB
testcase_14 AC 24 ms
56,732 KB
testcase_15 AC 2,337 ms
56,764 KB
testcase_16 AC 20 ms
56,920 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint const mod = 1e9+7;
//long const mod = 998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ kai[0] = 1; for(int i=1;i<=20000000;i++){ kai[i] = kai[i-1] * i; kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = kai[n];lint tmp = (kai[r] * kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
struct edge{
    int to;
};
using graph = vector<vector<edge>>;

double dp[51][51][51][51];

double f(int a,int b,int c, int n) {
    if(dp[a][b][c][n] >= 0)return dp[a][b][c][n];
    if(n==0)return 0;
    if(a <= 1)return dp[a][b][c][n] = 0;
    
    double aa = (double)(a * (a-1)) / (double)((a+b+c) * (a+b+c-1));
    double bb =  (double)(b * (b-1)) / (double)((a+b+c) * (a+b+c-1));
    double cc=  (double)(c * (c-1)) / (double)((a+b+c) * (a+b+c-1));
    double ans = aa * (1 + f(a-1,b,c,n-1));
    if(b >= 2)ans += bb * f(a,b-1,c,n-1) ; 
    if(c>=2)ans += cc * f(a,b,c-1,n-1) ; 
    ans += (1.0-aa-bb-cc) * f(a,b,c,n-1);
    cerr << a << " " << b << " " << c << " " << ans << endl;
    return dp[a][b][c][n] = ans;
}

int main(){ 
    int a,b,c,n;
    cin >> a >> b >> c >> n;
    for(int i = 0;i<=50;i++){
        for(int j=0;j<=50;j++){
            for(int k=0;k<=50;k++){
                for(int l=0;l<=50;l++)dp[i][j][k][l] = -1;
            }
        }
    }
    printf("%.10lf %.10lf %.10lf\n", f(a,b,c,n), f(b,a,c,n), f(c,a,b,n));
}
0