#102010. [BZOJ 2010] [Ceoi2010]bodyguard

为保证会场安全，专家确定了每一行每一列的保镖数，这个信息以一种压缩的形式给出。确定是否有可能实现这样一种方案，在每行每列安排确定数量的保镖。假设座位最初都是空的，也就是说保安可以被安排在任意一个座位上。 题目等价于已知一个 矩阵的每行、每列各有多少个 ，问这样的矩阵是否存在。

输入数据归纳为：有 个正整数对 表示这个 矩阵一共有 行，其中有 个行都含有 个 。 同样的，有 个正整数对 和 来表示列的信 息。

The input begins with the description of the rows. The first line of the input contains one positive integer : the number of groups of rows. lines follow. Each of these lines contains positive integers: the required number of bodyguards in each row of the group and the number of rows that form the group. This is followed by the description of column groups. The next line contains one positive integer : the number of groups of columns. lines follow. Each of these lines contains positive integers: the required number of bodyguards in each column of the group and the number of columns that form the group.

Output a single line with the number 1 if the constraints are satisfiable and the number 0 otherwise.

样例输入 #1

2
2 1
1 2
1
2 2

样例输出 #1

1

样例说明 1

There are two groups of rows: the first one has one row that must contain two bodyguards, the second one has two rows that must contain one bodyguard each. There is one group of columns: each of the two columns must contain two bodyguards. One possible placement of bodyguards:

 XX
 X.
 .X

样例输入 #2

2
3 2
1 1
2
3 2
1 1

样例输出 #2

0

样例说明 2

Two of the rows are required to be full of bodyguards. Hence there must be at least two bodyguards in each column. However, the last column must only contain one bodyguard, which is a contradiction.

对于 的数据，，最多有 名保镖。

对于 的数据，保镖总数最多为 ，所有数字均为正整数，且不超过 ，。数据保证按行和按列计算的总保镖数相等。