QOJ.ac

QOJ

Limite de temps : 2.0 s Limite de mémoire : 256 MB Points totaux : 100 Hackable ✓

#14122. Subcubes

Statistiques

Vasya 有一个包含 $2^n$ 个元素的数组,其下标由长度为 $n$ 的二进制字符串表示。初始时,数组中的所有元素均为 $0$。

随后,他进行了 $m$ 次如下操作:选择一个模板(一个由 01 和问号 ? 组成的字符串),并将相同的值赋给所有下标与该模板匹配的元素。现在,他想要求出数组中所有元素的和。请帮助他解决这个问题。

输入格式

第一行包含两个整数 $n$ 和 $m$ ($1 \le n, m \le 32$)。

接下来的 $m$ 行,每行包含一个字符串 $s$ 和一个整数 $q$,分别表示当前操作的模板和赋的值 ($0 \le q \le 10^9$)。

输出格式

输出该问题的答案。

样例

输入样例 1

3 2
?0? 2
1?? 3

输出样例 1

16

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.