盖房子 - المسألة

#3738. 盖房子

الإحصائيات

تم استخدام هذه المسألة في المسابقات التالية:

The 2016 Hunan Collegiate Programming Contest

Bobo 在 ICPCCamp 买了一块 $n \times m$ 的土地，其中有些格子是障碍。

他想选择两个矩形区域，建造两座房子。很明显，用于盖房子的区域不能包含障碍。同时，两个区域不能相交（但是可以相邻）。

Bobo 想知道所有可能不同方案的数量除以 $(10^9 + 7)$ 的余数。

输入

输入包含不超过 $10$ 组数据。

每组数据的第一行包含两个整数 $n, m$ ($1 \leq n, m \leq 10^3$).

接下来 $n$ 行中的第 $i$ 行包含一个长度为 $m$ 的字符串 $s_i$。$s_i$ 的第 $j$ 位是 0 则表示第 $i$ 行第 $j$ 列的格子是空地，是 1 则表示该格子是障碍。

输出

对于每组数据，输出一个整数表示所求的值。

样例输入

样例输出

5
160

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0