Expected DP

The general practice of expectation DP is to start recurrence from the last state:

Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl ).

Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped in a labyrinth called LOOPS.

The planform of the LOOPS is a rectangle of R * C grids. there is a portal in each grid does T the exit grid. it costs Homura 2 magic power to use a portal once. the portal in a grid G (r, c) will send Homura to the grid below G (grid (r + 1, c )), the grid on the right of G (grid (r, c + 1), or even G itself at respective probability (How edevil the Boss Incubator is )!
At the beginning Homura is in the top left corner of the LOOPS (1, 1), and the exit of the labyrinth is in the bottom right corner (R, C )). given the probability of transmissions of each portal, your task is help poor Homura calculate the specific Ct magic power she need to escape from the LOOPS.




 
InputThe first line contains two integers R and C (2 <= R, C <= 1000 ).

The following R lines, each contains C * 3 real numbers, at 2 decimal places. every three numbers make a group. the first, second and third number of the cth group of line r represent the probability of transportation to grid (r, c), grid (r, c + 1 ), grid (r + 1, c) of the portal in grid (r, c) respectively. two groups of numbers are separated by 4 spaces.

It is ensured that the sum of three numbers in each group is 1, and the second numbers of the rightmost groups are 0 (as there are no grids on the right of them) while the third numbers of the downmost groups are 0 (as there are no grids below them ).

You may ignore the last three numbers of the input data. They are printed just for looking neat.

The answer is ensured no greater than 1000000.

Terminal at EOF


 
OutputA real number at 3 decimal places (round to), representing the specific Ct magic power Homura need to escape from the LOOPS.

 
Sample Input

2 20.00 0.50 0.50 0.50 0.00 0.500.50 0.50 0.00 1.00 0.00

 
Sample Output

6.000

 
Dp [I] [j] indicates the expected number of steps for point (I, j) to arrive at (r, c:

Special processing stays at the point with a probability of 1.

# Include <iostream> # include <cstdio> # include <cstring> # include <algorithm> # include <limits. h> typedef long LL; using namespace std; const int maxn = 1000 + 100; double dp [maxn] [maxn]; double p [maxn] [maxn] [3]; int r, c; int main () {while (~ Scanf ("% d", & r, & c) {for (int I = 1; I <= r; I ++) {for (int j = 1; j <= c; j ++) scanf ("% lf", & p [I] [j] [0], & p [I] [j] [1], & p [I] [j] [2]);} memset (dp, 0, sizeof (dp )); for (int I = r; I> = 1; I --) {for (int j = c; j> = 1; j --) {if (p [I] [j] [0] = 1) continue; else dp [I] [j] = (dp [I] [j + 1] * p [I] [j] [1] + dp [I + 1] [j] * p [I] [j] [2] + 2) /(1-p [I] [j] [0]) ;}} printf ("%. 3f \ n ", dp [1] [1]);} return 0 ;}

UPC 2225: The number of stepsDescription

Mary stands in a strange maze, the maze looks like a triangle (the first layer have one room, the second layer have two rooms, the third layer have three rooms ...). Now she stands at the top point (the first layer), and the KEY of this maze is in the lowest layer's leftmost room. known that each room can only access to its left room and lower left and lower right rooms. if a room doesn' t have its left room, the probability of going to the lower left room and lower right room are a and B (a + B = 1 ). if a room only has it's left room, the probability of going To the room is 1. if a room has its lower left, lower right rooms and its left room, the probability of going to each room are c, d, e (c + d + e = 1 ). now, Mary wants to know how many steps she needs to reach the KEY. dear friend, can you tell Mary the expected number of steps required to reach the KEY?

 

InputThere are no more than 70 test cases. in each case, first Input a positive integer n (0 <n <45), which means the layer of the maze, then Input five real number a, B, c, d, e. (0 <= a, B, c, d, e <= 1, a + B = 1, c + d + e = 1 ). the input is terminated with 0. this test case is not to be processed. output

Please calculate the expected number of steps required to reach the KEY room, there are 2 digits after the decimal point.

Sample Input

30.3 0.70.1 0.3 0.60

Sample Output

3.41

# Include <iostream> # include <cstdio> # include <cstring> # include <algorithm> # include <limits. h> typedef long LL; using namespace std; double a, B, c, d, e; double dp [50] [50]; int main () {int n; while (~ Scanf ("% d", & n) {scanf ("% lf", & a, & B, & c, & d, & e); for (int I = 1; I <= n; I ++) dp [n] [I] = i-1; for (int I = n-1; i> = 1; I --) {dp [I] [1] = dp [I + 1] [1] * a + dp [I + 1] [2] * B + 1; for (int j = 2; j <= I; j ++) dp [I] [j] = dp [I + 1] [j] * c + dp [I + 1] [j + 1] * d + dp [I] [J-1] * e + 1 ;} printf ("%. 2f \ n ", dp [1] [1]);} return 0 ;}

POJ 2096

Description

Ivan is fond of collecting. unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. when Ivan gets a new program, he classifies all possible bugs into n categories. each day he discovers exactly one bug in the program and adds information about it and its category into a spreadsheet. when he finds bugs in all bug categories, he callthe program disgusting, publishes this spreadsheet on his home page, and forgets completely about the program.
Two companies, Macrosoft and Microhard are in tight competition. microhard wants to decrease sales of one Macrosoft program. they hire Ivan to prove that the program in question is disgusting. however, Ivan has a complicated problem. this new program has s subcomponents, and finding bugs of all types in each subcomponent wocould take too long before the target cocould be reached. so Ivan and Microhard agreed to use a simpler criteria --- Ivan shocould find at least one bug in each subsystem and at least one bug of each category.
Macrosoft knows about these plans and it wants to estimate the time that is required for Ivan to call its program disgusting. it's important because the company releases a new version soon, so it can correct its plans and release it quicker. nobody wocould be interested in Ivan's opinion about the reliability of the obsolete version.
A bug found in the program can be of any category with equal probability. similarly, the bug can be found in any given subsystem with equal probability. any particle bug cannot belong to two different categories or happen simultaneously in two different subsystems. the number of bugs in the program is almost infinite, so the probability of finding a new bug of some category in some subsystem does not reduce after finding any number of bugs of that category in that subsystem.
Find an average time (in days of Ivan's work) required to name the program disgusting.

Input

Input file contains two integer numbers, n and s (0 <n, s <= 1 000 ).

Output

Output the expectation of the Ivan's working days needed to call the program disgusting, accurate to 4 digits after the decimal point.

Sample Input

1 2

Sample Output

3.0000

# Include <iostream> # include <cstdio> # include <cstring> # include <algorithm> # include <limits. h> typedef long LL; using namespace std; double dp [1100] [1000]; double n, s; int main () {while (~ Scanf ("% lf", & n, & s) {dp [(int) n] [(int) s] = 0.0; for (int I = n; i> = 0; I --) {for (int j = s; j> = 0; j --) {if (I = n & j = s) continue; dp [I] [j] = (n * s + (n-I) * j * dp [I + 1] [j] + I * (s-j) * dp [I] [j + 1] + (n-I) * (s-j) * dp [I + 1] [j + 1]) /(n * s-I * j);} printf ("%. 4lf \ n ", dp [0] [0]);} return 0 ;}

Expected DP