#P13602. [NWRRC 2022] Easily Distinguishable Triangles

[NWRRC 2022] Easily Distinguishable Triangles

题目描述

Eva loves painting. Today she is working with a square canvas of n×nn \times n unit cells. Each cell is painted white, painted black, or empty --- not painted at all.

Eva is going to draw a black triangle inside each empty cell. She wants each triangle to be right-angled and have an area of 12\frac{1}{2} square unit cells. Thus, there are four ways to draw a single triangle:

Each triangle is a piece of art, and Eva wants them to be easily distinguishable from the rest of the painting. To achieve that, no two black triangles may share a common side with each other, and no black triangle may share a common side with a black square. Note that two black squares are allowed to share a common side.

Help Eva to find out how many ways there are to finish her painting. Since the number can be large, calculate it modulo 998244353998\,244\,353.

输入格式

The first line contains a single integer nn --- the side length of the canvas (1n10001 \le n \le 1000).

The next nn lines describe the canvas from top to bottom. The ii-th of these lines contains nn characters si,1,si,2,,si,ns_{i, 1}, s_{i, 2}, \ldots, s_{i, n}. If si,j=s_{i, j} = .\tt{.}, the cell in the ii-th row and the jj-th column of the canvas is painted white. If si,j=s_{i, j} = #\tt{\#}, that cell is painted black. If si,j=s_{i, j} = ?\tt{?}, that cell is empty.

输出格式

Print a single integer denoting the number of ways to finish Eva's painting, modulo 998244353998\,244\,353.

2
.?
?#
4
3
#??
#??
?##
1
3
.#.
#?#
.#.
0

提示

In the first example test, there are 44 ways to finish the painting, as illustrated below:

In the second example test, there is a single way to finish the painting:

In the third example test, regardless of how Eva draws the triangle in the center cell, it will share two sides with black squares.