bzoj 1004: [HNOI2008]Cards

置换群的问题。。。求出每个置换中的各个循环长度。

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int m, n, p, sr, sb, sg;
int tr[63], gg[63], dp[21][21][21], gl;
bool vis[63];
int calc()
{
    int i, j;
    memset(vis,0,sizeof(vis));
    memset(gg,0,sizeof(gg));
    gl=0;
    for(i=1;i<=n;i++){
        if(!vis[i]){
            ++gl;
            gg[gl]=1;
            for(j=tr[i];j!=i;j=tr[j]){
                vis[j]=1;
                gg[gl]++;
            }
        }
    }
    int r1, r2, r3;
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;
    for(i=1;i<=gl;i++)
        for(r1=sr;r1>=0;r1--) for(r2=sb;r2>=0;r2--) for(r3=sg;r3>=0;r3--){
            if(r1>=gg[i])
                dp[r1][r2][r3]=(dp[r1][r2][r3]+dp[r1-gg[i]][r2][r3])%p;
            if(r2>=gg[i])
                dp[r1][r2][r3]=(dp[r1][r2][r3]+dp[r1][r2-gg[i]][r3])%p;
            if(r3>=gg[i])
                dp[r1][r2][r3]=(dp[r1][r2][r3]+dp[r1][r2][r3-gg[i]])%p;
        }
    return dp[sr][sb][sg];
}
int main()
{
    int i, j, ans;
    while(~scanf("%d%d%d%d%d",&sr,&sb,&sg,&m,&p)){
        n=sr+sb+sg;
        ans=0;
        for(i=1;i<=n;i++) tr[i]=i;
        ans=calc();
        for(i=1;i<=m;i++){
            for(j=1;j<=n;j++)
                scanf("%d",&tr[j]);
            ans=(ans+calc())%p;
        }
        int tp=1;
        for(i=1;i<=p-2;i++)
            tp=(tp*(m+1))%p;
        printf("%d\n",ans*tp%p);
    }
    return 0;
}