poj 1038 三进制状态压缩dp

跟1185思路一样，不过思路要复杂一点，内存限制比较严格，用滚动数组

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define IMAX 2147483646
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace std;

const int p[11] = { 1,3,9,27,81,243,729,2187,6561,19683,59049 };
int t, m, n, k, a, b, flag;
int mp[255][21], f[2][59049 + 10], v[21],*f1,*f2;

void mark(int last) {
	for (int k = 1; k <= m; k++, last /= 3) {
		//cout << k << endl;
		if (last % 3 == 2)v[k] = 1;
		else if (last % 3 == 1)v[k] = 0;
		else v[k] = 2;
	}
}

void dfs(int last, int x, int len, int now, int cnt) {
	if (len > m) {
		f2[now] = max(f2[now], f1[last] + cnt);
		return;
	}
	if (v[len] == 2) {
		flag = 1;
		for (int i = 0; i < 2; i++)
			for (int j = 0; j < 3; j++)
				if (mp[x + i][len + j] == 1)flag = 0;
		if (len + 2 > m || x + 1 > n || 
			v[len + 1] != 2 || v[len + 2] != 2)flag = 0;
		if (flag) {
			dfs(last, x, len + 3, now + p[len - 1] + p[len] + p[len + 1], cnt + 1);
		}
		
		flag = 1;
		for (int i = 0; i < 3; i++)
			for (int j = 0; j < 2; j++)
				if (mp[x + i][len + j] == 1) flag = 0;
		if (len + 1 > m || x + 2 > n ||
			v[len + 1] != 2)flag = 0;
		if (flag) {
			//cout << "asddas" << endl;
			dfs(last, x, len + 2, now + 2 * p[len - 1] + 2 * p[len], cnt + 1);
		}

	}
	if (v[len] == 1)
		dfs(last, x, len + 1, now + p[len - 1], cnt);
	if (v[len] == 0 || v[len] == 2)
		dfs(last, x, len + 1, now, cnt);
}

int main() {
	scanf("%d", &t);
	while (t--) {
		scanf("%d%d%d", &n, &m, &k);
		memset(mp, 0, sizeof(mp));
		for (int i = 0; i < k; i++)
			scanf("%d%d", &a, &b), mp[a][b] = 1;
		memset(f, -INF, sizeof(f));
		f[0][0] = 0;
		f1 = f[0];
		f2 = f[1];
		for (int i = 0; i < n; i++,swap(f1,f2)) {
			for (int j = 0; j < p[m]; j++)
				f2[j] = -INF;
			for (int j = 0; j < p[m]; j++) {
				if (f1[j] < 0)continue;
				mark(j);
				dfs(j, i + 1, 1, 0, 0);
			}
		}
		int ans = 0;
		for (int i = 0; i < p[m]; i++) 
			ans = max(ans, f1[i]);
		
		printf("%d\n", ans);
	}

	return 0;
}