CodeForces 24D Broken robot(概率dp+三对角矩阵)

题意：现在有一个迷宫，在任何一个位置向各个方向移动的概率（可以不动）是相同的，问从起点到达最后一行的期望回合数是多少。

思路：概率dp，对于当前位置（i，j），有dp[i][j] = 1 + dp[I][j-1]/4 + dp[I][j]/4 + dp[I][j+1] /4,

注意这个式子不能使用高斯消元来求解，复杂度会爆炸，

其实对于每一行，这m个变量构成了m组等式，系数矩阵是一个三对角矩阵，也就是说只有对角线和与对角线相邻的两条斜线非零，所以可以用线性的时间求解

复杂度为O(n*m).

#include <bits/stdc++.h>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

const int MAXN = 1100;
//const int MOD = 1e9+7;
//const int INF = 0x3f3f3f3f;
int n, m, h, w;
double a[MAXN], b[MAXN], c[MAXN], d[MAXN], x[MAXN], dp[MAXN][MAXN];
void TDMA(int l, int n, int m) {
	for (int i = 1; i < n; i++) 
		c[i] = c[i] / (b[i]-c[i-1]*a[i]);
	for (int i = 1; i <= n; i++) 
		d[i] = (d[i]-d[i-1]*a[i])/(b[i]-c[i-1]*a[i]);
	dp[l][n] = d[n];
	for (int i = n-1; i >= 1; i--) 
		dp[l][i] = d[i] - c[i]*dp[l][i+1];
}
int main()
{
	//freopen("input.txt", "r", stdin);
	scanf("%d%d%d%d", &n, &m, &h, &w);
	if (m == 1) {
		printf("%.8f", (double)(n-h)*2.0);
		return 0;
	}
	for (int i = n-1; i >= h; i--) {
		b[1] = 2.0/3;
		c[1] = -1.0/3;
		d[1] = 1+dp[i+1][1]/3;
		if (m > 1) {
			b[m] = 2.0/3;
			a[m] = -1.0/3;
			d[m] = 1+dp[i+1][m]/3;
		}
		for (int j = 2; j < m; j++) {
			a[j] = c[j] = -1.0/4;
			b[j] = 3.0/4;
			d[j] = 1 + dp[i+1][j]/4;
		}
		TDMA(i, m, m);
	}
	printf("%.8f", dp[h][w]);
	return 0;
}