ZOJ 2974 Just Pour the Water（矩阵快速幂）

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2974

给出一个水桶，里面有不同的谁，每分钟根据给出的要求平分水桶里的水。
使用矩阵乘法，要注意当输入为0时水留在原来的桶里

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#define mt(a) memset(a,0,sizeof a)
#define fl(a,b,c) fill(a,b,c)

#define inf 1000000000+7

using namespace std;


typedef long long ll;

typedef struct aaa
{
    double m[30][30];

}aaa;

int n;

aaa mulM(aaa &x, aaa& y)
{
    aaa temp;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            temp.m[i][j] = 0.0;
            for (int k = 1; k <= n; k++)
            {
                temp.m[i][j] = (temp.m[i][j] + x.m[i][k] * y.m[k][j]);
            }
        }
    }
    return temp;
}


int main()
{
    int T;
    cin >> T;
    aaa E;

    while (T--)
    {
        for (int i = 0; i < 30; i++)
        {
            for (int j = 0; j < 30; j++)
                E.m[i][j] = (i == j) ? 1.0 : 0.0;
        }
        aaa a;
        aaa p;
        memset(a.m, 0, sizeof a.m);
        memset(p.m, 0, sizeof p.m);
        scanf("%d", &n);

        for (int i = 1; i <= n; i++)
        {
            scanf("%lf", &a.m[1][i]);
        }
        for (int i = 1; i <= n; i++)
        {
            int z;
            scanf("%d", &z);
            if (z == 0)p.m[i][i] = 1.0;
            for (int j = 0; j < z; j++)
            {
                int temp;
                scanf("%d", &temp);
                p.m[i][temp] = 1.0 / z;
            }
        }
        int nn;
        scanf("%d", &nn);
        while (nn)
        {
            if (nn & 1)a = mulM(a, p);
            p = mulM(p, p);
            nn >>= 1;
        }
        for (int i = 1; i <= n; i++)
        {
            if (i != 1)printf(" ");
            printf("%.2lf", a.m[1][i]);
        }
        printf("\n");
    }
    return 0;
}