问题 F: Educational Problem II

内存限制：512 MB 时间限制：4 S 标准输入输出

题目类型：传统评测方式：Special Judge 上传者：

提交：1 通过：1

链接：https://ac.nowcoder.com/acm/contest/57362/F
来源：牛客网
You are given

n, m, l, r

and a matrix

B=(bi,j)n×mB=(b_{i,j})_{n\times m}

.

Count the number of integer sequence

a1,a2,…,ana_1,a_2,\ldots,a_n

satisfying the following conditions, modulo

998244353998\,244\,353

$∀i∈Z∩[1,n]\forall i \in \mathbb{Z} \cap [1,n]$ , $\le a_i \le r$ .
$∀i∈Z∩[1,n]\forall i \in \mathbb{Z} \cap [1,n]$ , $∃S⊆Z∩[1,m]\exists S \subseteq \mathbb{Z} \cap [1,m]$ , $ai=⨁j∈Sbi,ja_i = \bigoplus_{j \in S} b_{i,j}$ . That is, $a_i$ is equal to the bitwise XOR sum of some subsequence of $(bi,1,bi,2,…,bi,m)(b_{i,1},b_{i,2},\ldots,b_{i,m})$ , and $a_i = 0$ if the subsequence is empty.
The number of $\in \mathbb{Z} \cap [2,n]$ that $ai−1≠aia_{i-1} \neq a_{i}$ is minimized among all the sequences satisfying the above two conditions.

The first line contains four integers

n, m, l, r

(

\le n \le 10^5

\le nm^2 \le 4 \times 10^7

\le l \le r < 2^m

).
The

i

-th of the following

n

lines contains

m

integers

bi,1,bi,2,…,bi,mb_{i,1},b_{i,2},\ldots,b_{i,m}

(

\le b_{i,j} < 2^m

).
Please note that

l,r,b_{i,j}

are given in binary notation length of

m




Output an integer representing the answer.
样例输入2：
3 2 11 11
01 00
01 10
00 10
样例输出2：
0
样例输入3：
5 3 100 110
111 011 111
100 100 001
111 111 010
001 101 010
110 010 010
样例输出3：
8

问题 F: Educational Problem II

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

问题 F: Educational Problem II

题目描述

输入格式

输出格式

输入样例 复制

输出样例 复制

输入样例复制

输出样例复制