POJ 3735 Training little cats （快速求幂，稀疏矩阵）

题意：给出三个整数n,m,k。表示有n只猫，k个操作（由以下三种组合而成），对这k个操作重复m遍。输出最后每只猫拥有的花生。

g i : Let the ith cat take a peanut. 让第i只猫剥一个花生
e i : Let the ith cat eat all peanuts it have.让第i只猫吃掉它所有的花生
s i j : Let the ith cat and jth cat exchange their peanuts.交换i,j的花生

题解：如果用三元组解稀疏矩阵的应该会更快。

#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 102
#define lint __int64
using namespace std;

class CMatrix
{
     public:
         lint elem[MAXN][MAXN];
         void init ( int, int, int );
         CMatrix operator* (CMatrix);
         CMatrix operator+ (CMatrix);
         CMatrix power( lint );
     private:
         int row, col;
         int modulo;
};

void CMatrix::init ( int flag, int r, int c )
{
    for ( int i = 0; i < r; i++ )
        for ( int j = 0; j < c; j++ )
        {
            if ( i == j ) elem[i][j] = flag;
            else elem[i][j] = 0;
        }
    row = r; col = c;
}

CMatrix CMatrix::operator+ ( CMatrix param )
{
    CMatrix ret;
    ret.init ( 0, row, col );
    for ( int i = 0; i < row; i++ )
        for ( int j = 0; j < col; j++ )
            ret.elem[i][j] = ( elem[i][j] + param.elem[i][j] );
    return ret;
}


CMatrix CMatrix::operator* ( CMatrix param )
{
    CMatrix ret;
    ret.init ( 0, row, col );

    for ( int i = 0; i < row; i++ )
        for ( int j = 0; j < col; j++ )
            if ( elem[i][j] != 0 )
                for ( int k = 0; k < param.col; k++ )
                    ret.elem[i][k] += elem[i][j] * param.elem[j][k];
    return ret;
}

CMatrix CMatrix::power ( lint exp )
{
    CMatrix ret;
    ret.init ( 1, row, col );
    CMatrix tmp = *this;
    while ( exp >= 1 )
    {
        if ( exp & 1 )
            ret = ret * tmp;
        tmp = tmp * tmp;
        exp >>= 1;
    }
    return ret;
}

int main()
{
    lint n, m, k;
    CMatrix oper, res, begin;
    while ( 1 )
    {
        scanf("%I64d%I64d%I64d",&n,&m,&k); getchar();
        if ( !n && !m && !k ) break;
        int i, x, y; char ch;

        begin.init ( 0, n + 1, 1 );
        begin.elem[n][0] = 1;
        oper.init ( 1, n+1, n+1 );
        while ( k-- )
        {
            scanf("%c",&ch);
            if ( ch == 'g')
            {
                scanf("%d",&x); getchar();
                for ( i = 0; i < n + 1; i++ )
                    oper.elem[x-1][i] += oper.elem[n][i];
            }
            else if ( ch == 's' )
            {
                scanf("%d%d",&x,&y); getchar();
                for ( i = 0; i < n + 1; i++ )
                    swap(oper.elem[x-1][i], oper.elem[y-1][i]);
            }
            else
            {
                scanf("%d",&x); getchar();
                for ( i = 0; i < n + 1; i++ )
                    oper.elem[x-1][i] = 0;
            }
        }
        oper = oper.power ( m );
        res = oper * begin;
        for ( i = 0; i < n; i++ )
            printf("%I64d ",res.elem[i][0]);
        printf("\n");
    }
    return 0;
}