noi07 count

今天写了一天，才写了两道题，效率太低了……

 

为了学连通性状压dp，我决定从简单的入手，听说这个题比较简单，ok，就拿你开刷了。

从下午2点开始写，写到晚上8点，终于写完这个“简单”的题了……吐血。。

 

主程序很简洁，比较纠结的是这两个dfs。我是分两次处理的，第一次计算hash，第二次计算转移矩阵，特纠结。

写完一看，其实也不长，只有117行，比rank都还少……

 

#include <stdio.h> #include <memory.h> #define maxstate 100 #define maxfact 125 #define maxmat 53 #define maxk 5 #define mod 65521 int count = 0; int map[maxk + 2]; int n, k; int hash[maxfact]; int mat[maxmat][maxmat]; int init[maxmat]; int rec[maxmat][maxk + 3]; int state; int mid[maxmat][maxmat]; int trans(int *p) { static int fact[6] = {1, 1, 2, 6, 24, 120}; int hash[7] = {0}, i, j = 0, ret = 0; for (i = 1; i <= k; ++i) if (!hash[p[i]]) hash[p[i]] = ++j; for (i = 1; i <= k; ++i) ret += (hash[p[i]] - 1) * fact[i - 1]; return ret; } int reset(int t, int v) { int i, ret = 0; for (i = k + 1; i; --i) if (map[i] == t) ret++, map[i] = v; return ret; } int find(int depth, int prev) { int i; if (depth > k) return hash[trans(map)] = ++count, 0; for (i = 1; i <= prev; ++i) map[depth] = i, find(depth + 1, prev); map[depth] = prev + 1, find(depth + 1, prev + 1); map[depth] = 0; } int build(int depth, int now, int rep) { int i, bak[maxk + 2]; if (depth > k && now == depth) { if (reset(map[1], map[1]) != 1) ++mat[hash[trans(map + 1)]][state]; return 0; } if (depth == k && now == depth) { ++init[state = hash[trans(map)]]; if (init[state] > 1) return 0; } memcpy(bak, map, sizeof(bak)); if (now == depth) ++depth, map[depth] = depth, build(depth, 1, depth); else { build(depth, now + 1, rep); if (map[now] != map[rep]) { reset(rep, map[now]); build(depth, now + 1, map[now]); } } memcpy(map, bak, sizeof(bak)); } int matmul(int (*a)[maxmat], int (*b)[maxmat], int (*ans)[maxmat]) { unsigned tmp[maxmat][maxmat], i, j; memset(tmp, 0, sizeof(tmp)); for (i = 1; i <= count; ++i) for (j = 1; j <= count; ++j) for (k = 1; k <= count; ++k) tmp[i][k] = (tmp[i][k] + a[i][j] * b[j][k]) % mod; memcpy(ans, tmp, sizeof(tmp)); } int main(int argc, char *argv[]) { FILE *fin = fopen("count.in", "r"); FILE *fout = fopen("count.out", "w"); int i, j, ans, (*p)[maxmat][maxmat] = &mat; long long n; fscanf(fin, "%d%I64d", &k, &n), n -= k; find(1, 0); build(0, 0, 0); for (i = 1; i <= count; ++i) mid[i][i] = 1; for (; n; n >>= 1) n & 1 ? matmul(mid, mat, mid) : 0, matmul(mat, mat, mat); for (ans = 0, i = 1; i <= count; ++i) ans += mid[1][i] * init[i] % mod; fprintf(fout, "%d/n", ans % mod); fclose(fin); fclose(fout); return 0; }