Submission #528074

---

Source Code Expand

/*{{{*/
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <functional>
#include <bitset>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <iostream>
#include <string>
#include <sstream>
using namespace std;
typedef int8_t sbyte;
typedef uint8_t byte;
typedef uint16_t ushort;
typedef uint32_t uint;
typedef int64_t i64;
typedef uint64_t u64;
template<class T> static inline T ABS(T x) {return x < 0 ? -x : x;}
template<class T> static inline void MAZ(T &a, const T &b) {if(a < b) a = b;}
template<class T> static inline void MIZ(T &a, const T &b) {if(b < a) a = b;}
/*}}}*/

static const auto INF = 1e100;

static double DP[101][101][101][4];

int main() {
	int n1, n2, n3, p1, p2, p3;
	cin >> n1 >> n2 >> n3;
	cin >> p1 >> p2 >> p3;
	auto P1 = p1 / 100., Q1 = (100 - p1) / 100.;
	auto P2 = p2 / 100., Q2 = (100 - p2) / 100.;
	auto P3 = p3 / 100., Q3 = (100 - p3) / 100.;
	for(auto i = 0; i <= n1; i++) {
		for(auto j = 0; j <= n2; j++) {
			for(auto k = 0; k <= n3; k++) {
				if(i + j + k == 0) continue;
				auto d0 = INF;
				if(i != 0) MIZ(d0, DP[i - 1][j][k][1] + 1 / P1);
				if(j != 0) MIZ(d0, DP[i][j - 1][k][1] + 1 / P2);
				if(k != 0) MIZ(d0, DP[i][j][k - 1][1] + 1 / P3);
				DP[i][j][k][0] = d0;
				auto d1 = INF;
				if(i != 0) MIZ(d1, P1 * DP[i - 1][j][k][2] + Q1 * d0);
				if(j != 0) MIZ(d1, P2 * DP[i][j - 1][k][2] + Q2 * d0);
				if(k != 0) MIZ(d1, P3 * DP[i][j][k - 1][2] + Q3 * d0);
				DP[i][j][k][1] = d1;
				auto d2 = INF;
				if(i != 0) MIZ(d2, P1 * DP[i - 1][j][k][0] + Q1 * d0);
				if(j != 0) MIZ(d2, P2 * DP[i][j - 1][k][3] + Q2 * d0);
				if(k != 0) MIZ(d2, P3 * DP[i][j][k - 1][3] + Q3 * d0);
				DP[i][j][k][2] = d2;
				auto d3 = INF;
				if(i != 0) MIZ(d3, P1 * DP[i - 1][j][k][0] + Q1 * d0);
				if(j != 0) MIZ(d3, P2 * DP[i][j - 1][k][0] + Q2 * d0);
				if(k != 0) MIZ(d3, P3 * DP[i][j][k - 1][0] + Q3 * d0);
				DP[i][j][k][3] = d3;
			}
		}
	}
	printf("%.15f\n", DP[n1][n2][n3][0]);
	return 0;
}

Submission Info

Judge Result