Light OJ 1151 (概率DP、高斯消元)

题目链接：https://vjudge.net/problem/LightOJ-1151

思路：

    因为这不是个DAG，所以记忆化会出现环。这种情况就要用高斯消元了。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<iostream>
#include<map>
#include<cmath>
#define fin freopen("a.txt","r",stdin)
#define fout freopen("out.txt", "w", stdout)
using namespace std;
const int maxn = 100 + 10;
const double eps = 1e-7;
double a[maxn][maxn], x[maxn];
bool l[maxn];
int G[maxn];

int solve(double a[][maxn], double ans[], bool l[maxn], const int& n)
{
    int res = 0, r = 0;
    for(int i = 0; i < n; i++)
        l[i] = false;
    for(int i = 0; i < n; i++) {
        for(int j = r; j < n; j++)
           if(fabs(a[j][i] > eps)) {
              for(int k = i; k <= n; k++)
                swap(a[j][k], a[r][k]);
              break;
           }
        if(fabs(a[r][i]) < eps) {
            ++res;
            continue;
        }
        for(int j = 0; j < n; j++)
           if(j != r && fabs(a[j][i]) > eps) {
              double tmp = a[j][i] / a[r][i];
              for(int k = i; k <= n; ++k)
                a[j][k] -= tmp * a[r][k];
           }
        l[i] = true, ++r;
    }

    for(int i = 0; i < n; i++)
        if(l[i])
           for(int j = 0; j < n; j++)
              if(fabs(a[j][i]) > 0)
                 ans[i] = a[j][n] / a[j][i];
    return res;

}



int main()
{
	fin;
    int T, kase = 0, n, u, v;
    scanf("%d", &T);
    while(T--)
    {
    	memset(a, 0, sizeof a);
    	scanf("%d", &n);
        memset(G, -1, sizeof G);
        for(int i = 1; i <= n; i++)
        {
            scanf("%d%d", &u, &v);
            u--; v--;
            G[u] = v;
        }
        for(int i = 0; i < 94; i++)
        {
        	if(G[i] >= 0)
        	{
        		a[i][i] = 1;
        		a[i][G[i]] = -1;
        		continue;
        	}
        	a[i][i] = 6;
        	for(int j = i+1; j <= i+6; j++) a[i][j] = -1.0;
        	a[i][100] = 6.0;
        }
        for(int i = 94; i < 99; i++)
        {
        	if(G[i] >= 0)
        	{
        		a[i][i] = 1;
        		a[i][G[i]] = -1;
        	}
        	else
        	{
        		a[i][i] = 1.0 * (99-i);;
        		for(int j = i+1; j <= 99; j++)
        			a[i][j] = -1.0;
        		a[i][100] = 6.0;
        	}
        }
        a[99][99] = 1.0;
        solve(a, x, l, 100);
        printf("Case %d: %.10f\n", ++kase, x[0]);
    }
    return 0;
}