306688: CF1237F. Balanced Domino Placements
Memory Limit:512 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Balanced Domino Placements
题意翻译
给你一个$n\times m$的棋盘,上面已经放了$k$个的骨牌($1\times2$) 对于一个骨牌的每个格子,不能有其他骨牌的格子和它在同一列,同一行 你可以在剩下的格子里放骨牌,也可以不放 问这个棋盘有多少种放骨牌的方案,对$998244353$取模 $1\le n,m\le3600,0\le k\le2400$题目描述
Consider a square grid with $ h $ rows and $ w $ columns with some dominoes on it. Each domino covers exactly two cells of the grid that share a common side. Every cell is covered by at most one domino. Let's call a placement of dominoes on the grid perfectly balanced if no row and no column contains a pair of cells covered by two different dominoes. In other words, every row and column may contain no covered cells, one covered cell, or two covered cells that belong to the same domino. You are given a perfectly balanced placement of dominoes on a grid. Find the number of ways to place zero or more extra dominoes on this grid to keep the placement perfectly balanced. Output this number modulo $ 998\,244\,353 $ .输入输出格式
输入格式
The first line contains three integers $ h $ , $ w $ , and $ n $ ( $ 1 \le h, w \le 3600 $ ; $ 0 \le n \le 2400 $ ), denoting the dimensions of the grid and the number of already placed dominoes. The rows are numbered from $ 1 $ to $ h $ , and the columns are numbered from $ 1 $ to $ w $ . Each of the next $ n $ lines contains four integers $ r_{i, 1}, c_{i, 1}, r_{i, 2}, c_{i, 2} $ ( $ 1 \le r_{i, 1} \le r_{i, 2} \le h $ ; $ 1 \le c_{i, 1} \le c_{i, 2} \le w $ ), denoting the row id and the column id of the cells covered by the $ i $ -th domino. Cells $ (r_{i, 1}, c_{i, 1}) $ and $ (r_{i, 2}, c_{i, 2}) $ are distinct and share a common side. The given domino placement is perfectly balanced.
输出格式
Output the number of ways to place zero or more extra dominoes on the grid to keep the placement perfectly balanced, modulo $ 998\,244\,353 $ .
输入输出样例
输入样例 #1
5 7 2
3 1 3 2
4 4 4 5
输出样例 #1
8
输入样例 #2
5 4 2
1 2 2 2
4 3 4 4
输出样例 #2
1
输入样例 #3
23 42 0
输出样例 #3
102848351