# Codeforces Round #141 (Div. 2) C. Fractal Detector（神奇的状压DP）（好题）

C. Fractal Detector
time limit per test
4 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Little Vasya likes painting fractals very much.

He does it like this. First the boy cuts out a 2 × 2-cell square out of squared paper. Then he paints some cells black. The boy calls the cut out square a fractal pattern. Then he takes a clean square sheet of paper and paints a fractal by the following algorithm:

1. He divides the sheet into four identical squares. A part of them is painted black according to the fractal pattern.
2. Each square that remained white, is split into 4 lesser white squares, some of them are painted according to the fractal pattern. Each square that remained black, is split into 4 lesser black squares.

In each of the following steps step 2 repeats. To draw a fractal, the boy can make an arbitrary positive number of steps of the algorithm. But he need to make at least two steps. In other words step 2 of the algorithm must be done at least once. The resulting picture (the square with painted cells) will be a fractal. The figure below shows drawing a fractal (here boy made three steps of the algorithm).

One evening Vasya got very tired, so he didn't paint the fractal, he just took a sheet of paper, painted a n × m-cell field. Then Vasya paint some cells black.

Now he wonders, how many squares are on the field, such that there is a fractal, which can be obtained as described above, and which is equal to that square. Square is considered equal to some fractal if they consist of the same amount of elementary not divided cells and for each elementary cell of the square corresponding elementary cell of the fractal have the same color.

Input

The first line contains two space-separated integers n, m (2 ≤ n, m ≤ 500) — the number of rows and columns of the field, correspondingly.

Next n lines contain m characters each — the description of the field, painted by Vasya. Character "." represents a white cell, character "*" represents a black cell.

It is guaranteed that the field description doesn't contain other characters than "." and "*".

Output

On a single line print a single integer — the number of squares on the field, such that these squares contain a drawn fractal, which can be obtained as described above.

Sample test(s)
input
6 11
......*.***
*.*.*....**
.***....*.*
..***.*....
.*.*.....**
......*.*..

output
3

input
4 4
..**
..**
....
....

output
0

Note

The answer for the first sample is shown on the picture below. Fractals are outlined by red, blue and green squares.

The answer for the second sample is 0. There is no fractal, equal to the given picture.

//GNU C++	Accepted	3742 ms	47700 KB
#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cstdio>
#include <ctime>
#include <bitset>
#include <algorithm>
#define SZ(x) ((int)(x).size())
#define ALL(v) (v).begin(), (v).end()
#define foreach(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)
#define REP(i,n) for ( int i=1; i<=int(n); i++ )
using namespace std;
typedef long long ll;

const int N = 550;
int n,m;
char mp[N][N];
bool dp[N][N][1<<4][10];
int main()
{
scanf("%d%d",&n,&m);
REP(i,n)scanf("%s",mp[i]+1);
REP(i,n)REP(j,m)
{
dp[i][j][(1<<4)-1][0] = (mp[i][j] == '*');
}
REP(k,9)
{
int d = (1<<(k-1));
REP(x,n) REP(y,m)
{
int nx[4]={x,x,x+d,x+d},ny[4]={y,y+d,y,y+d};
bool flag = 1;
for(int p = 0;p <= 3;p++)
{
int xx = nx[p],yy = ny[p];
if(xx > n || yy > m)
{
flag = 0;
continue;
}
if(mask & (1<<p)) flag &= dp[xx][yy][(1<<4)-1][k-1];
}
}
}
int ans = 0;
for(int k = 2;k <= 9;k++) ans += dp[x][y][mask][k];
cout<<ans<<endl;
}


• 本文已收录于以下专栏：

## Codeforces Round #459 (Div. 2) C. The Monster

• ffgcc
• 2018年01月30日 09:48
• 45

## Codeforces Round #406 (Div. 2)：C. Berzerk（记忆化搜索解决博弈问题）

C. Berzerk time limit per test 4 seconds memory limit per test 256 megabytes input standard in...
• Jaihk662
• 2017年03月24日 15:23
• 870

## 【解题报告】Codeforces Round #367 (Div. 2)

• TRiddle
• 2016年08月12日 21:37
• 735

## Codeforces Round #204 (Div. 1)　A. Jeff and Rounding

A. Jeff and Rounding time limit per test 1 second memory limit per test 256 megabytes ...
• u010422038
• 2013年10月05日 08:54
• 1480

## Codeforces Round #350 (Div. 2)（C）模拟

C. Cinema time limit per test 2 seconds memory limit per test 256 megabytes input ...
• qq_24489717
• 2016年05月06日 15:29
• 478

## Codeforces Round #459 (Div. 2)The Monster[匹配问题]

C. The Monster time limit per test 1 second memory limit per test 256 megabytes input standard...
• Haipai1998
• 2018年01月30日 15:20
• 122

## Codeforces Round #254 (Div. 1)C. DZY Loves Colors(线段树经典操作/分块)

• fouzhe
• 2017年02月11日 15:17
• 277

## Codeforces Round #214 (Div. 2) C. Dima and Salad （背包变形）

C. Dima and Salad time limit per test 1 second memory limit per test 256 megabytes ...
• u010228612
• 2013年12月10日 22:16
• 1316

## Codeforces Round #299 (Div. 2) C. Tavas and Karafs

【题意】这题看了好久好久！其实就是个二分水题！ 首先给出a,b,n 这是一个由a开头，b为公差，长度无限的等差数列 然后n个询问 输入l,t,m 取这个数列从l开始，m个数，每一次这个数...
• just_sort
• 2016年05月09日 21:02
• 204

## Codeforces Round #116 (Div. 2, ACM-ICPC Rules) C - Letter

#include #include #include #include #include #include #include #include #include #include #include #...
• zz_1215
• 2012年04月22日 17:53
• 533

举报原因： 您举报文章：Codeforces Round #141 (Div. 2) C. Fractal Detector（神奇的状压DP）（好题） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)