POJ 1038

POJ 1038

尼玛死，卡了1个星期，对状态压缩的精髓终于摸索到那么一点了，黑书例题，思路什么的都有了，我也是按照思路打出来的，惭愧，其实复杂度已经够了，没有剪枝，无限TLE了。不过还是搞出来了，道路那么曲折啊，不知道我的大学生涯能不能撑到我找到出口。

#include<iostream>
#include<map>
#include<vector>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<cstring>
#include<set>
#include<cmath>
using namespace std;
#define N 70000
int three[20];
int s[N][11];
int mark[N],ans,n,m,o,t,c;
int maps[200][15];
int dp[2][N];
void deal()
{
	three[1] = 1;
	int i,j;
	for(i = 2;i <= 12;i++)
	{
		three[i] = three[i - 1]*3;
	}
	for(i = 1;i < N;i++)
	{
		for(j = 1;j <= 10;j++)
		{
			s[i][j] = s[i - 1][j];
		}
		s[i][1] ++;
		j = 1;
		while(s[i][j] == 3)
		{
			s[i][j] = 0;
			s[i][++j]++;
		}
		for(j = 10;j >= 1;j--)
		{
			if(s[i][j] != 0)
			{
				mark[i] = j + 1;
				break;
			}
		}
		mark[0] = 1;
	}
}
void dfs(int num,int x,int cnt,int last)
{
	ans = max(ans,num);
	if(x + 1 <= m && s[cnt][x] + s[cnt][x + 1] + s[last][x] + s[last][x + 1] == 0)
	{
		int wtf = cnt + three[x]*2 + three[x + 1]*2;
		dp[t][wtf] = max(dp[t][wtf],num + 1);
		dfs(num + 1,x + 2,wtf,last);
	}
	if(x + 2 <= m && s[cnt][x] + s[cnt][x + 1] + s[cnt][x + 2] == 0)
	{
		int wtf = cnt + three[x]*2 + three[x + 1]*2 + three[x + 2]*2;
		dp[t][wtf] = max(dp[t][wtf],num + 1);
		dfs(num + 1,x + 3,wtf,last);
	}
	dp[t][cnt] = max(dp[t][cnt],num);
	if(x + 1 <= m)
		dfs(num,x + 1,cnt,last);
}
int main()
{
	deal();
	int i,j,k,l;
	scanf("%d",&c);
	while(c--)
	{
		scanf("%d%d%d",&n,&m,&o);
		memset(maps,0,sizeof(maps));
		memset(dp,-1,sizeof(dp));
		for(i = 0;i < o;i++)
		{
			scanf("%d%d",&j,&k);
			maps[j][k] = 1;
		}
		ans = 0;
		t = 1;
		for(i = 1,j = 0;i <= m;i++)
		{
			if(maps[1][i] == 1)
				j += three[i]*2;
			else
				j += three[i];
		}
		dp[t][j] = 0;
		ans = 0;
		for(i = 2;i <= n;i++)
		{
			t = 1 - t;
			for(j = 0;j < three[m + 1];j++)
			{
				dp[t][j] = -1;
			}
			for(j = 0;j < three[m + 1];j++)
			{		
				if(dp[t^1][j] == -1)
					continue;
				int cnt = 0;
				for(k = 1;k <= m;k++)
				{
					if(maps[i][k] == 1)
						cnt += three[k]*2;
					else if(s[j][k] == 2)
						cnt += three[k];
				}
				dfs(dp[t^1][j],1,cnt,j);
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}