Problem 2642 --Bitset I - Bit Mask

2642: Bitset I - Bit Mask

$57.89\%$ 下一题

Time Limit	$5$ 秒/Second(s)	Memory Limit	$512$ 兆字节/Megabyte(s)
提交总数	$38$	正确数量	$22$
裁判形式	标准裁判/Standard Judge	我的状态	尚未尝试
难度		分类标签	STL

Description

Bit Mask

A state with $n$ flags of ON or OFF can be represented by a sequence of bits where $0, 1, . . ., n - 1$ th flag corresponds to 1 (ON) or 0 (OFF). The state can be managed by the corresponding decimal integer, because the sequence of bits is a binary representation where each bit is 0 or 1.

On the other hand, a mask is a special bit sequence which can be used to set specified bits of a given bit sequence to ON/OFF. It can also be used to extract/exclude a bit sequence based on a specified pattern.

Given a sequence of bits with 64 flags which represent a state, perform the following operations using a set of pre-defined masks. Note that each flag of the bits is initialized by OFF.

test(i): Print 1 if $i$ -th flag is ON, otherwise 0
set(m): Set flags specified by mask $m$ to ON
clear(m): Set flags specified by mask $m$ to OFF
flip(m): Inverse flags specified by mask $m$
all(m): Print 1 if all flags specified by mask $m$ are ON, otherwise 0
any(m): Print 1 if at least one flag specified by mask $m$ is ON, otherwise 0
none(m): Print 1 if all flags specified by mask $m$ are OFF, otherwise 0
count(m): Print the number of flags specifed by mask $m$ with ON
val(m): Print the decimal value of the state specified by mask $m$

Input

The input is given in the following format.

 $n$   $m a s k_{0}$   $m a s k_{1}$  :  $m a s k_{n - 1}$   $q$   $q u e r y_{1}$   $q u e r y_{2}$  :  $q u e r y_{q}$

$n$ represents the number of masks. $m a s k_{i}$ represents state of $i$ -th mask and is given in the following format:

 $k$   $b_{0}$   $b_{1}$  ...  $b_{k}$

$k$ is the number of ON in the bits. The following $k$ integers $b_{j}$ show that $b_{j}$ -th bit is ON.

$q u e r y_{i}$ represents $i$ -th query and is given in the following format:

0  $i$

1  $m$

2  $m$

3  $m$

4  $m$

5  $m$

6  $m$

7  $m$

8  $m$

The first digit 0, 1,...,8 represents the operation test(i), set(m), clear(m), flip(m), all(m), any(m), none(m), count(m) or val(m) respectively.

Output

Output

Print the result in a line for each test, all, any, none, count and val operation.

Sample Input复制

Sample Output复制

提示

$1 \leq n \leq 10$
$1 \leq k \leq 64$
$1 \leq q \leq 200, 000$
$0 \leq i < 64$
$0 \leq m < n$

本题记录	用户（点击查看用户）	运行号（点击购买题解）	时间
算法最快[ $19$ ms]	郭菡	1062531	2024-01-14 22:11:23
内存最少[ $1192$ KB]	马佳俊	1162945	2025-01-09 21:23:09
第一AC	thisislike	1053673	2023-12-26 19:03:36
第一挑战	AOJ大管家	437227	2019-06-08 13:06:47

赛题来源/所属竞赛会津大学《C++ Programming II》 C++程序设计（高级）

竞赛编号	竞赛名称	竞赛时间	访问比赛
1849	2024-2025-1学期《程序设计技能实训》博弈论、二进制和位运算【24计算机】	2024-12-15 08:00:00	请登录
1790	2023-2024-1学期《程序设计技能实训》博弈论、二进制和位运算【23计算机】	2023-12-18 00:00:00	请登录

2642: Bitset I - Bit Mask

Description

Bit Mask

Input

Output

Output Print the result in a line for each test, all, any, none, count and val operation.

Output

Sample Input复制

Sample Output复制

提示

推荐代码 查看2642 所有题解 var params = { subject: '视频播放', coin_amount:50, word:2642, goods_id: 31 }; 上传题解视频得图灵币

赛题来源/所属竞赛 会津大学《C++ Programming II》 C++程序设计（高级）

Output

Print the result in a line for each test, all, any, none, count and val operation.

推荐代码查看2642 所有题解上传题解视频得图灵币

赛题来源/所属竞赛会津大学《C++ Programming II》 C++程序设计（高级）