Ticks solution codeforces

For Solution
Click Here!
Casimir has a rectangular piece of paper with a checkered field of size n×mn×m. Initially, all cells of the field are white.
Let us denote the cell with coordinates ii vertically and jj horizontally by (i,j)(i,j). The upper left cell will be referred to as (1,1)(1,1) and the lower right cell as (n,m)(n,m).
Casimir draws ticks of different sizes on the field. A tick of size dd (d>0d>0) with its center in cell (i,j)(i,j) is drawn as follows:
 First, the center cell (i,j)(i,j) is painted black.
 Then exactly dd cells on the topleft diagonally to the center and exactly dd cells on the topright diagonally to the center are also painted black.
 That is all the cells with coordinates (i−h,j±h)(i−h,j±h) for all hh between 00 and dd are painted. In particular, a tick consists of 2d+12d+1 black cells. Ticks solution codeforces
An already painted cell will remain black if painted again. Below you can find an example of the 4×94×9 box, with two ticks of sizes 22 and 33.
Determine whether this field can indeed be obtained by drawing some (possibly none) ticks of sizes d≥kd≥k or not.
Ticks solution codeforces
The first line contains an integer tt (1≤t≤1001≤t≤100) — the number test cases.
The following lines contain the descriptions of the test cases.
The first line of the test case description contains the integers nn, mm, and kk (1≤k≤n≤101≤k≤n≤10; 1≤m≤191≤m≤19) — the field size and the minimum size of the ticks that Casimir drew. The following nn lines describe the field: each line consists of mm characters either being ‘.‘ if the corresponding cell is not yet painted or ‘*‘ otherwise.
Print tt lines, each line containing the answer to the corresponding test case. The answer to a test case should be YES if the given field can be obtained by drawing ticks of at least the given size and NO otherwise.
You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes, and YES will all be recognized as positive answers).
Ticks solution codeforces
input
8 2 3 1 *.* ... 4 9 2 *.*.*...* .*.*...*. ..*.*.*.. .....*... 4 4 1 *.*. **** .**. .... 5 5 1 ..... *...* .*.*. ..*.* ...*. 5 5 2 ..... *...* .*.*. ..*.* ...*. 4 7 1 *.....* .....*. ..*.*.. ...*... 3 3 1 *** *** *** 3 5 1 *...* .***. .**..
Ticks solution codeforces
NO YES YES YES NO NO NO NO
Ticks solution codeforces
The first sample test case consists of two asterisks neither of which can be independent ticks since ticks of size 00 don’t exist.
The second sample test case is already described in the statement (check the picture in the statement). This field can be obtained by drawing ticks of sizes 22 and 33, as shown in the figure.
The field in the third sample test case corresponds to three ticks of size 11. Their center cells are marked with blueblue, redred and greengreen colors:
*.*. 
***** 
.****. 
…. 
Ticks solution codeforces
The field in the fourth sample test case could have been obtained by drawing two ticks of sizes 11 and 22. Their vertices are marked below with blueblue and redred colors respectively:
….. 
*…* 
.*.*. 
..**.* 
…**. 
Ticks solution codeforces
The field in the fifth sample test case can not be obtained because k=2k=2, and the last asterisk in the fourth row from the top with coordinates (4,5)(4,5) can only be a part of a tick of size 11.
The field in the sixth sample test case can not be obtained because the top left asterisk (1,1)(1,1) can’t be an independent tick, since the sizes of the ticks must be positive, and cannot be part of a tick with the center cell in the last row, since it is separated from it by a gap (a point, ‘.‘) in (2,2)(2,2).
In the seventh sample test case, similarly, the field can not be obtained by the described process because the asterisks with coordinates (1,2)(1,2) (second cell in the first row), (3,1)(3,1) and (3,3)(3,3) (leftmost and rightmost cells in the bottom) can not be parts of any ticks.

For Solution
Click Here!