Codeforces 919 C. Seat Arrangements

 

C. Seat Arrangements

 

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

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)

 

这个题，特判1那里hack一堆人，改了就可以，不用搜索，直接暴力就可以。

 

代码:

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<algorithm>
 5 #include<cmath>
 6 #include<queue>
 7 #include<map>
 8 using namespace std;
 9 const int maxn=1e4+5;
10 const double eps=1e6;
11 const int inf=1<<30;
12 char s[maxn][maxn];
13 int main(){ 14 int n,m,k; 15 ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); 16 while(cin>>n>>m>>k){ 17 memset(s,0,sizeof(s)); 18 for(int i=1;i<=n;i++) 19 cin>>s[i]; 20 int ans=0,l=0; 21 for(int i=1;i<=n;i++){ 22 l=0; 23 for(int j=0;j<=m-1;j++){ 24 if(s[i][j]=='.')l++; 25 else{ 26 ans+=max(0,l-k+1); 27 l=0; 28  } 29 if(j==(m-1)&&s[i][j]!='*') 30 ans+=max(0,l-k+1); 31  } 32  } 33 for(int j=0;j<=m-1;j++){ 34 l=0; 35 for(int i=1;i<=n;i++){ 36 if(s[i][j]=='.') l++; 37 else{ 38 ans+=max(0,l-k+1); 39 l=0; 40  } 41 if(i==n&&s[i][j]!='*') 42 ans+=max(0,l-k+1); 43  } 44  } 45 if(k==1) ans/=2; 46 cout<<ans<<endl; 47  } 48 }

 

 

转载于:https://www.cnblogs.com/ZERO-/p/9703647.html