Filling the Grid CodeForces - 1228B

Problem Description

Suppose there is a $h\times w$ grid consisting of empty or full cells. Let’s make some definitions:

1. $r_i$ is the number of consecutive full cells connected to the left side in the $i$-th row $(1\le i\le h)$. In particular, $ri=0$ if the leftmost cell of the $i$-th row is empty.
2. $cj$ is the number of consecutive full cells connected to the top end in the $j$-th column $(1\le j\le w)$. In particular, $cj=0$ if the topmost cell of the $j$-th column is empty.

In other words, the $i$-th row starts exactly with $ri$ full cells. Similarly, the $j$-th column starts exactly with $cj$ full cells.

These are the $r$ and $c$ values of some $3\times 4$ grid. Black cells are full and white cells are empty.
You have values of $r$ and $c$. Initially, all cells are empty. Find the number of ways to fill grid cells to satisfy values of $r$ and $c$. Since the answer can be very large, find the answer modulo $1000000007(10^9+7)$ . In other words, find the remainder after division of the answer by $1000000007(10^9+7)$.

Input

The first line contains two integers $h$ and $w$ $(1\le h,w\le 10^3)$ — the height and width of the grid.
The second line contains hh integers $r_1,r_2,\dots ,r_h(0\le r^i\le w)$ — the values of $r$.
The third line contains $w$ integers $c_1,c_2,\dots ,c_w(0\le cj\le h)$ — the values of c.

Output

Print the answer modulo $1000000007(10^9+7)$.

Examples

Input

3 4
0 3 1
0 2 3 0

Output

2

Input

1 1
0
1

Output

0

Input

19 16
16 16 16 16 15 15 0 5 0 4 9 9 1 4 4 0 8 16 12
6 12 19 15 8 6 19 19 14 6 9 16 10 11 15 4

Output

797922655

Note

In the first example, this is the other possible case.
In the second example, it’s impossible to make a grid to satisfy such $r$, $c$ values.
In the third example, make sure to print answer modulo $(10^9+7)$.

题意:

给一个$h\times w$的矩形，每一单位长宽有一个参数，参数表示这一单位的 $h(w)$ 所对应的矩形前 $r_i(c_j)$ 有多少个边长为1的正方形是涂黑的，问有多少种涂法。

思路：

从图上可以看出前 $r_i+1$ 和前 $w_j+1$ 涂的方式是一定的，只有满足$i>w_j$ 并且 $j>r_i$的情况，才有两种可能（涂与不涂），把每个点遍历一遍，就能求其结果。如果有行和列有矛盾直接输出 $0$;

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int mod=1e9+7;
int a[10010],b[10010];
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)scanf("%d",&a[i]);//a[]对应的是列 
	for(int i=0;i<m;i++)scanf("%d",&b[i]);//b[]对应行 
	int ans=1;
	for(int i=0;i<n;i++)
	for(int j=0;j<m;j++){
		if(i==b[j]&&j<a[i]){  // 列黑，行白 
			printf("0\n");
			return 0;
		}
		if(j==a[i]&&i<b[j]){   //行黑，列白 
			printf("0\n");
			return 0;
		}
		if(i>b[j]&&j>a[i])   //可涂可不涂 
		ans=(ans*2)%mod;
	}
	printf("%d\n",ans);
	return 0;
}  

实践是检验真理的唯一标准