洛谷 P1896 [SCOI2005]互不侵犯 递推/动归 （可状态压缩)

洛谷 P1896 [SCOI2005]互不侵犯

题目描述
在N×N的棋盘里面放K个国王，使他们互不攻击，共有多少种摆放方案。国王能攻击到它上下左右，以及左上左下右上右下八个方向上附近的各一个格子，共8个格子。

输入格式
只有一行，包含两个数N，K （ 1 <=N <=9, 0 <= K <= N * N）

输出格式
所得的方案数

递推/动态规划
只考虑一行，一行合法状态必须保证每个国王至少间隔1，用按位与判断，用二进制记录合法的行状态，共valid_line_king_cnt个。
定义f[N][valid_line_king_cnt][K]
f[i][j][k]表示第i行、行状态id为j的情况、[0,i]行一共放了k个国王的情况下有几种方案
最后把最后一行且一共K个国王的方案数相加。

#include<iostream>
#include<fstream>
#include<iomanip>
#include<algorithm>
#include<vector>
using namespace std;

int calc_king_cnt(int _line_state)
{
	int king_cnt = 0;
	while (_line_state!=0)
	{
		int tmp = _line_state % 2;
		king_cnt += tmp;
		_line_state = _line_state / 2;
	}
	return king_cnt;
}

int main()
{
	int N,K;
	//ifstream infile;
	//infile.open("oj_data.txt", ios::in);
	//if (!infile)
	//	cerr << "ifstream error" << endl;
	//infile >> N>>K;
	cin >> N >> K;
	
	int max_line_state = (1 << N) - 1;
	int valid_line_state_cnt = 0;
	vector<int> valid_line_state_vec;
	for (int line_state = 0; line_state <= max_line_state; ++line_state)
	{
		if ((line_state&(line_state << 1)) == 0)
		{
			valid_line_state_vec.push_back(line_state);
			++valid_line_state_cnt;
		}
	}
	vector<int> valid_line_king_cnt_vec;
	for (int i = 0; i < valid_line_state_cnt; ++i)
	{
		int valid_line_state = valid_line_state_vec[i];
		int king_cnt = calc_king_cnt(valid_line_state);
		valid_line_king_cnt_vec.push_back(king_cnt);
	}

	// f[line_id][line_state_id][king_num]
	long long ***f = new long long**[N];
	for (int line_id=0;line_id<N;++line_id)
	{
		f[line_id] = new long long*[valid_line_state_cnt];
		for (int line_state_id = 0; line_state_id < valid_line_state_cnt; ++line_state_id)
		{
			f[line_id][line_state_id] = new long long[K+1];
		}
	}
	// first line
	for(int line_id=0;line_id<N;++line_id)
		for(int line_state_id=0;line_state_id<valid_line_state_cnt;++line_state_id)
			for (int king_num = 0; king_num < K+1; ++king_num)
			{
				f[line_id][line_state_id][king_num] = 0;
			}
	for (int i=0;i<valid_line_state_cnt;++i)
	{
		int line_king_cnt = valid_line_king_cnt_vec[i];
		f[0][i][line_king_cnt] = 1;
	}

	// other lines
	for (int line_id = 1; line_id < N; ++line_id)
	{
		for (int line_state_id = 0; line_state_id < valid_line_state_cnt; ++line_state_id)
		{
			int line_state = valid_line_state_vec[line_state_id];
			int line_state_king_cnt = valid_line_king_cnt_vec[line_state_id];
			int attack_state = line_state | (line_state << 1) | (line_state >> 1);
			for (int upper_line_state_id = 0; upper_line_state_id < valid_line_state_cnt; ++upper_line_state_id)
			{
				int upper_line_state = valid_line_state_vec[upper_line_state_id];
				if ((attack_state&upper_line_state) == 0)
				{
					// two lines are valid
					for (int king_num = line_state_king_cnt; king_num <= K; ++king_num)
						f[line_id][line_state_id][king_num] += f[line_id - 1][upper_line_state_id][king_num - line_state_king_cnt];
				}
			}
		}
	}

	long long case_num = 0;
	for (int line_state_id = 0; line_state_id < valid_line_state_cnt; ++line_state_id)
	{
		case_num += f[N - 1][line_state_id][K];
	}
	cout << case_num;


	return 0;
}

注意long long，否则有的测试点超出int范围
进一步可以状态压缩，只存储当前行和前一行的状态