Boolean Computer

题意翻译

现有一种二元位运算方式，定义为 $\odot$ ，运算数均在区间 $[0,2^w)$ 内，他使用数字门进行运算，运算法则由一个长度为 $w$ 的字符串构成，设为 $s$ ， $s$ 仅包含 $\texttt{A,O,X,a,o,x}$ ，分别表示 与，或，异或，与非，或非，同或，表示每一位的运算法则。真值表见上。 具体地， $x\odot y \ (s) =z$ 的运算方式如下： + $z$ 的二进制的**从高到低**第 $i$ 位的结果是 $x$ 和 $y$ 的第 $i$ 位通过 $s_i$ 对应的运算得到的。 现有 $n$ 个数，分别为 $a_1,a_2,\cdots ,a_n$，每个数都在区间 $[0,2^w)$ 内，又有 $Q$ 组询问，每次询问给定门运算的运算法则 $s$ ，询问有多少对**有序对** $(x,y)$ 满足 $a_x \odot a_y = 0$ （注意 $x$ 可以等于 $y$）。 ~~想了半天怎么翻译留个名吧 qaq~~ By @wasa855

题目描述

Alice has a computer that operates on $ w $ -bit integers. The computer has $ n $ registers for values. The current content of the registers is given as an array $ a_1, a_2, \ldots, a_n $ . The computer uses so-called "number gates" to manipulate this data. Each "number gate" takes two registers as inputs and calculates a function of the two values stored in those registers. Note that you can use the same register as both inputs. Each "number gate" is assembled from bit gates. There are six types of bit gates: AND, OR, XOR, NOT AND, NOT OR, and NOT XOR, denoted "A", "O", "X", "a", "o", "x", respectively. Each bit gate takes two bits as input. Its output given the input bits $ b_1 $ , $ b_2 $ is given below: $ \begin{matrix} b_1 & b_2 & A & O & X & a & o & x \\ 0 & 0 & 0 & 0 & 0 & 1 & 1 & 1 \\ 0 & 1 & 0 & 1 & 1 & 1 & 0 & 0 \\ 1 & 0 & 0 & 1 & 1 & 1 & 0 & 0 \\ 1 & 1 & 1 & 1 & 0 & 0 & 0 & 1 \\ \end{matrix} $ To build a "number gate", one takes $ w $ bit gates and assembles them into an array. A "number gate" takes two $ w $ -bit integers $ x_1 $ and $ x_2 $ as input. The "number gate" splits the integers into $ w $ bits and feeds the $ i $ -th bit of each input to the $ i $ -th bit gate. After that, it assembles the resulting bits again to form an output word. For instance, for $ 4 $ -bit computer we might have a "number gate" "AXoA" (AND, XOR, NOT OR, AND). For two inputs, $ 13 = 1101_2 $ and $ 10 = 1010_2 $ , this returns $ 12 = 1100_2 $ , as $ 1 $ and $ 1 $ is $ 1 $ , $ 1 $ xor $ 0 $ is $ 1 $ , not ( $ 0 $ or $ 1 $ ) is $ 0 $ , and finally $ 1 $ and $ 0 $ is $ 0 $ . You are given a description of $ m $ "number gates". For each gate, your goal is to report the number of register pairs for which the "number gate" outputs the number $ 0 $ . In other words, find the number of ordered pairs $ (i,j) $ where $ 1 \leq i,j \leq n $ , such that $ w_k(a_i, a_j) = 0 $ , where $ w_k $ is the function computed by the $ k $ -th "number gate".

输入输出格式

输入格式

The first line contains three integers: $ w $ , $ n $ , and $ m~(1 \leq w \leq 12, 1 \leq n \leq 3\cdot 10^4, 1 \leq m \leq 5\cdot 10^4) $ — the word size, the number of variables, and the number of gates. The second line contains $ n $ integers $ a_1, a_2, \ldots, a_n $ $ (0 \leq a_i < 2^w) $ — the value of variables stored in the registers. Each of the next $ m $ lines contains a string $ g_j~(|g_j| = w) $ with a description of a single gate. Each character of $ g_j $ is one of "A", "O", "X", "a", "o", "x".

输出格式

Print $ m $ lines. The $ i $ -th line should contain the number of ordered pairs of variables for which the $ i $ -th gate returns zero.

输入输出样例

输入样例 #1

4 3 1
13 10 6
AXoA

输出样例 #1

3

输入样例 #2

1 7 6
0 1 1 0 1 0 0
A
O
X
a
o
x

输出样例 #2

40
16
25
9
33
24

输入样例 #3

6 2 4
47 12
AOXaox
AAaaAA
xxxxxx
XXXXXX

输出样例 #3

2
3
0
2

输入样例 #4

2 2 2
2 0
xO
Ox

输出样例 #4

2
0

说明

In the first test case, the inputs in binary are $ 1101 $ , $ 1010 $ , $ 0110 $ . The pairs that return $ 0 $ are $ (13, 6) $ , $ (6, 13) $ , and $ (6, 6) $ . As it was already mentioned in the problem statement, $ 13 \oplus 10 = 10 \oplus 13 = 12 $ . The other pairs are $ 13 \oplus 13 = 11 $ , $ 10 \oplus 10 = 8 $ and $ 10 \oplus 6 = 6 \oplus 10 = 4 $ .