Broken robot CodeForces - 24D （特殊矩阵O(n)消元）

You received as a gift a very clever robot walking on a rectangular board. Unfortunately, you understood that it is broken and behaves rather strangely (randomly). The board consists of N rows and M columns of cells. The robot is initially at some cell on the i-th row and the j-th column. Then at every step the robot could go to some another cell. The aim is to go to the bottommost (N-th) row. The robot can stay at it's current cell, move to the left, move to the right, or move to the cell below the current. If the robot is in the leftmost column it cannot move to the left, and if it is in the rightmost column it cannot move to the right. At every step all possible moves are equally probable. Return the expected number of step to reach the bottommost row.

Input

On the first line you will be given two space separated integers N and M (1 ≤ N, M ≤ 1000). On the second line you will be given another two space separated integers i and j (1 ≤ i ≤ N, 1 ≤ j ≤ M) — the number of the initial row and the number of the initial column. Note that, (1, 1) is the upper left corner of the board and (N, M) is the bottom right corner.

Output

Output the expected number of steps on a line of itself with at least 4 digits after the decimal point.

Examples

Input
10 10
10 4

Output
0.0000000000

Input
10 14
5 14

Output
18.0038068653

题意：n*m的矩阵，一开始机器人位于(x,y)位置，可以在原地不动，或者向左走，或者向右走，或者向下走。走到左(右)边界就不可以再向左(右)走。每种选择的概率都相同，问走到第n行的期望步数是多少。(原地不动也算是一步）

题解：代码写得太烂了（自己都看不下去了），贴一篇别人的博客吧 https://blog.csdn.net/deerly_/article/details/82698999

#include<iostream>
#include<sstream>
#include<iterator>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<set>
#include<vector>
#include<bitset>
#include<climits>
#include<queue>
#include<iomanip>
#include<cmath>
#include<stack>
#include<map>
#include<ctime>
#include<new>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define MT(a,b) memset(a,b,sizeof(a))
const int INF  =  0x3f3f3f3f;
const int O    =  1e6;
const int mod  =  1e6 + 3;
const int maxn =  1005;
const double PI  =  acos(-1.0);
//const double E   =  2.718281828459;
const long double eps = 1e-12;

double a[maxn], y[maxn], x[maxn], b[maxn];

int main(){
    int n, m, xx, yy; cin >> n >> m >> xx >> yy;

    if(m == 1) {
        printf("%.20f\n", 2.0 * (n - xx));
        return 0;
    }
    n -= (xx - 1);

    for(int c = n -1; c > 0; c --) {
        for(int i=m; i>0; i--) {
            if(i == m || i == 1) y[i] = 1 + x[i] / 3;
            else y[i] = 1 + x[i] / 4;
            a[i] = 0;
        }
        a[m] = 2.0 / 3;
        a[m-1] = - 1.0 / 3;

        b[m] = 2.0 / 3;
        for(int i=m-1; i>1; i--) {
            y[i] = y[i] - (-1.0 / 4 / a[i+1]) * y[i+1];
            a[i-1] = -1.0 / 4;
            a[i] = 3.0 / 4 - (-1.0 / 4 / a[i+1]) * a[i];
            a[i+1] = -1.0 / 4 - (-1.0 / 4 / a[i+1]) * a[i+1];
            b[i] = a[i];
        }
        x[1] = (y[1] - (-1.0 / 3 / a[2]) * y[2]) / (2.0 / 3 - (-1.0 / 3 / a[2]) * a[1]);
        for(int i=2; i<=m; i++) {
            if(i != m) x[i] = (y[i] - (-1.0 / 4) * x[i-1]) / b[i];
            else x[i] = (y[i] - (-1.0 / 3) * x[i-1]) / b[i];
        }
    }
    printf("%.20f\n", x[yy]);
    return 0;
}