简单易懂的C - Seat Arrangements

Suppose that you are in a campus and have to go for classes day by day. As you may see, when you hurry to a classroom, you surprisingly find that many seats there are already occupied. Today you and your friends went for class, and found out that some of the seats were occupied.

The classroom contains n rows of seats and there are m seats in each row. Then the classroom can be represented as an n × m matrix. The character '.' represents an empty seat, while '*' means that the seat is occupied. You need to find kconsecutive empty seats in the same row or column and arrange those seats for you and your friends. Your task is to find the number of ways to arrange the seats. Two ways are considered different if sets of places that students occupy differs.

Input

The first line contains three positive integers n, m, k (1 ≤ n, m, k ≤ 2 000), where n, mrepresent the sizes of the classroom and k is the number of consecutive seats you need to find.

Each of the next n lines contains m characters '.' or '*'. They form a matrix representing the classroom, '.' denotes an empty seat, and '*' denotes an occupied seat.

Output

A single number, denoting the number of ways to find k empty seats in the same row or column.

Example

Input

2 3 2
**.
...

Output

3

Input

1 2 2
..

Output

1

Input

3 3 4
.*.
*.*
.*.

Output

0

Note

In the first sample, there are three ways to arrange those seats. You can take the following seats for your arrangement.

• (1, 3), (2, 3)
• (2, 2), (2, 3)
• (2, 1), (2, 2)

其实本来用的bfs  但尚未成功  还需努力啊

大意 ：有n行m列座椅  * 表示有人  ， .表示空位  现在需要k个连续座椅 要么一列连续  要么一行连续  则有多少方式安排

上代码 详细解释

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ma 2005
int c[ma][ma];///列数组
int r[ma][ma];///行数组
char cc[ma][ma];///字符数组
int n , m ,k;
int main()
{
    while( scanf("%d%d%d", &n, &m, &k) != EOF)
    {
        int i , j;
        memset( c, 0 ,sizeof( c ));
        memset( r, 0, sizeof( r ));
        memset( cc, 0, sizeof( cc ));
        int cnt = 0;
        for( i = 1; i<=n; i++)
        {
            scanf("%s",cc[i]+1);
        }
        for( i = 1; i<=n; i++)
        {
            for( j =1; j<=m; j++)
            {
                if( cc[i][j] == '.')
                {
                    cnt++;

                    c[i][j] = c[i-1][j]+1;.///则在上行同列的基础上加1

                    r[i][j] = r[i][j-1] +1;///则在左列同行的基础上加1
                }
            }
        }
        if( k == 1 )///k == 1单独处理 有几个.则有几种方式
        {
            printf("%d\n", cnt);
            continue;
        }
        cnt = 0;
        for( i =k; i<=n; i++)
        {
            for( j = 1; j<=m; j++)
            {
                if( c[i][j] - c[i-k][j] == k)///如果连续K个 则是一种方式
                    cnt++;
            }
        }
        for( i  =1; i<=n; i++)
        {
            for( j = k; j<=m; j++)
            {
                if( r[i][j] - r[i][j-k] == k)
                    cnt++;同上
            }
        }
        printf("%d\n", cnt);
    }

}

共勉啊