CF1758E.Tick, Tock

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Tannhaus, the clockmaker in the town of Winden, makes mysterious clocks that measure time in $h$ hours numbered from $0$ to $h-1$ . One day, he decided to make a puzzle with these clocks.

The puzzle consists of an $n \times m$ grid of clocks, and each clock always displays some hour exactly (that is, it doesn't lie between two hours). In one move, he can choose any row or column and shift all clocks in that row or column one hour forward $^\dagger$ .

The grid of clocks is called solvable if it is possible to make all the clocks display the same time.

While building his puzzle, Tannhaus suddenly got worried that it might not be possible to make the grid solvable. Some cells of the grid have clocks already displaying a certain initial time, while the rest of the cells are empty.

Given the partially completed grid of clocks, find the number of ways $^\ddagger$ to assign clocks in the empty cells so that the grid is solvable. The answer can be enormous, so compute it modulo $10^9 + 7$ .

$^\dagger$ If a clock currently displays hour $t$ and is shifted one hour forward, then the clock will instead display hour $(t+1) \bmod h$ .

$^\ddagger$ Two assignments are different if there exists some cell with a clock that displays a different time in both arrangements.

输入格式

The first line of input contains $t$ ( $1 \leq t \leq 5 \cdot 10^4$ ) — the number of test cases.

The first line of each test case consists of 3 integers $n$ , $m$ , and $h$ ( $1 \leq n, m \leq 2 \cdot 10^5$ ; $1 \leq h \leq 10^9$ ) — the number of rows in the grid, the number of columns in the grid, and the number of the hours in the day respectively.

The next $n$ lines each contain $m$ integers, describing the clock grid. The integer $x$ ( $-1 \leq x < h$ ) in the $i$ -th row and the $j$ -th column represents the initial hour of the corresponding clock, or if $x = -1$ , an empty cell.

It is guaranteed that the sum of $n \cdot m$ over all test cases does not exceed $2 \cdot 10^5$ .

输出格式

For each test case, output the number of ways to assign clocks in the empty cells so that the grid is solvable. The answer can be huge, so output it modulo $10^9 + 7$ .

输入输出样例

输入#1

5
2 3 4
1 0 -1
-1 -1 2
2 2 10
1 2
3 5
4 5 1024
1 -1 -1 -1 -1
-1 -1 -1 1000 -1
-1 -1 -1 -1 69
420 -1 -1 999 -1
3 3 3
-1 -1 1
2 -1 1
2 -1 2
3 3 3
1 -1 2
-1 0 -1
-1 1 0

输出#1

说明/提示

For the first sample, this is a possible configuration for the clocks:

1	0	3
0	3	2

This is solvable since we can:

Move the middle column forward one hour.
Move the third column forward one hour.
Move the third column forward one hour.
Move the second row forward one hour.

After that all the clocks show one hour.For the second test case, it can be shown that there are no possible solvable clock configurations.

首页