CF 24 D. Broken robot dp(概率，高斯消元)

D. Broken robot

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 thej-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

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define for0(a, n) for (int (a) = 0; (a) < (n); (a)++)
#define for1(a, n) for (int (a) = 1; (a) <= (n); (a)++)
#define eps  (1e-7)
typedef long long ll;
typedef pair<int, int> pii;
const int INF =0x3f3f3f3f;
const int maxn= 1000   ;

int n,m;
double E[maxn+10][maxn+10];
int sy,sx;

double A[maxn+10][maxn+10];
double X[maxn+10];
bool in(int x)
{
    return 0<=x&&x<m;
}

void guass_elimination()//m行 m+1 列 三对角矩阵
{
    int cur,col;
    for(cur=0,col=0;cur<m&&col<m ;col++,cur++)
    {
        //A[cur][col]一定不为0

        //因为是三对角矩阵，所以最多是底下一行的几列需要减去该行*k


            double tmp=  A[cur+1][col]/A[cur][col];
            A[cur+1][col+1]-= A[cur][col+1]*tmp;
            A[cur+1][m]-=A[cur][m]*tmp;

    }

    for(int i=cur-1;i>=0;i--)
    {
        X[i]=A[i][m];
        for(int k=i+2;k>i;k--) if(i<m)
        {
             X[i]-=A[i][k]*X[k];
        }
        X[i]/=A[i][i];
    }


}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        scanf("%d%d",&sy,&sx);
        sy--;sx--;
        for0(j,m)
        {
            E[n-1][j]=0;
        }
        for(int i=n-2;i>=sy;i--)
        {
//            memset(A,0,sizeof A);因为是三对角矩阵，且没有进行两行交换。所以根本不用memset
            for0(j,m)
            {
//                E[i][j]=1.0+1.0/4*E[i][j-1]+1.0/4*E[i][j+1]+1.0/4*E[i+1][j]+1.0/4*E[i][j];
                int num=1;
                for(int tj=j-1;tj<=j+1;tj++) if(in(tj))
                {
                    num++;
                    A[j][tj]=-1.0;
                }
                A[j][j]=num-1;
                A[j][m]= num+E[i+1][j];

            }
            guass_elimination();//m行m+1列矩阵
            for0(j,m)
            {
                E[i][j]=X[j];
            }

        }
        printf("%.10f\n",E[sy][sx]);

    }

   return 0;
}