Submission #18349029

---

Source Code Expand

#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#define autoit(x,it) for(auto it = x.begin(); it != x.end(); it++)
#define autoitr(x,it) for(auto it = x.rbegin(); it != x.rend(); it++)
#define rep(n) for(ll i = 0; i < n; i++)
#define repi(i,n) for(ll i = 0; i < n; i++)

#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 

#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update> 

using namespace std;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());

#define N 101
ld dp[N][N][N];

ll a,b,c;

ld get(ll c1, ll c2, ll c3)
{
    
    if(c1<0 || c2<0 || c3<0 || c1 == 100 || c2 == 100 || c3 == 100)
        return 0;
    if(dp[c1][c2][c3] != (ld)-1)
        return dp[c1][c2][c3];
    if(c1<a || c2<b || c3<c)
        return 0;    
    //cout<<"at "<<c1<<" , "<<c2<<" , "<<c3<<"\n";    
    if(a == 0 && c1>0)
        return 0;
    if(b == 0 && c2>0)
        return 0;
    if(c == 0 && c3>0)
        return 0;
    //cout<<"at "<<c1<<" , "<<c2<<" , "<<c3<<"\n";
    /*if(c1+c2+c3 == 1)
        cout<<"At "<<c1<<" , "<<c2<<" , "<<c3<<'\n';*/
    ld ans = 0;    
    ld tot = (c1+c2+c3);
    //cout<<"tot = "<<tot<<'\n';
    if(a>0)
        ans+=((c1)/tot)*(get(c1+1,c2,c3));
    if(b>0)
        ans+=((c2)/tot)*(get(c1,c2+1,c3));
    if(c>0)
        ans+=((c3)/tot)*(get(c1,c2,c3+1)); 
    ans++;
    //cout<<"at "<<c1<<" , "<<c2<<" , "<<c3<<" "<<ans<<"\n";
    return dp[c1][c2][c3] = ans;    
}

int main()
{
  FAST/**/
  
  
  cin>>a>>b>>c;
  
  rep(N)
    repi(j,N)
        repi(k,N)
            dp[i][j][k] = -1;
  
  ld ans = get(a,b,c);
  
  cout<<fixed<<setprecision(12)<<ans<<'\n';        
  
  return 0;
}
   
   
 

Submission Info

Judge Result