hdu 2167 pebbles

Pebbles

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 632    Accepted Submission(s): 336

Problem Description

You're given an unlimited number of pebbles to distribute across an N x N game board (N drawn from [3, 15]), where each square on the board contains some positive point value between 10 and 99, inclusive. A 6 x 6 board might look like this:

The player distributes pebbles across the board so that:

?At most one pebble resides in any given square.
?No two pebbles are placed on adjacent squares. Two squares are considered adjacent if they are horizontal, vertical, or even diagonal neighbors. There's no board wrap, so 44 and 61 of row three aren't neighbors. Neither are 33 and 75 nor 55 and 92.

The goal is to maximize the number of points claimed by your placement of pebbles.

Write a program that reads in a sequence of boards from an input file and prints to stdout the maximum number of points attainable by an optimal pebble placement for each. 

 

Input

Each board is expressed as a series of lines, where each line is a space-delimited series of numbers. A blank line marks the end of each board (including the last one)

 

Output

then your program would print the maximum number of points one can get by optimally distributing pebbles while respecting the two rules, which would be this (each output should be printed on a single line and followed with a newline):

 

Sample Input

71 24 95 56 54 85 50 74 94 28 92 96 23 71 10 23 61 31 30 46 64 33 32 95 89 78 78 11 55 20 11 98 54 81 43 39 97 12 15 79 99 58 10 13 79 83 65 34 17 85 59 61 12 58 97 40 63 97 85 66 90 33 49 78 79 30 16 34 88 54 39 26 80 21 32 71 89 63 39 52 90 14 89 49 66 33 19 45 61 31 29 84 98 58 36 53 35 33 88 90 19 23 76 23 76 77 27 25 42 70 36 35 91 17 79 43 33 85 33 59 47 46 63 75 98 96 55 75 88 10 57 85 71 34 10 59 84 45 29 34 43 46 75 28 47 63 48 16 19 62 57 91 85 89 70 80 30 19 38 14 61 35 36 20 38 18 89 64 63 88 83 45 46 89 53 83 59 48 45 87 98 21 15 95 24 35 79 35 55 66 91 95 86 87 94 15 84 42 88 83 64 50 22 99 13 32 85 12 43 39 41 23 35 97 54 98 18 85 84 61 77 96 49 38 75 95 16 71 22 14 18 72 97 94 43 18 59 78 33 80 68 59 26 94 78 87 78 92 59 83 26 88 91 91 34 84 53 98 83 49 60 11 55 17 51 75 29 80 14 79 15 18 94 39 69 24 93 41 66 64 88 82 21 56 16 41 57 74 51 79 49 15 59 21 37 27 78 41 38 82 19 62 54 91 47 29 38 67 52 92 81 99 11 27 31 62 32 97 42 93 43 79 88 44 54 48

 

Sample Output

572 683 2096 2755

 

题意： 有一个N*N的格子 3 <= N <= 15 每个格子的数在 10~99   然后从中取出若干个格子的数字， 使得和最大。 并且取一个格子的数后， 这个数的周围8个格子的数就不能再取了。输出最大值。

思路： 状态压缩DP  

状态压缩其实也是很暴力。  只不过， 它是在该行的状态 有可能的情况下进行暴力。

比如说5*5的格子 如果11000本来就是不可能的 就不遍历。包括  11111  11110 11100 011111 等等。

所以先预处理 然后暴力！

#include 
#include 
#include 
using namespace std;
int num[20][20], dp[2][1 << 15], top = 0, sta[1 << 15], n, ans, row;
char ch[1000];
int main() {
	for(int i = 0; i < 1 << 15; ++i)
		if((i & (i << 1)) == 0)
			sta[top++] = i;
	ans = row = 0;
	memset(dp, 0, sizeof(dp));
	while(gets(ch)) {
		if(strcmp(ch, "") == 0) {
			for(int i = 0; i < row; ++i) {
				for(int j = 0; j < top && sta[j] < (1 << row); ++j) {
					int sum = 0, max_s = 0;
					//第i行 在状态sta[j]下的总和 
					for(int k = 0; k < row; ++k)
						sum += sta[j] & (1 << k) ? num[i][k] : 0;
					//取出状态sta[j]下的 与上一行最大的 
					for(int k = 0; k < top && sta[k] < (1 << row); ++k) 
						if(!(sta[j] & sta[k]) && !(sta[j] & sta[k] << 1) && !(sta[j] << 1 & sta[k]))
							max_s = max(max_s, dp[1 - (i & 1)][sta[k]]);
				//	printf("%d %d\n", sum, max_s);
					//覆盖该状态的新的最大值 
					dp[i & 1][sta[j]] = sum + max_s;
					ans = max(ans, sum + max_s);
					/*
for(int k = 0; k < 8; ++k)
						printf("%d ", dp[0][k]);
					printf("\n");
					for(int k = 0; k < 8; ++k)
						printf("%d ", dp[1][k]);
					printf("\n\n\n");*/
				}
			}
			printf("%d\n", ans);
			row = ans = 0;
			memset(dp, 0, sizeof(dp));
			continue;
		}
		int temp = 0, k = 0;
		for(int i = 0; ch[i]; ++i)
			if(ch[i] == ' ')
				num[row][k++] = temp, temp = 0;
			else
				temp = temp * 10 + ch[i] - '0';
		num[row][k++] = temp;
		row++;
	} 
}