Codeforces 919C Seat Arrangements

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 k consecutive 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, m represent 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.

Examples

input

2 3 2
**.
...

output

3

input

1 2 2
..

output

1

input

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

output

0

题意： 给你n排m列的座位，其中‘.’代表空位，‘*’代表已占用。给你k个人， 这k个人只能连续坐在一排或者一列，问你有多少种安排方式。

思路： 由于一定连续，所以情况就很简单了，分别针对一行或一列来分析， 可以发现规律：定义X是一行或一列中连续的‘.’的个数，安排方式数 为X-k+1。注意特判当k==1时，我们会把一个点一排算一次，一列 算一次，除以2即可排除重复。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<queue>
#define ll long long
using namespace std;
char mp[2020][2020];
ll n,m,k;
int main()
{
    while(~scanf("%lld%lld%lld",&n,&m,&k))
    {
        for(ll i=1;i<=n;i++)scanf("%s",mp[i]+1);
        ll ans=0,num=0;
        if(k==1)                                     //k==1，防止重复，直接计算有几个'.'
        {
            for(ll i=1;i<=n;i++)
            {
                for(ll j=1;j<=m;j++)
                {
                    if(mp[i][j]=='.')num++;
                }
            }
            printf("%lld\n",num);
            continue;
        }
        for(ll i=1;i<=n;i++)                 //计算每一排方案数
        {
            num=0;
            for(ll j=1;j<=m;j++)
            {
                if(mp[i][j]=='.')num++;
                else
                {
                    num=num-k+1;
                    if(num>0)ans+=num;
                    num=0;
                }
            }
            num=num-k+1;
            if(num>0)ans+=num;
        }
        for(ll i=1;i<=m;i++)                //计算每一列方案数
        {
            num=0;
            for(ll j=1;j<=n;j++)
            {
                if(mp[j][i]=='.')num++;
                else
                {
                    num=num-k+1;
                    if(num>0)ans+=num;
                    num=0;
                }
            }
            num=num-k+1;
            if(num>0)ans+=num;
        }
        printf("%lld\n",ans);
    }
    return 0;
}