记录编号	392575	评测结果	AAAAAAAAAA
题目名称	1826.[HNOI 2008]Cards	最终得分	100
用户昵称	sxysxy	是否通过	通过
代码语言	C++	运行时间	0.025 s
提交时间	2017-04-08 09:47:27	内存使用	0.47 MiB

#include <cstdio>
#include <cstring>
#include <cstdarg>
#include <string>
#include <algorithm>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <cctype>
using namespace std;
const int MAXN = 110;
int pow_mod(int a, int x, int p){
  int ans = 1;
  for(a %= p; x; a = a*a%p, x >>= 1)if(x&1)ans = ans*a%p;
  return ans;
}
inline int inv(int x, int p){
  return pow_mod(x, p-2, p);
}
int f[MAXN/3][MAXN/3][MAXN/3], g[MAXN];
int sum[MAXN], id[MAXN], st[MAXN], size;
bool b[MAXN];
int n, MOD;
int sr, sg, sb;
int calc(){
  int size = 0; memset(b, false, sizeof(b)); memset(id, 0, sizeof(id));
  for(int i = 1; i <= n; i++){
    if(!b[i]){
      int ans = 0; //循环节大小...
      int j = i;
      while(!b[g[j]])j = g[j], b[j] = true, ans++; 
      st[++size] = ans; sum[size] = sum[size-1]+st[size]; id[sum[size]] = size;
    }
  }
  memset(f, 0, sizeof(f));
  f[0][0][0] = 1;
  for(int i = 0; i <= sr; i++)for(int j = 0; j <= sb; j++)for(int k = 0; k <= sg; k++){
    if(id[i+j+k]){
      int v = st[id[i+j+k]];
      if(i - v >= 0)f[i][j][k] = (f[i][j][k]+f[i-v][j][k])%MOD;
      if(j - v >= 0)f[i][j][k] = (f[i][j][k]+f[i][j-v][k])%MOD;
      if(k - v >= 0)f[i][j][k] = (f[i][j][k]+f[i][j][k-v])%MOD;
    }
  }
  return f[sr][sb][sg];
}
int main(){
  //freopen("test_data.txt", "r", stdin);
  freopen("hnoi_cards.in", "r", stdin); freopen("hnoi_cards.out", "w", stdout);
  int m;
  scanf("%d %d %d %d %d", &sr, &sb, &sg, &m, &MOD);
  n = sr+sb+sg;
  int ans = 0;
  for(int i = 1; i <= m; i++){
    for(int i = 1; i <= n; i++)scanf("%d", g+i);
    ans = (ans+calc())%MOD;
  }
  for(int i = 1; i <= n; i++)g[i] = i;
  ans = (ans+calc())%MOD;
  ans = ans*inv(m+1, MOD)%MOD;
  printf("%d\n", ans);
  return 0;
}