영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Your task is to create an n × n grid whose each row and column has exactly one A and B. Some of the characters have already been placed. In how many ways can you complete the grid?
Input
The first input line has an integer n: the size of the grid.
After this, there are n lines that describe the grid. Each line has n characters: . means an empty square, and A and B show the characters already placed.
You can assume that every row and column has at most one A and B.
Output
Print one integer: the number of ways modulo 10^9+7.
Constraints
- 2 ≤ n ≤ 500
예제
예제 1
5 ..... ..AB. ..... B.... ...A.
16