CF237D Minesweeper 1D

最新推荐文章于 2014-04-25 20:05:18 发布

原创最新推荐文章于 2014-04-25 20:05:18 发布 · 834 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

动态规划

本文介绍了一维扫雷游戏的算法实现，通过动态规划的方法计算合法布局的数量。文章提供了详细的解题思路及代码实现。

Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it contains a number from 0 to 2 — the total number of bombs in adjacent squares.

For example, the correct field to play looks like that: 001*2***101*. The cells that are marked with "*" contain bombs. Note that on the correct field the numbers represent the number of bombs in adjacent cells. For example, field 2* is not correct, because cell with value 2 must have two adjacent cells with bombs.

Valera wants to make a correct field to play "Minesweeper 1D". He has already painted a squared field with width of n cells, put several bombs on the field and wrote numbers into some cells. Now he wonders how many ways to fill the remaining cells with bombs and numbers are there if we should get a correct field in the end.

Input

The first line contains sequence of characters without spaces s₁s₂... s_n (1 ≤ n ≤ 10⁶), containing only characters "*", "?" and digits "0", "1" or "2". If character s_i equals "*", then the i-th cell of the field contains a bomb. If character s_i equals "?", then Valera hasn't yet decided what to put in the i-th cell. Character s_i, that is equal to a digit, represents the digit written in the i-th square.

Output

Print a single integer — the number of ways Valera can fill the empty cells and get a correct field.

As the answer can be rather large, print it modulo 1000000007 (10⁹ + 7).

   Sample test(s)
 
    input
  
?01???

    output
  
4

    input
  
?

    output
  
2

    input
  
**12

    output
  
0

    input
  
1

    output
  
0

   原文：
  http://blog.csdn.net/no__stop/article/details/21617291
 
题意：类似于扫雷游戏，但只有行，有些格子是已知的，有些未知，‘？’表示未知，其余为已知。'0'表示左右都没有雷，'1'表示左右一共有一个雷，'2'表示左右一共有两个雷，‘*’表示本身就是雷。问合法的情况一共有多少种？
解题思路:这似乎也是可以算作是某一类dp了吧，我已经做到过若干道类似的题了。只是暂时还没人给它取名字。状态是dp[i][j]，表示i位置符合j状态的有多少种合法状况。其中0<=i<len，0<=j<4。i表示在哪一个位置上，j=0表示i位置不是雷，i+1也不是雷，j=1表示i位置不是雷，但i+1是雷，j=2表示i位置是雷，i+1位置不是雷，j=3表示i和i+1都是雷。这么四种情况。然后就根据位置上的信息进行转移。方程如下：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 1000080
#define MOD 1000000007
#define LL long long int
LL dp[maxn][4];
char str[maxn];
int main()
{
	scanf("%s",str+1);
	int len = strlen(str+1);
	dp[0][0] = dp[0][1] = 1;
	for(int i = 1;i < len;i++)
	{
		if(str[i] == '0')
			dp[i][0] = dp[i-1][0];
		if(str[i] == '1'){
			dp[i][0] = dp[i-1][2];
			dp[i][1] = dp[i-1][0];
		}
		if(str[i] == '2')
			dp[i][1] = dp[i-1][2];
		if(str[i] == '*'){
			dp[i][2] = (dp[i-1][1] + dp[i-1][3])%MOD;
			dp[i][3] = (dp[i-1][1] + dp[i-1][3])%MOD;
		}
		if(str[i] == '?'){
			dp[i][0] = (dp[i-1][0] + dp[i-1][2])%MOD;
			dp[i][1] = (dp[i-1][0] + dp[i-1][2])%MOD;
			dp[i][2] = (dp[i-1][3] + dp[i-1][1])%MOD;
			dp[i][3] = (dp[i-1][1] + dp[i-1][3])%MOD;
		}
	}
	LL ans;
	if(str[len] == '0')
		ans = dp[len-1][0];
	else if(str[len] == '1')
		ans = dp[len-1][2];
	else if(str[len] == '2')
		ans = 0;
	else if(str[len] == '*')
		ans = (dp[len-1][1] + dp[len-1][3])%MOD;
	else ans = (dp[len-1][0] + dp[len-1][1] + dp[len-1][2] + dp[len-1][3])%MOD;
	printf("%I64d\n",ans);
	return 0;
}